Skip to main content
Springer Nature Link
Log in

Reachability in reversible Free Choice systems

  • Concurrency II
  • Conference paper
  • First Online:
STACS 91 (STACS 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 480))

Included in the following conference series:

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.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. E. Best and J. Desel: Partial Order Behaviour and Structure of Petri Nets. Formal Aspects of Computing Vol. 2 No. 2, 123–138 (1990).

    Article  Google Scholar 

  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. 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. 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. H.J. Genrich and K. Lautenbach: Synchronisationsgraphen. Acta Informatica Vol. 2, 143–161 (1973).

    Article  Google Scholar 

  7. M. Hack: Analysis of Production Schemata by Petri Nets. TR-94, MIT-MAC (1972).

    Google Scholar 

  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. 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. E.W. Mayr: An algorithm for the general Petri net reachability problem. SIAM Journal of Computing, Vol. 13, 441–460 (1984).

    Article  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, Arcisstr.21, D-8000, München 2

    Jörg Desel

  2. Institut für Informatik, Universität Hildesheim, Samelsonplatz 1, D-3200, Hildesheim

    Javier Esparza

Authors
  1. Jörg Desel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Javier Esparza
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Christian Choffrut Matthias Jantzen

Rights and permissions

Reprints 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

Publish with us

Policies and ethics