In: Proceedings of Applications and Theory of Petri Nets 2004: 25th International Conference, ICATPN 2004, Bologna, Italy, June 21-25, 2004, pages 278-297. Volume 3099 of Lecture Notes in Computer Science / Cortadella, Reisig (Eds.) --- Springer-Verlag, September 2004.
Abstract: In this presentation the structure of formalisms are studied that allow Petri nets as tokens. The relationship towards common Petri net models and decidability issues are studied. Especially for rdquoelementary object-net systemsrdquo defined by Valk the decidability of the reachability and the boundedness problem is considered. It is shown that reachability becomes undecidable while boundedness remains decidable for elementary object-net systems. Furthermore it is shown that even for minimal extensions the formalism obtains the power of Turing machines.