Reachability in reversible Free Choice systems

  • Jörg Desel
  • Javier Esparza
Concurrency II
Part of the Lecture Notes in Computer Science book series (LNCS, volume 480)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    E. Best, L. Cherkasova, J. Desel and J. Esparza: Characterisation of Home States in Free Choice Systems. Hildesheimer Informatikberichte Nr. 9/90 (1990).Google Scholar
  2. [2]
    E. Best and J. Desel: Partial Order Behaviour and Structure of Petri Nets. Formal Aspects of Computing Vol. 2 No. 2, 123–138 (1990).CrossRefGoogle Scholar
  3. [3]
    F. Commoner, A.W. Holt, S. Even and A. Pnueli: Marked Directed Graphs. Journal of Computer and System Science Vol. 5, 511–523 (1971).Google Scholar
  4. [4]
    J. Desel and J. Esparza: Reachability in Reversible Free Choice Systems. SFB-Bericht Nr. 342/11/90 A, Technische Universität München (1990).Google Scholar
  5. [5]
    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).Google Scholar
  6. [6]
    H.J. Genrich and K. Lautenbach: Synchronisationsgraphen. Acta Informatica Vol. 2, 143–161 (1973).CrossRefGoogle Scholar
  7. [7]
    M. Hack: Analysis of Production Schemata by Petri Nets. TR-94, MIT-MAC (1972).Google Scholar
  8. [8]
    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).Google Scholar
  9. [9]
    S.R. Kosaraju: Decidability of reachability in vector addition systems. Proceedings of the 14th Annual Symposium of the Theory of Computing, 267–281 (1982).Google Scholar
  10. [10]
    E.W. Mayr: An algorithm for the general Petri net reachability problem. SIAM Journal of Computing, Vol. 13, 441–460 (1984).CrossRefGoogle Scholar
  11. [11]
    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).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Jörg Desel
    • 1
  • Javier Esparza
    • 2
  1. 1.Institut für InformatikTechnische Universität MünchenMünchen 2
  2. 2.Institut für InformatikUniversität HildesheimHildesheim

Personalised recommendations