Properties of Object Petri Nets

摘要

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 "elementary object-net systems" denned by Valk [20] 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.