A Colored Petri Net for a Multi-Agent Application Aarhus, Denmark - August 27, 2002 MOCA ‘02 Danny Weyns & Tom Holvoet K.U.Leuven - Belgium.

Slides:



Advertisements
Similar presentations
Synthesis of Protocol Converter Using Timed Petri-Nets Anh Dang Balaji Krishnamoorthy Manoj Iyer Presented by:
Advertisements

Pat Langley School of Computing and Informatics Arizona State University Tempe, Arizona USA Modeling Social Cognition in a Unified Cognitive Architecture.
On 1-soundness and Soundness of Workflow Nets Lu Ping, Hu Hao and Lü Jian Department of Computer Science Nanjing University
Techniques to analyze workflows (design-time)
Principles of Engineering System Design Dr T Asokan
1 Analysis of workflows : Verification, validation, and performance analysis. Wil van der Aalst Eindhoven University of Technology Faculty of Technology.
Applying Petri Net Unfoldings for Verification of Mobile Systems Apostolos Niaouris Joint work with V. Khomenko, M. Koutny MOCA ‘06.
Some questions o What are the appropriate control philosophies for Complex Manufacturing systems? Why????Holonic Manufacturing system o Is Object -Oriented.
Introduction to Data Flow Graphs and their Scheduling Sources: Gang Quan.
Distributed Process Management
ParCeL-5/ParSSAP: A Parallel Programming Model and Library for Easy Development and Fast Execution of Simulations of Situated Multi-Agent Systems Stéphane.
Requirements on the Execution of Kahn Process Networks Marc Geilen and Twan Basten 11 April 2003 /e.
Software Requirements Engineering
Anna Philippou Department of Computer Science University of Cyprus Joint work with Mauricio Toro Department of Comp. Sc. EAFIT University Christina Kassara.
Ensuring Patient Safety in Wireless Medical Device Networks Presented by: Eric Flickner Chris Hoffman.
Petri net modeling of biological networks Claudine Chaouiya.
Banker’s Algorithm Implementation in CPN Tools Michal Žarnay Department of Transportation Networks University of Žilina, Slovakia.
Application of Coloured Petri Net for Agent Control and Communication in the ABAsim Architecture Antonín Kavička University of Pardubice, Czech Republic.
Computational Modeling for the Activation Cycle of G-proteins by G-protein-coupled Receptors Student: Yifei Bao 1, Tommy E. White 2, Advisor: Adriana B.
1 Petri Nets H Plan: –Introduce basics of Petri Net models –Define notation and terminology used –Show examples of Petri Net models u Calaway Park model.
FunState – An Internal Design Representation for Codesign A model that enables representations of different types of system components. Mixture of functional.
A 14← department of mathematics and computer science PROSE Checking Properties of Adaptive Workflow Nets K. van Hee, I. Lomazova, O. Oanea,
20101 Synchronization in distributed systems A collection of independent computers that appears to its users as a single coherent system.
Software Engineering, COMP201 Slide 1 Protocol Engineering Protocol Specification using CFSM model Lecture 30.
Modelling with Coloured Petri Nets Søren Christensen Department of Computer Science University of Aarhus.
Modeling State-Dependent Objects Using Colored Petri Nets
1 Formal Models for Transactions: Zero Safe Nets Roberto Bruni Dipartimento di Informatica Università di Pisa Models and Languages for Coordination and.
/faculteit technologie management DEMO CPN-tools Ronny Mans Eindhoven University of Technology, Faculty of Technology Management, Department of Information.
Introduction to Data Flow Graphs and their Scheduling Sources: Gang Quan.
Fundamentals of Python: From First Programs Through Data Structures
Karolina Muszyńska Based on: S. Wrycza, B. Marcinkowski, K. Wyrzykowski „Język UML 2.0 w modelowaniu SI”
Do we need theoretical computer science in software engineering curriculum: an experience from Uni Novi Sad Bansko, August 28, 2013.
Multi-Agent Model to Multi-Process Transformation A Housing Market Case Study Gerhard Zimmermann Informatik University of Kaiserslautern.
TC Methodology Massimo Cossentino (Italian National Research Council) Radovan Cervenka (Whitestein Technologies)
/ Copyright © Siemens AG All rights reserved. Corporate Technology Performance Prediction of Client-Server Systems by High-Level Abstraction Models.
Workflow Treatment with Coloured Petri Nets Alexandru Cicortaş Diana
CY2003 Computer Systems Lecture 7 Petri net. © LJMU, 2004CY2003- Week 72 Overview Petri net –concepts –Petri net representation –Firing a transition –Marks.
FRE 2672 TFG Self-Organization - 01/07/2004 Engineering Self-Organization in MAS Complex adaptive systems using situated MAS Salima Hassas LIRIS-CNRS Lyon.
Kurt Jensen Lars M. Kristensen 1 Coloured Petri Nets Department of Computer Science Coloured Petri Nets Modelling and Validation of Concurrent Systems.
Business Informatics Group Institute of Software Technology and Interactive Systems Vienna University of Technology Favoritenstraße 9-11/188-3, 1040 Vienna,
An Ontological Framework for Web Service Processes By Claus Pahl and Ronan Barrett.
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.
1 Distributed Process Management Chapter Distributed Global States Operating system cannot know the current state of all process in the distributed.
Modeling and Simulation Discrete-Event Simulation
3 June Paris Seminar Modelling and Analysis of TCP’s Connection Management Procedures Jonathan Billington and Bing Han Computer Systems Engineering.
Hardware Design and The Petri Net Abhijit K. Deb SAM, LECS, IMIT, KTH Kista, Stockholm.
Petri Nets Lecturer: Roohollah Abdipour. Agenda Introduction Petri Net Modelling with Petri Net Analysis of Petri net 2.
Modelling by Petri nets
Ch8. Analysis Joosung, Ko.
Testing OO software. State Based Testing State machine: implementation-independent specification (model) of the dynamic behaviour of the system State:
CSCI1600: Embedded and Real Time Software Lecture 11: Modeling IV: Concurrency Steven Reiss, Fall 2015.
Course: COMS-E6125 Professor: Gail E. Kaiser Student: Shanghao Li (sl2967)
1 4 January 2016 Architectural Design of a Distributed Application with Autonomic Quality Requirements DEAS St. Louis, USA, May 21 th, 2005 Danny Weyns,
UML for Behavior-Oriented Multi-Agent Simulations Christoph Oechslein, Franziska Klügl, Rainer Herrler, and Frank Puppe University Würzburg, Germany.
Global Clock Synchronization in Sensor Networks Qun Li, Member, IEEE, and Daniela Rus, Member, IEEE IEEE Transactions on Computers 2006 Chien-Ku Lai.
Fusion Design Overview Object Interaction Graph Visibility Graph Class Descriptions Inheritance Graphs Fusion: Design The overall goal of Design is to.
From Use Cases to Implementation 1. Structural and Behavioral Aspects of Collaborations  Two aspects of Collaborations Structural – specifies the static.
An Architecture-Centric Approach for Software Engineering with Situated Multiagent Systems PhD Defense Danny Weyns Katholieke Universiteit Leuven October.
Distributed cooperation and coordination using the Max-Sum algorithm
Academic Year 2014 Spring Academic Year 2014 Spring.
IHP Im Technologiepark Frankfurt (Oder) Germany IHP Im Technologiepark Frankfurt (Oder) Germany ©
Diagnostic Information for Control-Flow Analysis of Workflow Graphs (aka Free-Choice Workflow Nets) Cédric Favre(1,2), Hagen Völzer(1), Peter Müller(2)
From Use Cases to Implementation 1. Mapping Requirements Directly to Design and Code  For many, if not most, of our requirements it is relatively easy.
Garbage Collecting the World Presentation: Mark Mastroieni Authors: Bernard Lang, Christian Queinne, Jose Piquer.
CPE555A: Real-Time Embedded Systems
Dr. Eng Amr T. Abdel-Hamid
Event Relation Graphs and Extensions in Ptolemy II
بسمه‌تعالي فصل چهاردهم شبکه‌هاي پتري.
CIS 488/588 Bruce R. Maxim UM-Dearborn
From Use Cases to Implementation
Presentation transcript:

A Colored Petri Net for a Multi-Agent Application Aarhus, Denmark - August 27, 2002 MOCA ‘02 Danny Weyns & Tom Holvoet K.U.Leuven - Belgium

Outline Situating the paper in our research The Packet-World Basic model for the Packet-World Extended model Experiments and verifications Conclusions & future work

Situation of the paper General goal of our research: better understanding of sociality in multi-agent systems generic conceptual model of social agents situated in a multi-agent system which concepts does an agent need in order to acquire social abilities ? which infrastructure is necessary in the environment to support these abilities ?

Situation of the paper This paper: –realization of 2 basic models for Packet-World –first experiments Case application = Packet-World Our approach: combine experiments with conceptual modeling Conceptual Modeling: Colored Petri-Nets

Outline Situating the paper in our research The Packet-World Basic model for the Packet-World Extended model Experiments and verification Conclusions & future work

The Packet-World Discrete world, agents act autonomously (parallel) Problem for the agents: clean up the world as efficiently as possible Agents have only limited view Interaction primitives –step, skip, pick up / put down packet –communication with other agents packet destination view of agent 2

Outline Situating the paper in our research The Packet-World Basic model for the Packet-World Extended model Experiments and verification Conclusions & future work

Basic model for the Packet-World Agent with goals: - pick up packet - deliver packet Environment with: - agents - packets - destinations Synchronization Module: - synchronizes percepts and actions Approach: building up the multi-agent system by means of compositional modules

Basic model: Action cycle

Basic model: CPN for the Environment Place ENVIRONMENT –contains the objects in the world color Item = record name:Name * coord:Coordinate; color World = list Item with 1..(worldsize*worldsize); COUNT registers the invested energy so far SYNC transports synch tokens to synch module PRODUCE_PERCEPT updates percepts –when syncout contains a token –as long as PACKET_COUNT contains a token

Basic model: CPN for the Environment Reactions are modeled as transitions reaction Move token World token [ guard ] World token Agent token Perform place Consume place ENVIRONMENT SYNC T token Count T token

Basic model: CPN for an Agent Place ready contains initial Agent token –color Agent = record name:Name * coord:Coordinate * carry:Name; Agent gets view on the world from percept place –color View = list of Item with 1..viewsize * viewsize; Tokens enter the agent-net only after identification = compare Name token in identity place beliefbase contains Belief records –color Belief = record subj:BeliefSubj * item:Item; –color BeliefSubj = with pRec | dRec;

Basic model: CPN for an Agent Actions are modeled as transitions action Move token [ guard ] Agent token Belief token Perform place beliefbase view View token lookfor place

Basic model: CPN for the Sync module Goal = synchronization of perceptions and actions in a loop so that: –ensures that agents are treaded as acting simultaneously –the environment reacts only subsequently How: –collect synchronization tokens from environment –trigger environment as soon as the reactions for all agents are handled to produce new percepts

Outline Situating the paper in our research The Packet-World Basic model for the Packet-World Extended model Experiments and verification Conclusions & future work

Extended model for the Packet-World Agents - communicate information - extended with communication module Environment: - extended with Postal Service Synchronization Module: - sending a message = first class action

Extended model: C ommunication module Messages –color Message = record from:Name * to:Name * perform:Performative * content:Item; –color Performative = with questP | answP | noanswP | questD …; Questions: –askfor when agent lacks information to handle –queue regulation limits number of messages Answers: –responce produces an answer –processanswer accepts an answer = updates belief base

Extended model: Postal Service 1 global inbox - 1 mailbox / agent addresses contains Mailbox address of each agent delivering a message produces a sync token msgcount and msglog for statistic information

Outline Situating the paper in our research The Packet-World Basic model for the Packet-World Extended model Experiments and verification Conclusions & future work

Experiments Rounded averages for 5 jobs view-size increases = COUNT decreases Effect communication greatest for limited view-sizes Better founded conclusions = more tests (world- & view-size / nbAgents)

Verifications Standard report of Design/CPN tool –e.g, “Dead Transition Instances” indicates possible conflicts By means of Occurrence Graph tool –node for each reachable marking –arc for each occurring binding –2 verifications: deadlock free & correctly solved worlds

Verifications –Packet-World = free of deadlocks “there exists a path from each node in the graph to the node node that represents the final marking” (*proof 1*) –Job is correctly solved in a limited number of steps (1) “in each node except the leaf node, the sum of tokens for PACKETS_ON_GRID, CARRIED_PACKERTS and DELIVERED_PACKETS = nbPackets” (*proof 2*) (2) (*proof 1*)

Outline Situating the paper in our research The Packet-World Basic model for the Packet-World Extended model Experiments and verification Conclusions & future work

Conclusions –Contribution of this paper: practical realization of CPN for a multi-agent application solid basis for future research of agents’ social behavior –Remarks with regard to CPNs for modeling MASs CPNs have a strong graphical expressiveness –compositional modules –every aspect must unambiguously be modeled simulation of the model itself supports formal verification

Future work –Building modules for other kind of social skills e.g., cooperative agents that form a chain and passing packets; coordination to avoid future conflicts –tackle complexity by means of hierarchical CPNs –generalize insights deduced from Packet-World build abstract models for different levels of social skills aggregate of these models = well defined / easy to communicate formal model of social agents of a MAS

Thanks for your attention !