{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T22:34:29Z","timestamp":1784241269557,"version":"3.55.0"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T00:00:00Z","timestamp":1484006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2017,5,31]]},"abstract":"<jats:p>\n            This publication discusses how automatic verification of concurrent systems can be made more efficient by focusing on\n            <jats:italic>always may-terminating systems<\/jats:italic>\n            . 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.\n          <\/jats:p>","DOI":"10.1145\/3012279","type":"journal-article","created":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T15:41:17Z","timestamp":1484062877000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Stop It, and Be Stubborn!"],"prefix":"10.1145","volume":"16","author":[{"given":"Antti","family":"Valmari","sequence":"first","affiliation":[{"name":"Tampere University of Technology, Tampere, Finland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,1,10]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"11th International Workshop, FMICS 2006 and 5th International Workshop PDMC 2006","volume":"4346","author":"Brim Lubos","year":"2006","unstructured":"Lubos Brim , Ivana Cern\u00e1 , Pavel Moravec , and Jir\u00ed 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. Lubos Brim, Ivana Cern\u00e1, Pavel Moravec, and Jir\u00ed 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."},{"key":"e_1_2_1_2_1","volume-title":"Peled","author":"Clarke Edmund M.","year":"2001","unstructured":"Edmund M. Clarke , Orna Grumberg , and Doron A . Peled . 2001 . Model Checking. MIT Press . Retrieved from http:\/\/books.google.de\/books?id&equals;Nmc4wEaLXFEC. Edmund M. Clarke, Orna Grumberg, and Doron A. Peled. 2001. Model Checking. MIT Press. Retrieved from http:\/\/books.google.de\/books?id&equals;Nmc4wEaLXFEC."},{"key":"e_1_2_1_3_1","volume-title":"Handbook of Theoretical Computer Science","author":"Emerson E. Allen","unstructured":"E. Allen Emerson . 1990. Temporal and modal logic . In Handbook of Theoretical Computer Science , Volume B: Formal Models and Sematics (B). 995-- 1072 . E. Allen Emerson. 1990. Temporal and modal logic. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B). 995--1072."},{"key":"e_1_2_1_4_1","series-title":"Lecture Notes in Computer Science","volume-title":"Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the Volumes Are Based on the Advanced Course on Petri Nets","author":"Esparza Javier","unstructured":"Javier Esparza . 1996. Decidability and complexity of Petri net problems\u2014An 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. Javier Esparza. 1996. Decidability and complexity of Petri net problems\u2014An 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."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/3220920.3221236"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00271339"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of a DIMACS Workshop 1990 DIMACS Series in Discrete Mathematics and Theoretical Computer Science","volume":"3","author":"Godefroid Patrice","year":"1990","unstructured":"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. 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."},{"key":"e_1_2_1_8_1","series-title":"Lecture Notes in Computer Science","volume-title":"Partial-Order Methods for the Verification of Concurrent Systems\u2014An Approach to the State-Explosion Problem","author":"Godefroid Patrice","unstructured":"Patrice Godefroid . 1996. Partial-Order Methods for the Verification of Concurrent Systems\u2014An Approach to the State-Explosion Problem . Lecture Notes in Computer Science , Vol. 1032 . Springer . Patrice Godefroid. 1996. Partial-Order Methods for the Verification of Concurrent Systems\u2014An Approach to the State-Explosion Problem. Lecture Notes in Computer Science, Vol. 1032. Springer."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80411-0"},{"key":"e_1_2_1_10_1","volume-title":"The SPIN Model Checker - Primer and Reference Manual","author":"Holzmann Gerard J.","unstructured":"Gerard J. Holzmann . 2004. The SPIN Model Checker - Primer and Reference Manual . Addison-Wesley . Gerard J. Holzmann. 2004. The SPIN Model Checker - Primer and Reference Manual. Addison-Wesley."},{"key":"e_1_2_1_11_1","volume-title":"The Temporal Logic of Reactive and Concurrent Systems\u2014Specification","author":"Manna Zohar","unstructured":"Zohar Manna and Amir Pnueli . 1992. The Temporal Logic of Reactive and Concurrent Systems\u2014Specification . Springer . Zohar Manna and Amir Pnueli. 1992. The Temporal Logic of Reactive and Concurrent Systems\u2014Specification. Springer."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/647762.735490"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90106-X"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2006.06.002"},{"key":"e_1_2_1_15_1","volume-title":"Understanding Concurrent Systems","author":"Roscoe A. W.","unstructured":"A. W. Roscoe . 2010. Understanding Concurrent Systems . Springer . A. W. Roscoe. 2010. Understanding Concurrent Systems. Springer."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the 9th European Workshop on Application and Theory of Petri Nets. 95--122","author":"Valmari Antti","year":"1988","unstructured":"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 . 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."},{"key":"e_1_2_1_18_1","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Petri Nets 1990: Proceedings of the 10th International Conference on Applications and Theory of Petri Nets)","author":"Valmari Antti","unstructured":"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. 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."},{"key":"e_1_2_1_19_1","series-title":"Lecture Notes in Computer Science, Vol 1491","volume-title":"Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the Volumes Are Based on the Advanced Course on Petri Nets","author":"Valmari Antti","unstructured":"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. 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."},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the 14th Symposium on Programming Languages and Software Tools (SPLST\u201915)","volume":"1525","author":"Valmari Antti","year":"2015","unstructured":"Antti Valmari . 2015 a. A state space tool for concurrent system models expressed in C++ . In Proceedings of the 14th Symposium on Programming Languages and Software Tools (SPLST\u201915) , Jyrki Nummenmaa, Outi Sievi-Korte, and Erkki M\u00e4kinen (Eds.) , Vol. 1525 . CEUR-WS.org, 91--105. Retrieved from http:\/\/ceur-ws.org\/Vol-1525\/paper-07.pdf. 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\u201915), Jyrki Nummenmaa, Outi Sievi-Korte, and Erkki M\u00e4kinen (Eds.), Vol. 1525. CEUR-WS.org, 91--105. Retrieved from http:\/\/ceur-ws.org\/Vol-1525\/paper-07.pdf."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSD.2015.14"},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the International Workshop on Petri Nets and Software Engineering","author":"Valmari Antti","year":"2016","unstructured":"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\u00f6lke (Eds.), Vol. 1591 . CEUR-WS.org, 213--232. Retrieved from http:\/\/ceur-ws.org\/Vol-1591\/paper15.pdf. 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\u00f6lke (Eds.), Vol. 1591. CEUR-WS.org, 213--232. Retrieved from http:\/\/ceur-ws.org\/Vol-1591\/paper15.pdf."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/647537.729673"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01211218"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32582-8_16"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3012279","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3012279","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:47Z","timestamp":1750222487000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3012279"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,10]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,5,31]]}},"alternative-id":["10.1145\/3012279"],"URL":"https:\/\/doi.org\/10.1145\/3012279","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"value":"1539-9087","type":"print"},{"value":"1558-3465","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,10]]},"assertion":[{"value":"2016-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-01-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}