For the most recent entries see the Petri Nets Newsletter.

Reachability in Reversible Free Choice Systems.

Desel, Jörg; Esparza, Javier

In: Choffrut, C.; et al.: Lecture Notes in Computer Science, Vol. 480; STACS 91. Proceedings of the 8th Annual Symposium on Theoretical Aspects of Computer Science, 1991, Hamburg, Germany, pages 384-397. Berlin, Germany: Springer-Verlag, 1991.

Also in: 91; 3rd Workshop on Concurrency and Compositionality, 1991, Goslar, Germany / Best, E.; et al.: GMD-Studien Nr. 191; Hildesheimer Informatik-Berichte 6, pages 73-79. St. Augustin, Germany: Gesellschaft für Mathematik und Datenverarbeitung mbH --- Universität Hildesheim (Germany), Institut für Informatik, May 1991. Extended abstract.

Abstract: The authors give a structural characterisation of reachable states for a subclass of marked free choice Petri nets. The nets of this subclass are those enjoying three properties (liveness, boundedness, reversibility) which are frequently part of the specification of reactive systems. The authors show that the reachability problem for this subclass can be solved in polynomial time in the size of the net.

Keywords: reachability (in) reversible free choice system(s); liveness; boundedness; reactive system.

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

Back to the Petri Nets Bibliography