skip to main content
research-article

Stop It, and Be Stubborn!

Published:10 January 2017Publication History
Skip Abstract Section

Abstract

This publication discusses how automatic verification of concurrent systems can be made more efficient by focusing on always may-terminating systems. First, making a system always may-terminating is a method for meeting a modelling need that exists independently of this publication. It is illustrated that without doing so, non-progress errors may be lost. Second, state explosion is often alleviated with stubborn, ample, and persistent set methods. They use expensive cycle or terminal strong component conditions in many cases. It is proven that for many important classes of properties, if the systems are always may-terminating, then these conditions can be left out.

References

  1. Lubos Brim, Ivana Cerná, Pavel Moravec, and Jirí Simsa. 2006. On combining partial order reduction with fairness assumptions. In Formal Methods: Applications and Technology, 11th International Workshop, FMICS 2006 and 5th International Workshop PDMC 2006, Bonn, Germany, August 26-27, and August 31, 2006, Revised Selected Papers (Lecture Notes in Computer Science), Lubos Brim, Boudewijn R. Haverkort, Martin Leucker, and Jaco van de Pol (Eds.), Vol. 4346. Springer, 84--99. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Edmund M. Clarke, Orna Grumberg, and Doron A. Peled. 2001. Model Checking. MIT Press. Retrieved from http://books.google.de/books?id=Nmc4wEaLXFEC.Google ScholarGoogle Scholar
  3. E. Allen Emerson. 1990. Temporal and modal logic. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B). 995--1072. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Javier Esparza. 1996. Decidability and complexity of Petri net problems—An introduction. In Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the Volumes Are Based on the Advanced Course on Petri Nets, Lecture Notes in Computer Science, Vol. 1491, Wolfgang Reisig and Grzegorz Rozenberg (Eds.). Springer, 374--428. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Sami Evangelista and Christophe Pajault. 2010. Solving the ignoring problem for partial order reduction. STTT 12, 2 (2010), 155--170.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Eve and Reino Kurki-Suonio. 1977. On computing the transitive closure of a relation. Acta Inf. 8 (1977), 303--314. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Patrice Godefroid. 1990. Using partial orders to improve automatic verification methods. In Computer-Aided Verification, Proceedings of a DIMACS Workshop 1990 DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 3, Edmund M. Clarke and Robert P. Kurshan (Eds.). DIMACS/AMS, 321--340. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Patrice Godefroid. 1996. Partial-Order Methods for the Verification of Concurrent Systems—An Approach to the State-Explosion Problem. Lecture Notes in Computer Science, Vol. 1032. Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Henri Hansen, Wojciech Penczek, and Antti Valmari. 2002. Stuttering-insensitive automata for on-the-fly detection of livelock properties. Electr. Notes Theor. Comput. Sci. 66, 2 (2002), 178--193.Google ScholarGoogle ScholarCross RefCross Ref
  10. Gerard J. Holzmann. 2004. The SPIN Model Checker - Primer and Reference Manual. Addison-Wesley. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Zohar Manna and Amir Pnueli. 1992. The Temporal Logic of Reactive and Concurrent Systems—Specification. Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Doron A. Peled. 1993. All from one, one for all: On model checking using representatives. In Proceedings of the 5th International Conference on Computer Aided Verification CAV’93), Lecture Notes in Computer Science, Vol. 697, Costas Courcoubetis (Ed.). Springer, 409--423. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Gary L. Peterson. 1981. Myths about the mutual exclusion problem. Inf. Process. Lett. 12, 3 (1981), 115--116.Google ScholarGoogle ScholarCross RefCross Ref
  14. Arend Rensink and Walter Vogler. 2007. Fair testing. Inf. Comput. 205, 2 (2007), 125--198. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. A. W. Roscoe. 2010. Understanding Concurrent Systems. Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Robert Endre Tarjan. 1972. Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 2 (1972), 146--160.Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Antti Valmari. 1988. Error detection by reduced reachability graph generation. In Proceedings of the 9th European Workshop on Application and Theory of Petri Nets. 95--122.Google ScholarGoogle Scholar
  18. Antti Valmari. 1989. Stubborn sets for reduced state space generation. In Advances in Petri Nets 1990: Proceedings of the 10th International Conference on Applications and Theory of Petri Nets), Lecture Notes in Computer Science, Vol. 483, Grzegorz Rozenberg (Ed.). Springer, 491--515. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Antti Valmari. 1996. The state explosion problem. In Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the Volumes Are Based on the Advanced Course on Petri Nets, Lecture Notes in Computer Science, Vol 1491, Wolfgang Reisig and Grzegorz Rozenberg (Eds.). Springer, 429--528. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Antti Valmari. 2015a. A state space tool for concurrent system models expressed in C++. In Proceedings of the 14th Symposium on Programming Languages and Software Tools (SPLST’15), Jyrki Nummenmaa, Outi Sievi-Korte, and Erkki Mäkinen (Eds.), Vol. 1525. CEUR-WS.org, 91--105. Retrieved from http://ceur-ws.org/Vol-1525/paper-07.pdf.Google ScholarGoogle Scholar
  21. Antti Valmari. 2015b. Stop it, and be stubborn! In Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD 2015). IEEE Computer Society, 10--19. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Antti Valmari and Henri Hansen. 2016. Stubborn set intuition explained. In Proceedings of the International Workshop on Petri Nets and Software Engineering 2016, Including the International Workshop on Biological Processes 8 Petri Nets 2016 Co-located with the 37th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2016 and the 16th International Conference on Application of Concurrency to System Design ACSD. (CEUR Workshop Proceedings), Lawrence Cabac, Lars Michael Kristensen, and Heiko Rölke (Eds.), Vol. 1591. CEUR-WS.org, 213--232. Retrieved from http://ceur-ws.org/Vol-1591/paper15.pdf.Google ScholarGoogle Scholar
  23. Antti Valmari and Manu Setälä. 1996. Visual verification of safety and liveness. In Proceedings of the 3rd International Symposium of Formal Methods Europe Industrial Benefit and Advances in Formal Methods (FME’96), Lecture Notes in Computer Science, Marie-Claude Gaudel and Jim Woodcock (Eds.), Vol. 1051. Springer, 228--247. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Antti Valmari and Martti Tienari. 1995. Compositional failure-based semantics models for basic LOTOS. Formal Asp. Comput. 7, 4 (1995), 440--468.Google ScholarGoogle ScholarCross RefCross Ref
  25. Antti Valmari and Walter Vogler. 2016. Fair testing and stubborn sets. In Proceedings of the 23rd International Symposium on Model Checking Software (SPIN 2016), Lecture Notes in Computer Science, Vol. 9641. Dragan Bosnacki and Anton Wijs (Eds.). Springer, 225--243.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Stop It, and Be Stubborn!

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!