The Multi-agent Prey/Predator problem: A Petri net solution

1997

In this paper we present the modeling by a class of object based Petri net, named G-CPN, of a cooperative editing environment for hierarchical diagrams. First, we define the specification of this editor, and introduce an agent based architecture to support its realization. Also, we introduce the G-CPN model as a formal approach to the modeling of object based systems.

Journal of Software Engineering and Applications, 2010

In this paper, we present a new formalism for Modeling Multi Agent Systems (MAS). Our model based a PN is able to describe not only not the internal state of each agent modeled but also its behavior. Owing to these features, one can model naturally the dynamic behavior of complex systems and the communication between these entities. For this, we propose mathematical definitions attached to firing transitions. To validate our contribution, we will deal with real examples.

Fourth Canadian Conference on Computer and Robot Vision (CRV '07), 2007

We present a formal framework for robotic cooperation in which we use an extension to Petri nets, known as workflow nets, to establish a protocol among mobile agents based on the task coverage they maintain. Our choice is motivated by the fact that Petri nets handle concurrency and that goal reachability can be theoretically established. We describe the means by which cooperation is performed with Petri nets and analyze their structural and behavioral characteristics in order to show the correctness of our framework.

2012

A multi-agent system can be studied as a concurrent, asynchronous, stochastic and distributed computer system. These characteristics of multi-agent systems make them also a discrete-event dynamic system; it is, therefore, important to analyze the behavior of such system to ensure that it terminates correctly and satisfies other important properties. Several analytical methodologies have been used to study multi-agent system, particularly Petri nets. Petri nets have a well-defined mathematical structure that can be leveraged to provide formal analysis on discrete-event systems. In this work, we propose an automatic transformation to model multi-agent systems using Colored Petri nets.

Lecture Notes in Computer Science, 2009

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013

These are the proceedings of the International Workshop on Petri Nets and Software Engineering (PNSE'13) in Milano, Italy, June 24-25, 2013. It is a co-located event of Petri Nets 2013, the 34th international conference on Applications and Theory of Petri Nets and Concurrency. More information about the workshop can be found at http://www.informatik.uni-hamburg.de/TGI/events/pnse13/ For the successful realisation of complex systems of interacting and reactive software and hardware components the use of a precise language at different stages of the development process is of crucial importance. Petri nets are becoming increasingly popular in this area, as they provide a uniform language supporting the tasks of modelling, validation, and verification. Their popularity is due to the fact that Petri nets capture fundamental aspects of causality, concurrency and choice in a natural and mathematically precise way without compromising readability. The use of Petri Nets (P/T-Nets, Coloured Petri Nets and extensions) in the formal process of software engineering, covering modelling, validation, and verification, will be presented as well as their application and tools supporting the disciplines mentioned above.

The domain of Petri Nets (PN) engineering has been the concern of many researchers. The present paper lies within this context aiming at the definition of a new formalism for the modelling at the multi agents systems (MAS), which is based on agents called Agents Petri Net (APN). That is why, the definitions that treat the internal state of the agent and its behavior are proposed. The suggested mathematical definitions help us to model the interactive systems in a rigorous manner and without any ambiguity. It is through simple examples that our approach is proven to be valid.

2019

The assurance of required quality properties is one of the major challenge in SelfAdaptive Systems (SAS). Self-adaptive systems have the capability to adapt their dynamic behavior autonomously at runtime due to uncertain changes in the environment. Research in this field is being held since mid-sixties, and over the last decade the importance of self-adaptivity is being increased. In general a self-adaptive system is much difficult to specify and verify, because of its highly complex internal behavior and especially when time constraints are involved. In the proposed research, Colored Petri Net (CPN) formal language will be used to model self-adaptive multi-agent system. CPN is increasingly used to model self-adaptive complex concurrent systems due to its flexible formal specification and formal verification behavior. CPN is visually more expressive than simple Petri Nets enables diverse modeling approaches and provides a richer framework for such a complex formalism. The specificat...

Programming and Computer …, 2001

In the paper, a formal model based on Petri nets is proposed in the context of a compositional approach to the development and analysis of complex concurrent and distributed systems. Mutlilabels of Petri nets are introduced allowing labeling a transition not only with a single symbol, but also with a multiset of symbols. Operations on multilabeled Petri nets-parallel composition and restriction-are defined. A definition of a Petri net entity is given based on the notion of multilabels. A Petri net entity is a Petri net with a set of multilabels, where each multilabel is regarded as an access point of the entity. The operation of entity composition is introduced. Equivalence of entities is defined based on bisimulation equivalence of Petri nets. It is shown that the equivalence relation is congruent with respect to entity composition. It is also demonstrated that the composition operation is commutative and associative.

1996 IEEE International Conference on Systems, Man and Cybernetics. Information Intelligence and Systems (Cat. No.96CH35929)