Skip to main content
SpringerLink
Log in

On the decidability of model checking for several μ-calculi and Petri nets

  • Contributed Papers
  • Conference paper
  • First Online:
Trees in Algebra and Programming — CAAP'94 (CAAP 1994)

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

Included in the following conference series:

Abstract

The decidability of the model checking problem for several μ-calculi and Petri nets is analysed. The linear time μ-calculus without atomic sentences is decidable; if simple atomic sentences are added, it becomes undecidable. A very simple subset of the modal μ-calculus is undecidable.

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. J. C. Bradfield: Verifying Temporal Properties of Systems. Birkhäuser, Boston, Massachussets ISBN 0-8176-3625-0 (1991).

    Google Scholar 

  2. S. Christensen, Y. Hirshfeld and F. Moller: Bisimulation Equivalence is Decidable for Basic Parallel Processes. Proceedings of CONCUR'93, LNCS 715, 143–157 (1993).

    Google Scholar 

  3. M. Dam: Fixpoints of Büchi automata. LFCS Report ECS-LFCS-92-224, University of Edinburgh (1992).

    Google Scholar 

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

    Article  Google Scholar 

  5. M.H.T. Hack: Decidability questions for Petri nets. Ph. D. Thesis, MIT (1976).

    Google Scholar 

  6. R.R. Howell and L.E. Rosier: Problems concerning fairness and temporal logic for conflict-free Petri nets. Theoretical Computer Science 64, 305–329 (1989).

    Article  Google Scholar 

  7. R.R. Howell, L.E. Rosier and H. Yen: A taxonomy of fairness and temporal logic problems for Petri nets. Theoretical Computer Science 82, 341–372 (1991).

    Article  Google Scholar 

  8. P. Jančar: Decidability of a temporal logic problem for Petri nets. Theoretical Computer Science 74, 71–93 (1990).

    Article  Google Scholar 

  9. R.M. Karp and R.E. Miller: Parallel Program Schemata. Journal of Computer and System Sciences 3, 147–195 (1969).

    Google Scholar 

  10. S.R. Kosaraju: Decidability of reachability in vector addition systems. Proceedings of the 6th Annual ACM Symposium on the Theory of Computing, 267–281 (1982).

    Google Scholar 

  11. R. Lipton: The Reachability Problem Requires Exponential Space. Technical Report 62, Yale University (1976).

    Google Scholar 

  12. E.W. Mayr: An algorithm for the general Petri net reachability problem. SIAM Journal of Computing 13, 441–460 (1984).

    Article  Google Scholar 

  13. M. Minsky: Computation: Finite and Infinite Machines. Prentice-Hall (1967).

    Google Scholar 

  14. J.L. Peterson: Petri Net Theory and the Modelling of Systems. Prentice-Hall (1981).

    Google Scholar 

  15. C. Stirling: Modal and Temporal Logics. In S. Abramsky, D. Gabbay and T. Maibaum (eds.) Handbook of Logic in Computer Science. Oxford University Press (1991)

    Google Scholar 

  16. M.Y. Vardi and P. Wolper: Automata Theoretic Techniques for Modal Logics of Programs. Journal of Computer and System Sciences 32, 183–221 (1986).

    Article  Google Scholar 

  17. H. Yen: A Unified Approach for Deciding the Existence of Certain Petri Net Paths. Information and Computation 96(1), 119–137 (1992).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Foundations of Computer Science, University of Edinburgh, King's Buildings, EH9 3JZ, Edinburgh

    Javier Esparza

Authors
  1. Javier Esparza
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Sophie Tison

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Esparza, J. (1994). On the decidability of model checking for several μ-calculi and Petri nets. In: Tison, S. (eds) Trees in Algebra and Programming — CAAP'94. CAAP 1994. Lecture Notes in Computer Science, vol 787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017477

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57879-6

  • Online ISBN: 978-3-540-48373-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation