Skip to main content
SpringerLink
Log in

Decidability questions for fairness in Petri nets

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 87 (STACS 1987)

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

Included in the following conference series:

Abstract

For a Petri net and a group of transitions E a procedure is given to decide if there is an infinite firing sequence which is fdp w. r. t. E. An analysis of the complexity shows that even the problem if there is an arbitrary infinite firing sequence in a bounded net is hard for DSPACE(exp). If (strong) fairness is required the problem becomes undecidable, this is even shown for the question if there is an infinite firing sequence which is fair w. r. t. one transition t.

An open problem remains the question if there is an infinite firing sequence which is fdp w. r. t. more than one group of transitions.

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. G. W. Brams: Réseaux de Petri: Théorie et Pratique — Tome 1: théorie et analyse; Masson, Paris 1983.

    Google Scholar 

  2. H. Carstensen, R. Valk: Infinite Behaviour and Fairness in Petri Nets; In G. Rozenberg (ed.): Advances in Petri Nets 1984; Lecture Notes in Computer Science 188, (S. 83–100), Springer, Berlin 1985.

    Google Scholar 

  3. L. E. Dickson: Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors; American Journal of Mathematics 35, (S. 413–422), 1913.

    Google Scholar 

  4. S. R. Kosaraju: Decidability of Reachability in Vector Addition Systems; Proc. 14th Ann. Symp. on Theory of Computing, (S. 267–281), 1982.

    Google Scholar 

  5. R. J. Lipton: The Reachability Problem Requires Exponential Space; Yale University, Department of Computer Science, Research Report 62, 1976.

    Google Scholar 

  6. E. W. Mayr: An Algorithm for the General Petri Net Reachability Problem; SIAM J. Comput. Vol. 13, (S. 441–460), 1984.

    Google Scholar 

  7. M. L. Minsky: Computation: Finite and Infinite Machines; Prentence Hall, New Jersey 1967.

    Google Scholar 

  8. R. Valk, M. Jantzen: The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets; Acta Informatica 21, (S. 643–674), 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Hamburg, Rothenbaumchaussee 67/69, D-2000, Hamburg 13

    Heino Carstensen

Authors
  1. Heino Carstensen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Franz J. Brandenburg Guy Vidal-Naquet Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carstensen, H. (1987). Decidability questions for fairness in Petri nets. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds) STACS 87. STACS 1987. Lecture Notes in Computer Science, vol 247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039622

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17219-2

  • Online ISBN: 978-3-540-47419-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation