Skip to main content
Springer Nature Link
Log in

Model Checking with Finite Complete Prefixes Is PSPACE-Complete

  • Conference paper
  • First Online:
CONCUR 2000 — Concurrency Theory (CONCUR 2000)

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

Included in the following conference series:

Abstract

Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a symbolic representation of an interleaved reachability graph. We show that model checking a fixed size formula of several temporal logics, including LTL, CTL, and CTL*, is PSPACE-complete in the size of a finite complete prefix of a 1-safe Petri net. This proof employs a class of 1-safe Petri nets for which it is easy to generate a finite complete prefix in polynomial time.

The financial support of Helsinki Graduate School in Computer Science and Engineering, Academy of Finland (Project 47754), Foundation for Financial Aid at Helsinki University of Technology, Emil Aaltonen Foundation, and Nokia Foundation are gratefully acknowledged.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. E. Best. Partial order verification with PEP. In Proceedings of POMIV’96, Workshop on Partial Order Methods in Verification. American Mathematical Society, July 1996.

    Google Scholar 

  2. M. Dam. Fixpoints of Büchi automata. In Proceedings of the 12th International Conference of Foundations of Software Technology and Theoretical Computer Science, pages 39–50, 1992. LNCS 652.

    Google Scholar 

  3. E. A. Emerson. Temporal and modal logic. In Handbook of Theoretical Computer Science, Volume B, Formal Models and Semantics, pages 995–1072. North-Holland Pub. Co./MIT Press, 1990.

    Google Scholar 

  4. J. Engelfriet. Branching processes of Petri nets. Acta Informatica, 28:575–591, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  5. J. Esparza. Model checking using net unfoldings. Science of Computer Programming, 23(2):151–195, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  6. J. Esparza. Decidability and complexity of Petri net problems-An introduction. In Lectures on Petri Nets I: Basic Models, pages 374–428. Springer-Verlag, 1998. LNCS 1491.

    Google Scholar 

  7. J. Esparza and K. Heljanko. A new unfolding approach to LTL model checking. In Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP’2000), July 2000. Accepted for publication.

    Google Scholar 

  8. J. Esparza and M. Nielsen. Decidability issues for Petri Nets-a survey. Journal of Information Processing and Cybernetics 30(3), pages 143–160, 1994.

    MATH  Google Scholar 

  9. J. Esparza and S. Römer. An unfolding algorithm for synchronous products of transition systems. In Proceedings of the 10th International Conference on Concurrency Theory (Concur’99), pages 2–20. Springer-Verlag, 1999. LNCS 1664.

    Chapter  Google Scholar 

  10. J. Esparza, S. Römer, and W. Vogler. An improvement of McMillan’s unfolding algorithm. In Proceedings of Second International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’96), pages 87–106. Springer-Verlag, March 1996. LNCS 1055.

    Google Scholar 

  11. J. Feigenbaum, S. Kannan, M. Y. Vardi, and M. Viswanathan. Complexity of problems on graphs represented as OBDDs. Chigago Journal of Theoretical Computer Science, 1999(5):1–25, 1999.

    Google Scholar 

  12. B. Graves. Computing reachability properties hidden in finite net unfoldings. In Proceedings of 17th Foundations of Software Technology and Theoretical Computer Science Conference, pages 327–341. Springer-Verlag, 1997. LNCS 1346.

    Chapter  Google Scholar 

  13. K. Heljanko. Deadlock and reachability checking with finite complete prefixes. Research Report A56, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 1999. Licentiate’s Thesis. Available at http://www.tcs.hut.fi/pub/reports/A56.ps.gz.

    Google Scholar 

  14. K. Heljanko. Minimizing finite complete prefixes. In Proceedings of the Workshop Concurrency, Specification & Programming 1999, pages 83–95. Warsaw University, Warsaw, Poland, September 1999.

    Google Scholar 

  15. N. D. Jones, L. H. Landweber, and Y. E. Lien. Complexity of some problems in Petri nets. Theoretical Computer Science, 4:277–299, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  16. O. Kupferman. Model Checking for Branching-Time Temporal Logics. PhD thesis, Technion, Israel Institute of Technology, Haifa, Israel, June 1995.

    Google Scholar 

  17. O. Kupferman and M. Y. Vardi. Model checking of safety properties. In Proceeding of 11th International Conference on Computer Aided Verification (CAV’99), pages 172–183. Springer-Verlag, 1999. LNCS 1633.

    Google Scholar 

  18. R. Langerak and E. Brinksma. A complete finite prefix for process algebra. In Proceeding of 11th International Conference on Computer Aided Verification (CAV’99), pages 184–195. Spriger-Verlag, 1999. LNCS 1633.

    Google Scholar 

  19. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.

    Google Scholar 

  20. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.

    Google Scholar 

  21. F. Wallner. Model checking techniques using net unfoldings. PhD thesis, Technische Universität München, Germany, forthcoming.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Theoretical Computer Science, Helsinki University of Technology, P.O. Box 5400, FIN-02015 HUT, Finland

    Keijo Heljanko

Authors
  1. Keijo Heljanko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Pennsylvania State University, 220 Pond Laboratory, University Park, PA, 16802-6106, USA

    Catuscia Palamidessi

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heljanko, K. (2000). Model Checking with Finite Complete Prefixes Is PSPACE-Complete. In: Palamidessi, C. (eds) CONCUR 2000 — Concurrency Theory. CONCUR 2000. Lecture Notes in Computer Science, vol 1877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44618-4_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-44618-4_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics