Object Petri Nets: Definitions, Properties, and Related Models
Michael Köhler · 2003
In this presentation the decidability issues of formalisms that allow Petri nets as tokens are studied. Especially for object-net systems 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.