Skip to main content
SpringerLink
Log in

On Stubborn Sets in the Verification of Linear Time Temporal Properties

  • Published:
Formal Methods in System Design Aims and scope Submit manuscript

Abstract

The stubborn set method is one of the methods that try to relieve the state space explosion problem that occurs in state space generation. This article is concentrated on the verification of next-time-less LTL (linear time temporal logic) formulas with the aid of the stubborn set method. The essential contribution is a theorem that gives us a way to utilize the structure of the checked formula when the stubborn set method is used and there is no fairness assumption. The theorem also applies to verification under fairness assumptions, including those which allow a predefined subset of actions to be treated unfairly.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. F. Bause, “Analysis of petri nets with a dynamic priority method,” in P. Azéma and G. Balbo (Eds.), Application and Theory of Petri Nets 1997, Lecture Notes in Computer Science, Vol. 1248, Springer-Verlag: Berlin, 1997, pp. 215–234.

    Google Scholar 

  2. R. Gerth, R. Kuiper, D. Peled, and W. Penczek, “A partial order approach to branching time logic model checking,” Information and Computation, Vol. 150, No. 2, pp. 132–152, 1999.

    Google Scholar 

  3. R. Gerth, D. Peled, M.Y. Vardi, and P. Wolper, “Simple on-the-fly au-to-ma-tic verification of linear tem-poral logic,” in P. Dembi’nski and M. Śred-niawa (Eds.), Protocol Specification, Testing and Verification (PSTV XV ‘95), Chapman & Hall (on behalf of IFIP), London, 1996, pp. 3–18.

    Google Scholar 

  4. P. Godefroid, Partial-Order Methods for the Verification of Concurrent Systems—An Approach to the State-Explosion Problem, Lecture Notes in Computer Science, Vol. 1032, Springer-Verlag, Berlin, 1996, 143 p.

    Google Scholar 

  5. R. Janicki and M. Koutny, “Using optimal simulations to reduce reach-ability graphs,” in E.M. Clarke and R.P. Kurshan (Eds.), Computer-Aided Verification (CAV ‘90), Lecture Notes in Computer Science, Vol. 531, Springer-Verlag, Berlin, 1991, pp. 166–175.

    Google Scholar 

  6. R. Kaivola, “Equivalences, preorders and compositional verification for linear time temporal logic and concurrent systems,” Doctoral thesis, University of Helsinki, Department of Computer Science, Report A-1996-1, 1996, 185 p.

  7. S. Katz and D. Peled, “Verification of distributed programs using representative interleaving sequences,” Distributed Computing, Vol. 6, No. 2, pp. 107–120, 1992.

    Google Scholar 

  8. I. Kokkarinen, D. Peled, and A. Valmari, “Relaxed visibility enhances partial order reduction,” in O. Grumberg (Ed.), Computer Aided Verification (CAV ‘97), Lecture Notes in Computer Science, Vol. 1254, Springer-Verlag, Berlin, 1997, pp. 328–339.

    Google Scholar 

  9. L.M. Kristensen and A. Valmari, “Improved question-guided stubborn set methods for state properties,” in M. Nielsen and D. Simpson (Eds.), Application and Theory of Petri Nets 2000, Lecture Notes in Computer Science, Vol. 1825, Springer-Verlag, Berlin, 2000, pp. 282–302.

    Google Scholar 

  10. T. Latvala and K. Heljanko, “Coping with strong fairness,” Fundamenta Informaticae, Vol. 43, Nos. 1–4, pp. 175–193, 2000.

    Google Scholar 

  11. Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems: Specification, Springer-Verlag, New York, 1991, 427 p.

    Google Scholar 

  12. R.P. Nalumasu, “Formal design and verification methods for shared memory systems,” PhD thesis, University of Utah, Salt LakeCity UT, 1999, 143 p.

  13. W.T. Overman, “Verification of concurrent systems: Function and timing,” PhD thesis, University of California at Los Angeles, 1981, 174 p.

  14. D. Peled, “All from one, one for all: On model checking using representatives,” in C. Courcoubetis (Ed.), Computer Aided Verification (CAV ‘93), Lecture Notes in Computer Science, Vol. 697, Springer-Verlag, Berlin, 1993, pp. 409–423.

    Google Scholar 

  15. D. Peled, “Combining partial order reductions with on-the-fly model-checking,” Formal Methods in System Design, Vol. 8, No. 1, pp. 39–64, 1996.

    Google Scholar 

  16. W. Penczek, M. Szreter, R. Gerth, and R. Kuiper, “Improving partial order reductions for universal branching time properties,” Fundamenta Informaticae, Vol. 43, Nos. 1–4, pp. 245–267, 2000.

    Google Scholar 

  17. Y.S. Ramakrishna and S.A. Smolka, “Partial-order reduction in the weak modal Mu-Calculus,” in A. Mazurkiewicz and J. Winkowski (Eds.), CONCUR ‘97: Concurrency Theory, Lecture Notes in Computer Science, Vol. 1243, Springer-Verlag, Berlin, 1997, pp. 5–24.

    Google Scholar 

  18. M. Rauhamaa, “A comparative study of methods for efficient reachability analysis,” Helsinki University of Technology, Digital Systems Laboratory Report A 14, 1990, 61 p.

  19. W. Reisig, Petri Nets: An Introduction, EATCS Monographs on Theoretical Computer Science, Vol. 4, Springer-Verlag, Berlin, 1985, 161 p.

    Google Scholar 

  20. W. Reisig, Elements of Distributed Algorithms–Modeling and Analysis With Petri Nets, Springer-Verlag, Berlin, 1998, 302 p.

    Google Scholar 

  21. C. Reutenauer, The Mathematics of Petri Nets, Prentice-Hall, Englewood Cliffs NJ, 1990, 117 p.

    Google Scholar 

  22. K. Schmidt, “Stubborn sets for standard properties,” in S. Donatelli and J. Kleijn (Eds.), Application and Theory of Petri Nets 1999, Lecture Notes in Computer Science, Vol. 1639, Springer-Verlag, Berlin, 1999, pp. 46–65.

    Google Scholar 

  23. K. Schmidt, “Stubborn sets for model checking the EF/AG fragment of CTL,” Fundamenta Informaticae, Vol. 43, Nos. 1–4, pp. 331–341, 2000.

    Google Scholar 

  24. R.H. Sloan and U. Buy, “Stubborn sets for real-time petri nets,” Formal Methods in System Design, Vol. 11, No. 1, pp. 23–40, 1997.

    Google Scholar 

  25. A. Valmari, “State space generation: Efficiency and practicality,” Doctoral thesis, Tampere University of Technology, Publications 55, 1988, 169 p.

  26. A. Valmari, “A stub-born attack on state explosion,” Formal Methods in System Design, Vol. 1, No. 4, pp. 297–322, 1992.

    Google Scholar 

  27. A. Valmari, “On-the-fly verification with stubborn sets,” in C. Courcoubetis (Ed.), Computer Aided Verification (CAV ‘93), Lecture Notes in Computer Science, Vol. 697, Springer-Verlag, Berlin, 1993, pp. 397–408.

    Google Scholar 

  28. A. Valmari, “Stubborn set methods for process algebras,” in D.A. Peled, V.R. Pratt, and G.J. Holzmann (Eds.), Partial Order Methods in Verification, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 29, American Mathematical Society, Providence RI, 1997, pp. 213–231.

    Google Scholar 

  29. K. Varpaaniemi, “On computing symmetries and stubborn sets,” Helsinki University of Technology, Digital Systems Laboratory Report B 12, 1994, 16 p.

  30. K. Varpaaniemi, “On the stubborn set method in reduced state space generation,” Doctoral thesis, Helsinki University of Technology, Digital Systems Laboratory Report A 51, 1998, 105 p.

  31. K. Varpaaniemi, “On stubborn sets in the verification of linear time temporal properties,” in J. Desel and M. Silva (Eds.), Application and Theory of Petri Nets 1998, Lecture Notes in Computer Science, Vol. 1420, Springer-Verlag, Berlin, 1998, pp. 124–143.

    Google Scholar 

  32. K. Varpaaniemi, “Stable models for stubborn sets,” Fundamenta Informaticae, Vol. 43, Nos. 1–4, pp. 355–375, 2000.

    Google Scholar 

  33. F. Vernadat, P. Azéma, and F. Michel, “Covering step graph,” in J. Billington and W. Reisig (Eds.), Application and Theory of Petri Nets 1996, Lecture Notes in Computer Science, Vol. 1091, Springer-Verlag, Berlin, 1996, pp. 516–535.

    Google Scholar 

  34. T. Yoneda and B.-H. Schlingloff, “Efficient verification of parallel real-time systems,” Formal Methods in System Design, Vol. 11, No. 2, pp. 187–215, 1997.

    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

    Kimmo Varpaaniemi

Authors
  1. Kimmo Varpaaniemi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kimmo Varpaaniemi.

Additional information

This work has been funded by the National Technology Agency of Finland, the Academy of Finland, Helsinki Graduate School in Computer Science and Engineering, Nokia Research Center, Nokia Networks, Elisa Communications, and Finnish Rail Administration.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Varpaaniemi, K. On Stubborn Sets in the Verification of Linear Time Temporal Properties. Form Method Syst Des 26, 45–67 (2005). https://doi.org/10.1007/s10703-005-4594-y

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10703-005-4594-y

Search

Navigation