Some Decidability Results for Nested Petri Nets

Nested Petri nets are Petri nets using other Petri nets as tokens, thereby allowing easy description of hierarchical systems. Their nested structure makes some important verification problems undecidable (reachability, boundedness, . . . ) while some other problems remain decidable (termination, inevitability, . . . ).

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

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

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

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

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

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

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

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

[9]  Kurt Jensen,et al.  Coloured Petri Nets , 1997, Monographs in Theoretical Computer Science An EATCS Series.

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

[11]  Kurt Jensen,et al.  Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Vol. 2, Analysis Methods , 1992 .

[12]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[13]  Philippe Schnoebelen,et al.  Boundedness of Reset P/T Nets , 1999, ICALP.

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

[15]  Philippe Schnoebelen,et al.  Fundamental Structures in Well-Structured Infinite Transition Systems , 1998, LATIN.

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