{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:05:05Z","timestamp":1762459505731},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319670881"},{"type":"electronic","value":"9783319670898"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-67089-8_12","type":"book-chapter","created":{"date-parts":[[2017,8,24]],"date-time":"2017-08-24T12:47:26Z","timestamp":1503578846000},"page":"160-175","source":"Crossref","is-referenced-by-count":1,"title":["Stubborn Sets with Frozen Actions"],"prefix":"10.1007","author":[{"given":"Antti","family":"Valmari","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,25]]},"reference":[{"key":"12_CR1","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking, p. 314. MIT Press, Cambridge (1999)"},{"issue":"2","key":"12_CR2","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s10009-010-0137-y","volume":"12","author":"S Evangelista","year":"2010","unstructured":"Evangelista, S., Pajault, C.: Solving the ignoring problem for partial order reduction. Softw. Tools Technol. Transf. 12(2), 155\u2013170 (2010)","journal-title":"Softw. Tools Technol. Transf."},{"issue":"4","key":"12_CR3","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00271339","volume":"8","author":"J Eve","year":"1977","unstructured":"Eve, J., Kurki-Suonio, R.: On computing the transitive closure of a relation. Acta Informatica 8(4), 303\u2013314 (1977)","journal-title":"Acta Informatica"},{"issue":"3\u20134","key":"12_CR4","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0020-0190(00)00051-X","volume":"74","author":"HN Gabow","year":"2000","unstructured":"Gabow, H.N.: Path-based depth-first search for strong and biconnected components. Inf. Process. Lett. 74(3\u20134), 107\u2013114 (2000)","journal-title":"Inf. Process. Lett."},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BFb0023731","volume-title":"Computer-Aided Verification","author":"P Godefroid","year":"1991","unstructured":"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\u2013185. Springer, Heidelberg (1991). doi:\n10.1007\/BFb0023731"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Partial-Order Methods for the Verification of Concurrent Systems","year":"1996","unstructured":"Godefroid, P. (ed.): Partial-Order Methods for the Verification of Concurrent Systems. LNCS, vol. 1032. Springer, Heidelberg (1996)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-17906-2_30","volume-title":"Petri Nets: Applications and Relationships to Other Models of Concurrency","author":"A Mazurkiewicz","year":"1987","unstructured":"Mazurkiewicz, A.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 255, pp. 278\u2013324. Springer, Heidelberg (1987). doi:\n10.1007\/3-540-17906-2_30"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"Computer Aided Verification","author":"D Peled","year":"1993","unstructured":"Peled, D.: All from one, one for all: on model checking using representatives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 409\u2013423. Springer, Heidelberg (1993). doi:\n10.1007\/3-540-56922-7_34"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"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\u2013257. American Mathematical Society (1997)","DOI":"10.1090\/dimacs\/029\/13"},{"issue":"2","key":"12_CR10","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.ic.2006.06.002","volume":"205","author":"A Rensink","year":"2007","unstructured":"Rensink, A., Vogler, W.: Fair testing. Inf. Comput. 205(2), 125\u2013198 (2007)","journal-title":"Inf. Comput."},{"issue":"2","key":"12_CR11","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"RE Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"12_CR12","unstructured":"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\u2013122 (1988)"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/3-540-53863-1_36","volume-title":"Advances in Petri Nets 1990","author":"A Valmari","year":"1991","unstructured":"Valmari, A.: Stubborn sets for reduced state space generation. In: Rozenberg, G. (ed.) ICATPN 1989. LNCS, vol. 483, pp. 491\u2013515. Springer, Heidelberg (1991). doi:\n10.1007\/3-540-53863-1_36"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"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\u2013231. American Mathematical Society (1997)","DOI":"10.1090\/dimacs\/029\/12"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/3-540-65306-6_21","volume-title":"Lectures on Petri Nets I: Basic Models","author":"A Valmari","year":"1998","unstructured":"Valmari, A.: The state explosion problem. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1491, pp. 429\u2013528. Springer, Heidelberg (1998). doi:\n10.1007\/3-540-65306-6_21"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-319-51046-0_13","volume-title":"Concurrency, Security, and Puzzles: Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday","author":"A Valmari","year":"2017","unstructured":"Valmari, A.: More stubborn set methods for process algebras. In: Gibson-Robinson, T., Hopcroft, P., Lazi\u0107, R. (eds.) Concurrency, Security, and Puzzles: Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday. LNCS, vol. 10160, pp. 246\u2013271. Springer, Cham (2017). doi:\n10.1007\/978-3-319-51046-0_13"},{"key":"12_CR17","unstructured":"Valmari, A., Hansen, H.: Stubborn set intuition explained. In: Cabac, L., Kristensen, L.M., R\u00f6lke, H. (eds.) Proceedings of the International Workshop on Petri Nets and Software Engineering 2016. CEUR Workshop Proceedings, vol. 1591, pp. 213\u2013232 (2016)"},{"key":"12_CR18","unstructured":"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]"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-319-32582-8_16","volume-title":"Model Checking Software","author":"A Valmari","year":"2016","unstructured":"Valmari, A., Vogler, W.: Fair testing and stubborn sets. In: Bo\u0161na\u010dki, D., Wijs, A. (eds.) SPIN 2016. LNCS, vol. 9641, pp. 225\u2013243. Springer, Cham (2016). doi:\n10.1007\/978-3-319-32582-8_16"},{"key":"12_CR20","unstructured":"Valmari, A., Vogler, W.: Fair testing and stubborn sets (submitted for publication). An extended journal version of [19]"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Modular Construction and Partial Order Semantics of Petri Nets","year":"1992","unstructured":"Vogler, W. (ed.): Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol. 625. Springer, Heidelberg (1992)"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67089-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,24]],"date-time":"2017-08-24T12:52:51Z","timestamp":1503579171000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67089-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319670881","9783319670898"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67089-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}