Skip to main content
SpringerLink
Log in

Stubborn Sets with Frozen Actions

  • Conference paper
  • First Online:
Book cover Reachability Problems (RP 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10506))

Included in the following conference series:

Abstract

Most ample, persistent, and stubborn set methods use some special condition for ensuring that the analysis is not terminated prematurely. In the case of stubborn set methods for safety properties, implementation of the condition is usually based on recognizing the terminal strong components of the reduced state space and, if necessary, expanding the stubborn sets used in their roots. In an earlier study it was pointed out that if the system may execute a cycle consisting of only invisible actions and that cycle is concurrent with the rest of the system in a non-obvious way, then the method may be fooled to construct all states of the full parallel composition. This problem is solved in this study by a method that is based on “freezing” the actions in the cycle.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking, p. 314. MIT Press, Cambridge (1999)

    Google Scholar 

  2. Evangelista, S., Pajault, C.: Solving the ignoring problem for partial order reduction. Softw. Tools Technol. Transf. 12(2), 155–170 (2010)

    Article  Google Scholar 

  3. Eve, J., Kurki-Suonio, R.: On computing the transitive closure of a relation. Acta Informatica 8(4), 303–314 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  4. Gabow, H.N.: Path-based depth-first search for strong and biconnected components. Inf. Process. Lett. 74(3–4), 107–114 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  5. Godefroid, P.: Using partial orders to improve automatic verification methods. In: Clarke, E.M., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol. 531, pp. 176–185. Springer, Heidelberg (1991). doi:10.1007/BFb0023731

    Chapter  Google Scholar 

  6. Godefroid, P. (ed.): Partial-Order Methods for the Verification of Concurrent Systems. LNCS, vol. 1032. Springer, Heidelberg (1996)

    MATH  Google Scholar 

  7. Mazurkiewicz, A.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 255, pp. 278–324. Springer, Heidelberg (1987). doi:10.1007/3-540-17906-2_30

    Chapter  Google Scholar 

  8. Peled, D.: All from one, one for all: on model checking using representatives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 409–423. Springer, Heidelberg (1993). doi:10.1007/3-540-56922-7_34

    Chapter  Google Scholar 

  9. Peled, D.: Partial order reduction: linear and branching temporal logics and process algebras. In: Peled, D.A., Pratt, V.R., Holzmann, G.J. (eds.) Partial Order Methods in Verification: DIMACS Workshop. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 29, pp. 233–257. American Mathematical Society (1997)

    Google Scholar 

  10. Rensink, A., Vogler, W.: Fair testing. Inf. Comput. 205(2), 125–198 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  11. Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146–160 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  12. Valmari, A.: Error detection by reduced reachability graph generation. In: Proceedings of the 9th European Workshop on Application and Theory of Petri Nets, pp. 95–122 (1988)

    Google Scholar 

  13. Valmari, A.: Stubborn sets for reduced state space generation. In: Rozenberg, G. (ed.) ICATPN 1989. LNCS, vol. 483, pp. 491–515. Springer, Heidelberg (1991). doi:10.1007/3-540-53863-1_36

    Chapter  Google Scholar 

  14. Valmari, A.: Stubborn set methods for process algebras. In: Peled, D.A., Pratt, V.R., Holzmann, G.J. (eds.) Partial Order Methods in Verification: DIMACS Workshop. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 29, pp. 213–231. American Mathematical Society (1997)

    Google Scholar 

  15. Valmari, A.: The state explosion problem. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1491, pp. 429–528. Springer, Heidelberg (1998). doi:10.1007/3-540-65306-6_21

    Chapter  Google Scholar 

  16. Valmari, A.: More stubborn set methods for process algebras. In: Gibson-Robinson, T., Hopcroft, P., Lazić, R. (eds.) Concurrency, Security, and Puzzles: Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday. LNCS, vol. 10160, pp. 246–271. Springer, Cham (2017). doi:10.1007/978-3-319-51046-0_13

    Chapter  Google Scholar 

  17. Valmari, A., Hansen, H.: Stubborn set intuition explained. In: Cabac, L., Kristensen, L.M., Rölke, H. (eds.) Proceedings of the International Workshop on Petri Nets and Software Engineering 2016. CEUR Workshop Proceedings, vol. 1591, pp. 213–232 (2016)

    Google Scholar 

  18. Valmari, A., Hansen, H.: Stubborn set intuition explained. In: Transactions on Petri Nets and Other Models of Concurrency. LNCS (accepted for publication). An extended version of [17]

    Google Scholar 

  19. Valmari, A., Vogler, W.: Fair testing and stubborn sets. In: Bošnački, D., Wijs, A. (eds.) SPIN 2016. LNCS, vol. 9641, pp. 225–243. Springer, Cham (2016). doi:10.1007/978-3-319-32582-8_16

    Chapter  Google Scholar 

  20. Valmari, A., Vogler, W.: Fair testing and stubborn sets (submitted for publication). An extended journal version of [19]

    Google Scholar 

  21. Vogler, W. (ed.): Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol. 625. Springer, Heidelberg (1992)

    MATH  Google Scholar 

Download references

Acknowledgements

We thank the anonymous reviewers for their comments.

Author information

Authors and Affiliations

  1. Mathematics, Tampere University of Technology, P.O. Box 553, 33101, Tampere, Finland

    Antti Valmari

Authors
  1. Antti Valmari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Antti Valmari .

Editor information

Editors and Affiliations

  1. Royal Holloway University of London, London, United Kingdom

    Matthew Hague

  2. University of Liverpool, Liverpool, United Kingdom

    Igor Potapov

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Valmari, A. (2017). Stubborn Sets with Frozen Actions. In: Hague, M., Potapov, I. (eds) Reachability Problems. RP 2017. Lecture Notes in Computer Science(), vol 10506. Springer, Cham. https://doi.org/10.1007/978-3-319-67089-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67089-8_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67088-1

  • Online ISBN: 978-3-319-67089-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation