Nested Petri Nets - a Formalism for Specification and Verification of Multi-Agent Distributed Systems

Nested Petri nets is a formalism for modeling hierarchical multi-agent systems. Tokens in nested Petri nets are elements represented by nets themselves. Decidability of some crucial for verification problems shows that, in spite of their ”unflat” structure, nested Petri nets maintain significant properties of ordinary Petri nets. A comparison with some other Petri net models is given. The formalism allows generalization to a recursive case, when a nested Petri net may generate its own copy as its element. Two simple examples illustrate the approach.

[1]  Philippe Schnoebelen,et al.  Some Decidability Results for Nested Petri Nets , 1999, Ershov Memorial Conference.

[2]  Christophe Sibertin-Blanc,et al.  Cooperative Nets , 1994, Application and Theory of Petri Nets.

[3]  Irina A. Lomazova.  On Proving Large Distributed Systems: Petri Net Modules Verification , 1997, PaCT.

[4]  Philippe Schnoebelen,et al.  Reset Nets Between Decidability and Undecidability , 1998, ICALP.

[5]  Rüdiger Valk,et al.  Petri Nets as Token Objects: An Introduction to Elementary Object Nets , 1998, ICATPN.

[6]  Charles Lakos,et al.  On the Abstraction of Coloured Petri Nets , 1997, ICATPN.

[7]  Tadao Kasami,et al.  Some Decision Problems Related to the Reachability Problem for Petri Nets , 1976, Theor. Comput. Sci..

[8]  Charles Lakos,et al.  From Coloured Petri Nets to Object Petri Nets , 1995, Application and Theory of Petri Nets.

[9]  Gianfranco Ciardo,et al.  Petri Nets with Marking-Dependent Ar Cardinality: Properties and Analysis , 1994, Application and Theory of Petri Nets.

[10]  Wolfgang Reisig,et al.  Petri Nets in Software Engineering , 1986, Advances in Petri Nets.

[11]  Philippe Schnoebelen,et al.  Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..

[12]  Graham Higman,et al.  Ordering by Divisibility in Abstract Algebras , 1952 .

[13]  Laure Petrucci,et al.  Towards a Modular Analysis of Coloured Petri Nets , 1992, Application and Theory of Petri Nets.

[14]  Alain Finkel,et al.  Reduction and covering of infinite reachability trees , 1990, Inf. Comput..

[15]  Wolfgang Reisig,et al.  Petri Nets: Applications and Relationships to Other Models of Concurrency , 1986, Lecture Notes in Computer Science.

[16]  Daniel Moldt,et al.  Multi-Agent-Systems Based on Coloured Petri Nets , 1997, ICATPN.

[17]  Zohar Manna,et al.  Proving termination with multiset orderings , 1979, CACM.

[18]  Parosh Aziz Abdulla,et al.  General decidability theorems for infinite-state systems , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[19]  Einar Smith.  Principles of High-Level Net Theory , 1996, Petri Nets.