Skip to main content
SpringerLink
Log in

Tableau methods for PA-processes

  • Contributed Papers
  • Conference paper
  • First Online:
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 1997)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1227))

Abstract

PA (Process algebra) is the name that has become common use to denote the algebra with a sequential and parallel operator (without communication), plus recursion. PA-processes are a superset of both Basic Parallel Processes (BPP) [Chr93] and context-free processes (BPA).

We study three problems for PA-processes: The reachability problem, the partial deadlock reachability problem (“Is it possible to reach a state where certain actions are not enabled ?”) and the partial livelock reach-ability problem (“Is it possible to reach a state where certain actions are disabled forever ?”). We present sound and complete tableau systems for these problems and compare them to non-tableau algorithms.

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. Bradfield, J. Esparza, and A. Mader. An effective tableau system for the linear time μ-calculus. In F. Meyer auf der Heide and B. Monien, editors, Proceedings of ICALP'96, number 1099 in LNCS. Springer Verlag, 1996.

    Google Scholar 

  2. S. Christensen. Decidability and Decomposition in Process Algebras. PhD thesis, Edinburgh University, 1993.

    Google Scholar 

  3. Javier Esparza. Petri nets, commutative context-free grammars and basic parallel processes. In Horst Reichel, editor, Fundamentals of Computation Theory, number 965 in LNCS. Springer Verlag, 1995.

    Google Scholar 

  4. J. Esparza. More infinite results. In B. Steffen and T. Margaria, editors, Proceedings of INFINITY'96, number MIP-9614 in Technical report series of the University of Passau. University of Passau, 1996.

    Google Scholar 

  5. E. Mayr. An algorithm for the general petri net reachability problem. SIAM Journal of Computing, 13:441–460, 1984.

    Google Scholar 

  6. Richard Mayr. Model checking pa-processes. Technical Report TUM-I9640, TU-München, December 1996.

    Google Scholar 

  7. Richard Mayr. Semantic reachability for simple process algebras. In B. Steffen and T. Margaria, editors, Proceedings of INFINITY'96, number MIP-9614 in Technical report series of the University of Passau. University of Passau, 1996.

    Google Scholar 

  8. Richard Mayr. A tableau system for model checking petri nets with a fragment of the linear time μ-calculus. Technical Report TUM-I9634, TU-München, October 1996.

    Google Scholar 

  9. R. Milner. Communication and Concurrency. Prentice Hall, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Richard Mayr

Authors
  1. Richard Mayr
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Didier Galmiche

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mayr, R. (1997). Tableau methods for PA-processes. In: Galmiche, D. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 1997. Lecture Notes in Computer Science, vol 1227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027420

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62920-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation