Skip to main content
Springer Nature Link
Log in

Decidability of weak fairness in petri nets

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 89 (STACS 1989)

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

Included in the following conference series:

  • 153 Accesses

Abstract

The paper proves the decidability of the problem if there is an infinite weakly fair occurrence sequence for a given Petri net. Thereby an open problem from [2] and [4] is solved.

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. Best E., Fernandez C.: Notations and Terminology on Petri Net Theory; Petri Nets Newsletter 20 (1985)

    Google Scholar 

  2. Carstensen H.: Decidability Questions for Fairness in Petri Nets; Proc. STACS 87, LNCS 247, Springer 1987, pp. 396–407

    Google Scholar 

  3. Higman G.: Ordering by Divisibility in Abstract Algebras; Proc. London Math. Soc. (3) 2, 1952, pp. 326–336

    Google Scholar 

  4. Howell R., Rosier L., Yen H.: A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets; Proc. MFCS 88, LNCS 324, Springer 1988, pp. 351–359

    Google Scholar 

  5. Jančar P.: Decidability Questions for some Petri Nets Dynamic Properties /in Czech/; a thesis, Charles Univ. Prague, 1987

    Google Scholar 

  6. Kosaraju S.R.: Decidability of Reachability in Vector Addition Systems; Proc. 14th Ann. ACM STOC, 1982, pp. 267–281

    Google Scholar 

  7. Lipton R.: The Reachability Problem is Exponential-Space-Hard; Dept. Comput. Sci., Rep. 62, Yale Univ., New Haven, CT, 1976

    Google Scholar 

  8. Mayr E.: An Algorithm for the General Petri Net Reachability Problem; SIAM J. Comput. 13/3, 1984, pp. 441–460

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mining Institute of the Czechoslovak Academy of Sciences, Studentská 1768, 708 00, Ostrava 4, Czechoslovakia

    Petr Jančar

Authors
  1. Petr Jančar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Monien R. Cori

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jančar, P. (1989). Decidability of weak fairness in petri nets. In: Monien, B., Cori, R. (eds) STACS 89. STACS 1989. Lecture Notes in Computer Science, vol 349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029006

Download citation

  • DOI: https://doi.org/10.1007/BFb0029006

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50840-3

  • Online ISBN: 978-3-540-46098-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics