For the most recent entries see the Petri Nets Newsletter.

The Reachability Problem for Object Nets.

Köhler, Michael

In: 06, 2006: Proceedings of the Fourth International Workshop on Modelling of Objects, Components and Agents, MOCA'06, Bericht 272, FBI-HH-B-272, pages 179-199. June 06.

Abstract: Object nets are Petri nets which have Petri nets as tokens - an approach known as the net-within-nets paradigm. Object nets are called elementary if the net system has a two levelled structure. In this article I will prove that reachability is undecidable for elementary object net systems. In addition, I define sub classes of elementary object net systems that have a decidable reachability problem.

Keywords: nets-within-nets; object nets; reachability problem.


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography