{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T19:44:21Z","timestamp":1779392661208,"version":"3.53.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030452308","type":"print"},{"value":"9783030452315","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In model checking, partial-order reduction (POR) is an effective technique to reduce the size of the state space. Stubborn sets are an established variant of POR and have seen many applications over the past 31 years. One of the early works on stubborn sets shows that a combination of several conditions on the reduction is sufficient to preserve stutter-trace equivalence, making stubborn sets suitable for model checking of linear-time properties. In this paper, we identify a flaw in the reasoning and show with a counter-example that stutter-trace equivalence is not necessarily preserved. We propose a solution together with an updated correctness proof. Furthermore, we analyse in which formalisms this problem may occur. The impact on practical implementations is limited, since they all compute a correct approximation of the theory.<\/jats:p>","DOI":"10.1007\/978-3-030-45231-5_25","type":"book-chapter","created":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T10:02:53Z","timestamp":1587117773000},"page":"482-501","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Neele","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antti","family":"Valmari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tim A. C.","family":"Willemse","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,4,17]]},"reference":[{"key":"25_CR1","unstructured":"Baier, C., Katoen, J.P.: Principles of model checking. MIT Press (2008)"},{"key":"25_CR2","doi-asserted-by":"publisher","unstructured":"Bene\u0161, N., Brim, L., Buhnova, B., Ern, I., Sochor, J., Va\u0159ekov\u00e1, P.: Partial order reduction for state\/event LTL with application to component-interaction automata. Science of Computer Programming 76(10), 877\u2013890 (2011). https:\/\/doi.org\/10.1016\/j.scico.2010.02.008","DOI":"10.1016\/j.scico.2010.02.008"},{"key":"25_CR3","doi-asserted-by":"publisher","unstructured":"Bene\u0161, N., Brim, L., \u010cern\u00e1, I., Sochor, J., Va\u0159ekov\u00e1, P., Zimmerova, B.: Partial Order Reduction for State\/Event LTL. In: IFM 2009. LNCS, vol.\u00a05423, pp. 307\u2013321 (2009). https:\/\/doi.org\/10.1007\/978-3-642-00255-7_21","DOI":"10.1007\/978-3-642-00255-7_21"},{"key":"25_CR4","doi-asserted-by":"publisher","unstructured":"B\u00f8nneland, F.M., Jensen, P.G., Larsen, K.G., Mu\u00f1iz, M.: Partial Order Reduction for Reachability Games. In: CONCUR 2019. vol.\u00a0140, pp. 23:1\u201323:15 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2019.23","DOI":"10.4230\/LIPIcs.CONCUR.2019.23"},{"key":"25_CR5","doi-asserted-by":"publisher","unstructured":"Gerth, R., Kuiper, R., Peled, D., Penczek, W.: A Partial Order Approach to Branching Time Logic Model Checking. Information and Computation 150(2), 132\u2013152 (1999). https:\/\/doi.org\/10.1006\/inco.1998.2778","DOI":"10.1006\/inco.1998.2778"},{"key":"25_CR6","doi-asserted-by":"publisher","unstructured":"Gibson-Robinson, T., Hansen, H., Roscoe, A.W., Wang, X.: Practical Partial Order Reduction for CSP. In: NFM 2015. LNCS, vol.\u00a09058, pp. 188\u2013203 (2015). https:\/\/doi.org\/10.1007\/978-3-319-17524-9_14","DOI":"10.1007\/978-3-319-17524-9_14"},{"key":"25_CR7","doi-asserted-by":"publisher","unstructured":"Godefroid, P.: Partial-Order Methods for the Verification of Concurrent Systems, LNCS, vol.\u00a01032. Springer (1996). https:\/\/doi.org\/10.1007\/3-540-60761-7","DOI":"10.1007\/3-540-60761-7"},{"key":"25_CR8","doi-asserted-by":"publisher","unstructured":"Hansen, H., Lin, S., Liu, Y., Nguyen, T.K., Sun, J.: Diamonds Are a Girl\u2019s Best Friend: Partial Order Reduction for Timed Automata with Abstractions. In: CAV 2014. LNCS, vol.\u00a08559, pp. 391\u2013406 (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_26","DOI":"10.1007\/978-3-319-08867-9_26"},{"key":"25_CR9","doi-asserted-by":"publisher","unstructured":"Laarman, A., Pater, E., van\u00a0de Pol, J., Hansen, H.: Guard-based partial-order reduction. STTT 18(4), 427\u2013448 (2016). https:\/\/doi.org\/10.1007\/s10009-014-0363-9","DOI":"10.1007\/s10009-014-0363-9"},{"key":"25_CR10","doi-asserted-by":"publisher","unstructured":"Liebke, T., Wolf, K.: Taking Some Burden Off an Explicit CTL Model Checker. In: Petri Nets 2019. LNCS, vol. 11522, pp. 321\u2013341 (2019). https:\/\/doi.org\/10.1007\/978-3-030-21571-2_18","DOI":"10.1007\/978-3-030-21571-2_18"},{"key":"25_CR11","doi-asserted-by":"publisher","unstructured":"Peled, D.: All from One, One for All: on Model Checking Using Representatives. In: CAV 1993. LNCS, vol.\u00a0697, pp. 409\u2013423 (1993). https:\/\/doi.org\/10.1007\/3-540-56922-7_34","DOI":"10.1007\/3-540-56922-7_34"},{"key":"25_CR12","doi-asserted-by":"publisher","unstructured":"Peled, D.: Combining partial order reductions with on-the-fly model-checking. FMSD 8(1), 39\u201364 (1996). https:\/\/doi.org\/10.1007\/BF00121262","DOI":"10.1007\/BF00121262"},{"key":"25_CR13","unstructured":"Schmidt, K.: Stubborn sets for model checking the EF\/AG fragment of CTL. Fundamenta Informaticae 43(1-4), 331\u2013341 (2000)"},{"key":"25_CR14","doi-asserted-by":"publisher","unstructured":"Siegel, S.F.: What\u2019s Wrong with On-the-Fly Partial Order Reduction. In: CAV 2019. LNCS, vol. 11562, pp. 478\u2013495 (2019). https:\/\/doi.org\/10.1007\/978-3-030-25543-5_27","DOI":"10.1007\/978-3-030-25543-5_27"},{"key":"25_CR15","doi-asserted-by":"publisher","unstructured":"Valmari, A.: A Stubborn Attack on State Explosion. In: CAV 1990. LNCS, vol.\u00a0531, pp. 156\u2013165 (1991). https:\/\/doi.org\/10.1007\/BFb0023729","DOI":"10.1007\/BFb0023729"},{"key":"25_CR16","doi-asserted-by":"publisher","unstructured":"Valmari, A.: Stubborn sets for reduced state space generation. In: Advances in Petri Nets. vol.\u00a0483, pp. 491\u2013515 (1991). https:\/\/doi.org\/10.1007\/3-540-53863-1_36","DOI":"10.1007\/3-540-53863-1_36"},{"key":"25_CR17","doi-asserted-by":"publisher","unstructured":"Valmari, A.: A Stubborn Attack on State Explosion. Formal Methods in System Design 1(4), 297\u2013322 (1992). https:\/\/doi.org\/10.1007\/BF00709154","DOI":"10.1007\/BF00709154"},{"key":"25_CR18","doi-asserted-by":"publisher","unstructured":"Valmari, A.: The state explosion problem. In: ACPN 1996. LNCS, vol.\u00a01491, pp. 429\u2013528 (1996). https:\/\/doi.org\/10.1007\/3-540-65306-6_21","DOI":"10.1007\/3-540-65306-6_21"},{"key":"25_CR19","doi-asserted-by":"publisher","unstructured":"Valmari, A.: Stubborn Set Methods for Process Algebras. In: POMIV 1996. DIMACS, vol.\u00a029, pp. 213\u2013231 (1997). https:\/\/doi.org\/10.1090\/dimacs\/029\/12","DOI":"10.1090\/dimacs\/029\/12"},{"key":"25_CR20","doi-asserted-by":"publisher","unstructured":"Valmari, A.: Stop It, and Be Stubborn! TECS 16(2), 46:1\u201346:26 (2017). https:\/\/doi.org\/10.1145\/3012279","DOI":"10.1145\/3012279"},{"key":"25_CR21","doi-asserted-by":"publisher","unstructured":"Valmari, A., Hansen, H.: Stubborn Set Intuition Explained. In: ToPNoC XII. LNCS, vol. 10470, pp. 140\u2013165 (2017). https:\/\/doi.org\/10.1007\/978-3-662-55862-1_7","DOI":"10.1007\/978-3-662-55862-1_7"},{"key":"25_CR22","doi-asserted-by":"publisher","unstructured":"Varpaaniemi, K.: On Stubborn Sets in the Verification of Linear Time Temporal Properties. FMSD 26(1), 45\u201367 (2005). https:\/\/doi.org\/10.1007\/s10703-005-4594-y","DOI":"10.1007\/s10703-005-4594-y"},{"key":"25_CR23","doi-asserted-by":"publisher","unstructured":"Wolf, K.: Petri Net Model Checking with LoLA 2. In: Petri Nets 2018. LNCS, vol. 10877, pp. 351\u2013362 (2018). https:\/\/doi.org\/10.1007\/978-3-319-91268-4_18","DOI":"10.1007\/978-3-319-91268-4_18"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45231-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T14:00:45Z","timestamp":1610028045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45231-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030452308","9783030452315"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45231-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"17 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2020\/fossacs","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"98","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference could not take place due to the COVID-19 pandemic. There was an online event on July 2, 2020.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}