Application of Coloured Petri Net for Agent Control and Communication in the ABAsim Architecture Antonín Kavička University of Pardubice, Czech Republic.

Slides:



Advertisements
Similar presentations
Distributed Snapshots: Determining Global States of Distributed Systems Joshua Eberhardt Research Paper: Kanianthra Mani Chandy and Leslie Lamport.
Advertisements

1 Analysis of workflows : Verification, validation, and performance analysis. Wil van der Aalst Eindhoven University of Technology Faculty of Technology.
Formal Modelling of Reactive Agents as an aggregation of Simple Behaviours P.Kefalas Dept. of Computer Science 13 Tsimiski Str Thessaloniki Greece.
Uncoordinated Checkpointing The Global State Recording Algorithm Cristian Solano.
Programming Languages Marjan Sirjani 2 2. Language Design Issues Design to Run efficiently : early languages Easy to write correctly : new languages.
Describing Process Specifications and Structured Decisions Systems Analysis and Design, 7e Kendall & Kendall 9 © 2008 Pearson Prentice Hall.
CHAPTER 1: AN OVERVIEW OF COMPUTERS AND LOGIC. Objectives 2  Understand computer components and operations  Describe the steps involved in the programming.
Konstantin A. Aksyonov, Ph. D., IEEE member, Eugene A. Bykov, IEEE member Elena F. Smoliy Maksim V. Popov Leonid G. Dorosinskiy Ural State Technical University.
SEERE Workshop, Neum Tempura Retargeting Damyan Mitev, Vladimir Valkanov Plovdiv University “Paisii Hilendarski”
Petri net modeling of biological networks Claudine Chaouiya.
Kurt Jensen Lars M. Kristensen 1 Coloured Petri Nets Department of Computer Science Coloured Petri Nets Kurt Jensen & Lars Michael Kristensen (Edited by.
Banker’s Algorithm Implementation in CPN Tools Michal Žarnay Department of Transportation Networks University of Žilina, Slovakia.
The IDE (Integrated Development Environment) provides a DEBUGGER for locating and correcting errors in program logic (logic errors not syntax errors) The.
FunState – An Internal Design Representation for Codesign A model that enables representations of different types of system components. Mixture of functional.
CPN Models of Transport Systems Michal Zarnay Slovakia.
Modeling State-Dependent Objects Using Colored Petri Nets
Kendall & KendallCopyright © 2014 Pearson Education, Inc. Publishing as Prentice Hall 9 Kendall & Kendall Systems Analysis and Design, 9e Process Specifications.
A Colored Petri Net for a Multi-Agent Application Aarhus, Denmark - August 27, 2002 MOCA ‘02 Danny Weyns & Tom Holvoet K.U.Leuven - Belgium.
Let's Go All the Way: From Requirements via Colored Workflow Nets to a BPEL Implementation of a New Bank System Wil M. P. van der Aalst Jens Bæk Jørgensen.
Programming Logic and Design, Introductory, Fourth Edition1 Understanding Computer Components and Operations (continued) A program must be free of syntax.
/faculteit technologie management DEMO CPN-tools Ronny Mans Eindhoven University of Technology, Faculty of Technology Management, Department of Information.
Chapter 3 : Software Process and Other Models Juthawut Chantharamalee Curriculum of Computer Science Faculty of Science and Technology, Suan Dusit University.
Chapter 9 Introduction to ActionScript 3.0. Chapter 9 Lessons 1.Understand ActionScript Work with instances of movie clip symbols 3.Use code snippets.
02/06/05 “Investigating a Finite–State Machine Notation for Discrete–Event Systems” Nikolay Stoimenov.
Fuzzy Petri Nets of Education
Syntax & Semantic Introduction Organization of Language Description Abstract Syntax Formal Syntax The Way of Writing Grammars Formal Semantic.
Ontology Alignment/Matching Prafulla Palwe. Agenda ► Introduction  Being serious about the semantic web  Living with heterogeneity  Heterogeneity problem.
1 A Petri Net Siphon Based Solution to Protocol-level Service Composition Mismatches Pengcheng Xiong 1, Mengchu Zhou 2 and Calton Pu 1 1 College of Computing,
Simple Program Design Third Edition A Step-by-Step Approach
A Novel Method for Formally Detecting RFID Event Using Petri Nets SEKE 2011.
Chapter 11 Describing Process Specifications and Structured Decisions Systems Analysis and Design Kendall and Kendall Fifth Edition.
Workflow Treatment with Coloured Petri Nets Alexandru Cicortaş Diana
Describing Process Specifications and Structured Decisions Systems Analysis and Design, 7e Kendall & Kendall 9 © 2008 Pearson Prentice Hall.
Object Management Group (OMG) Specifies open standards for every aspect of distributed computing Multiplatform Model Driven Architecture (MDA)
Chapter 8 Structuring System Logical Requirements.
INTRODUCTION TO PL/SQL. Class Agenda Introduction Introduction to PL/SQL Declaring PL/SQL Variable Creating the Executable Section Interacting with the.
© 2011 Pearson Addison-Wesley. All rights reserved. Addison Wesley is an imprint of Stewart Venit ~ Elizabeth Drake Developing a Program.
Ch. 2. Specification and Modeling 2.1 Requirements Describe requirements and approaches for specifying and modeling embedded systems. Specification for.
Petri Nets: Their Development and Use in Production Planning Jeffrey E. Short, P.E. December 6, 2000.
Towards a High-Level Petri Net Type DefinitionWorkshop on Interchange Formats for Petri Nets 1/18 June 26, 2004 Towards a High-Level Petri Net Type Definition.
Visual Basic Programming
Dr.Basem Alkazemi
9 th International Workshop on Intuitionistic Fuzzy Sets and Generalized Nets, 8 October 2010, Warsaw, Poland Utilizing the Model Graphic Structures when.
1. 2 Preface In the time since the 1986 edition of this book, the world of compiler design has changed significantly 3.
Programming Languages and Design Lecture 3 Semantic Specifications of Programming Languages Instructor: Li Ma Department of Computer Science Texas Southern.
Petri Nets Invented by Carl Adam Petri in 1962 Concurrent systems with timing problems  Synchronization, race problem, deadlock A petri net consists of.
Modelling by Petri nets
Modeling Mobile-Agent-based Collaborative Processing in Sensor Networks Using Generalized Stochastic Petri Nets Hongtao Du, Hairong Qi, Gregory Peterson.
Decision Mining in Prom A. Rozinat and W.M.P. van der Aalst Joosung, Ko.
1 Copyright  2001 Pao-Ann Hsiung SW HW Module Outline l Introduction l Unified HW/SW Representations l HW/SW Partitioning Techniques l Integrated HW/SW.
CSCI1600: Embedded and Real Time Software Lecture 11: Modeling IV: Concurrency Steven Reiss, Fall 2015.
School of Computer Science & Software Engineering
Inferring Declarative Requirements Specification from Operational Scenarios IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL. 24, NO. 12, DECEMBER, 1998.
Introduction to Language Programming Hierarchy of programming lang. Based on machine independences: 1. Machine language 2. Assembly language 3. Higher.
Capturing Requirements. Questions to Ask about Requirements 1)Are the requirements correct? 2)Consistent? 3)Unambiguous? 4)Complete? 5)Feasible? 6)Relevant?
Dr.-Ing. Peter Zeiler Institute of Machine Components Department: Reliability Engineering Workshop: Machine Availability and Dependability.
A SUPPORT TOOL FOR THE REACHABILITY AND OTHER PETRI NETS- RELATED PROBLEMS AND FORMAL DESIGN AND ANALYSIS OF DISCRETE SYSTEMS Department of Computers and.
Modern Systems Analysis and Design Fourth Edition Chapter 8 Structuring System Logical Requirements (process description)
56 Resources u Icons represent resources u Dynamic resources must be assigned a path network u Resources position at nodes, not locations u “Specs” field.
Modeling of Service Oriented Architecture: From Business Process to Service Realization Petr Weiss and Marek Rychlý Brno University of Technology, Faculty.
Wolfgang Runte Slide University of Osnabrueck, Software Engineering Research Group Wolfgang Runte Software Engineering Research Group Institute.
Chapter 8 Structuring System Logical Requirements
Business System Development
Roberta Roth, Alan Dennis, and Barbara Haley Wixom
Chapter 3 Lexical Analysis.
Syntax Analysis Chapter 4.
Stochastic Activity Networks
Problem Solving Skill Area 305.1
Chapter 8 Structuring System Logical Requirements
COP 4620 / 5625 Programming Language Translation / Compiler Writing Fall 2003 Lecture 2, 09/04/2003 Prof. Roy Levow.
Presentation transcript:

Application of Coloured Petri Net for Agent Control and Communication in the ABAsim Architecture Antonín Kavička University of Pardubice, Czech Republic Michal Žarnay University of Žilina, Slovak Republic

CPN'08 Workshop2 Outline Background and motivation Definition of ABA-CPN (Agent-based architecture – Coloured Petri net) Application example Conventions in ABA-CPN Analysis of ABA-CPN Conclusion

CPN'08 Workshop3 Background Simulation of large and complex logistic nodes using ABAsim architecture (agent-based architecture of simulation models)

CPN'08 Workshop4 ABAsim – Agent’s Decomposition

CPN'08 Workshop5 ABAsim – Hierarchy of Agents

CPN'08 Workshop6 ABA-graph Definition of agent’s control and communication Subclass of Place/Transition Petri net

CPN'08 Workshop7 Motivation Upgrade to a subclass of coloured Petri nets in order to: –use a more flexible approach in describing the agent’s components –use existing tools for an analysis

CPN'08 Workshop8 Outline Background and motivation Definition of ABA-CPN Application example Conventions in ABA-CPN Analysis of ABA-CPN Conclusion

CPN'08 Workshop9 What is ABA-CPN Describes reactive logic of an agent component (edited within the CPN Tools environment) Token colours correspond to messages Denoted transitions correspond to agent’s instant assistants Management of token instances is based on prefix conventions of identifiers used in arc expressions Evolution is realized by means of a system interpreter within the ABAsim run-time kernel

CPN'08 Workshop10 Definition of ABA-CPN Based on definition of CPN Net structure: P = {p in }  {p out }  P S T = T D  T A  T S  T B Additional rules

Input place p in Output place p out Internal places P S

Decision transitions T D Assistant transitions T D representing actions in simulation Standard transitions T D Sending transitions T D

Decision arcs Elementary variable arcs (all the remaining) Constant arcs

CPN'08 Workshop14 Tokens Reflect message forms used for communication that may be filled differently throughout the net evolution

CPN'08 Workshop15 Initial Markings (|M 0 (p)| = 1, p = p in )  (|M 0 (p)| = 0, p ≠ p in ) M 0 = { j M 0 | j =1,2, …, |C(p in )|}, for i ≠ j, i M 0 (p) ≠ j M 0 (p) Admissible initial marking: input message before processing and no other messages being processed Set of admissible initial markings: all relevant input messages

Another option: 1`IM_B

CPN'08 Workshop17 Outline Background and motivation Definition of ABA-CPN Application example Conventions in ABA-CPN Analysis of ABA-CPN Conclusion

Example Introduction

Example of ABA-CPN

CPN'08 Workshop20 Outline Background and motivation Definition of ABA-CPN Application example Conventions in ABA-CPN Analysis of ABA-CPN Conclusion

CPN'08 Workshop21 Conventions in ABA-CPN Management of token instances –First character (prefix) –Second character for decision transitions Denoting of places Third character Constant identifiers

CPN'08 Workshop22 Prefix Convention

CPN'08 Workshop23 “Decision Transitions” Convention

CPN'08 Workshop24 Outline Background and motivation Definition of ABA-CPN Application example Conventions in ABA-CPN Analysis of ABA-CPN Conclusion

CPN'08 Workshop25 Analysis of ABA-CPN To check correctness of the ABA-CPN, the liveness properties are used: –Dead markings –Transitions liveness

CPN'08 Workshop26 Dead Markings – 2 Types (|M(p out )| ≥ 1)  (|M(p)| = 0, p ≠ p out ) |M(p)| = 0, p  P sending a message from the current agent to another agent consumption of the message form and no need for further communication

CPN'08 Workshop27 Conditions from Transitions Liveness The only transition occurring in all sequences: input transition t  T D No transition is dead in all occurrence sequences for all admissible initial markings

CPN'08 Workshop28 Conclusion Benefits of the ABA-CPN compared to the ABA-graph: –higher modelling capabilities of CPN: construction of conditional branching and differentiation of various instances of messages –existing tools for the CPN analysis

CPN'08 Workshop29 Use of the ABA-CPN Create an ABA-CPN model Analyze its liveness properties Import the model Check the model syntax Interpret the model during simulation runs CPN Tools ABA-CPN Interpreter

Thank you for your attention!

CPN'08 Workshop31 Examples of ABA-CPN Construction Errors Net has >1 input or >1 output place Decision or assistant transition has >1 input place An assistant transition has >1 output place A sending transition has >1 input place Tokens left after an evolution in the net No expression on outgoing arcs from a decision transition is used.

CPN'08 Workshop32 Input place p in Output place p out Internal places P S