Abstract
We 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. We show that the reachability problem for this subclass can be solved in polynomial time in the size of the net.
Work supported by EBRA 3148: DEMON and by SFB 342 WG A3: SEMAFOR.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E. Best, L. Cherkasova, J. Desel and J. Esparza: Characterisation of Home States in Free Choice Systems. Hildesheimer Informatikberichte Nr. 9/90 (1990).
E. Best and J. Desel: Partial Order Behaviour and Structure of Petri Nets. Formal Aspects of Computing Vol. 2 No. 2, 123–138 (1990).
F. Commoner, A.W. Holt, S. Even and A. Pnueli: Marked Directed Graphs. Journal of Computer and System Science Vol. 5, 511–523 (1971).
J. Desel and J. Esparza: Reachability in Reversible Free Choice Systems. SFB-Bericht Nr. 342/11/90 A, Technische Universität München (1990).
J. Esparza and M. Silva: Top-down synthesis of live and bounded Free Choice nets. Proceedings of the 11th International Conference on Applications and Theory of Petri nets 63–83 (1990).
H.J. Genrich and K. Lautenbach: Synchronisationsgraphen. Acta Informatica Vol. 2, 143–161 (1973).
M. Hack: Analysis of Production Schemata by Petri Nets. TR-94, MIT-MAC (1972).
D. Hillen: Relationship between Deadlock-freeness and Liveness in Free Choice Nets. Newsletter of the GI Special Interest Group in Petri Nets and Related System Models, No. 19, 28–32 (1985).
S.R. Kosaraju: Decidability of reachability in vector addition systems. Proceedings of the 14th Annual Symposium of the Theory of Computing, 267–281 (1982).
E.W. Mayr: An algorithm for the general Petri net reachability problem. SIAM Journal of Computing, Vol. 13, 441–460 (1984).
M. Minoux and K. Barkaoui: Polynomial Time Proof or Disproof of Commoner's Structural Property in Petri Nets. Proceedings of the 9th European Workshop on Applications and Theory of Petri Nets, Venice, 113–125 (1989).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Desel, J., Esparza, J. (1991). Reachability in reversible Free Choice systems. In: Choffrut, C., Jantzen, M. (eds) STACS 91. STACS 1991. Lecture Notes in Computer Science, vol 480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020814
Download citation
DOI: https://doi.org/10.1007/BFb0020814
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53709-0
Online ISBN: 978-3-540-47002-1
eBook Packages: Springer Book Archive