论文信息 - Reachable Markings of Object Petri Nets

Reachable Markings of Object Petri Nets

In this article I will prove undecidability results for elementary object net systems (Eos). Object nets are Petri nets which have Petri nets as tokens – an approach which is called the “nets-within-nets” paradigm. Eos are special object net system which have a two leveled structure.

Michael Köhler

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

[2] Rüdiger Valk,et al. Object Petri Nets: Using the Nets-within-Nets Paradigm , 2003, Lectures on Concurrency and Petri Nets.

[3] Daniel Moldt,et al. Analysis of Mobile Agents using Invariants of Object Nets , 2008, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

[4] Daniel Moldt,et al. Modelling Mobility and Mobile Agents Using Nets within Nets , 2003, ICATPN.

[5] Jean-Luc Lambert,et al. A Structure to Decide Reachability in Petri Nets , 1992, Theor. Comput. Sci..

[6] Heiko Rölke,et al. Reference and Value Semantics Are Equivalent for Ordinary Object Petri Nets , 2005, ICATPN.

[7] Heiko Rölke,et al. Properties of Object Petri Nets , 2004, ICATPN.

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

[9] Ernst W. Mayr. An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[10] Heiko Rölke,et al. Concurrency in Mobile Object Net Systems , 2003, Fundam. Informaticae.

[11] Berndt Farwer. A Linear Logic View of Object Petri Nets , 1999, Fundam. Informaticae.

[12] Undecidability in Object-Oriented Petri Nets , 2000 .