{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T09:25:09Z","timestamp":1750843509362,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642311307"},{"type":"electronic","value":"9783642311314"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31131-4_13","type":"book-chapter","created":{"date-parts":[[2012,6,5]],"date-time":"2012-06-05T18:36:12Z","timestamp":1338921372000},"page":"228-247","source":"Crossref","is-referenced-by-count":6,"title":["Stubborn Sets for Simple Linear Time Properties"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Lehmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Niels","family":"Lohmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karsten","family":"Wolf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","volume":"98","author":"J.R. Burch","year":"1992","unstructured":"Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 1020 states and beyond. Inf. Comput.\u00a098(2), 142\u2013170 (1992)","journal-title":"Inf. Comput."},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1011276507260","volume":"19","author":"E.M. Clarke","year":"2001","unstructured":"Clarke, E.M., Biere, A., Raimi, R., Zhu, Y.: Bounded model checking using satisfiability solving. Formal Methods in System Design\u00a019(1), 7\u201334 (2001)","journal-title":"Formal Methods in System Design"},{"key":"13_CR3","unstructured":"Ciardo, G., et al.: The smart model checker, http:\/\/www.cs.ucr.edu\/~ciardo\/SMART"},{"issue":"5","key":"13_CR4","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/j.datak.2011.01.004","volume":"70","author":"D. Fahland","year":"2011","unstructured":"Fahland, D., Favre, C., Koehler, J., Lohmann, N., V\u00f6lzer, H., Wolf, K.: Analysis on demand: Instantaneous soundness checking of industrial business process models. Data Knowl. Eng.\u00a070(5), 448\u2013466 (2011)","journal-title":"Data Knowl. Eng."},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-04761-9_4","volume-title":"Automated Technology for Verification and Analysis","author":"J. Geldenhuys","year":"2009","unstructured":"Geldenhuys, J., Hansen, H., Valmari, A.: Exploring the Scope for Partial Order Reduction. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol.\u00a05799, pp. 39\u201353. Springer, Heidelberg (2009)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Gerth, R., Kuiper, R., Peled, D., Penczek, W.: A partial order approach to branching time logic model checking. In: IEEE 3rd Israel Symp. on the Theory of Computing and Systems, pp. 130\u2013140 (1995)","DOI":"10.1109\/ISTCS.1995.377038"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Godefroid, P., Wolper, P.: A partial approach to model checking. In: 6th IEEE Symp. on Logic in Computer Science, Amsterdam, pp. 406\u2013415 (1991)","DOI":"10.1109\/LICS.1991.151664"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/3-540-63166-6_33","volume-title":"Computer Aided Verification","author":"I. Kokkarinen","year":"1997","unstructured":"Kokkarinen, I., Peled, D., Valmari, A.: Relaxed Visibility Enhances Partial Order Reduction. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 328\u2013339. Springer, Heidelberg (1997)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Kordon, F., et al.: Report on the model checking contest at Petri Nets, LNCS ToPNoC (2011), more information provided on http:\/\/sumo.lip6.fr\/mcc.html (accepted for publication in January 2012)","DOI":"10.1007\/978-3-642-35179-2_8"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/3-540-44988-4_17","volume-title":"Application and Theory of Petri Nets 2000","author":"L.M. Kristensen","year":"2000","unstructured":"Kristensen, L.M., Valmari, A.: Improved Question-Guided Stubborn Set Methods for State Properties. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol.\u00a01825, pp. 282\u2013302. Springer, Heidelberg (2000)"},{"key":"13_CR11","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\u2013Checking Using Representitives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 409\u2013423. Springer, Heidelberg (1993)"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Reisig, W.: Elements Of Distributed Algorithms: Modeling and Analysis with Petri Nets. Springer (September 1998)","DOI":"10.1007\/978-3-662-03687-7"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/3-540-48745-X_4","volume-title":"Application and Theory of Petri Nets 1999","author":"K. Schmidt","year":"1999","unstructured":"Schmidt, K.: Stubborn Sets for Standard Properties. In: Donatelli, S., Kleijn, J. (eds.) ICATPN 1999. LNCS, vol.\u00a01639, pp. 46\u201365. Springer, Heidelberg (1999)"},{"issue":"1-4","key":"13_CR14","first-page":"331","volume":"43","author":"K. Schmidt","year":"2000","unstructured":"Schmidt, K.: Stubborn sets for model checking the EF\/AG fragment of CTL. Fundam. Inform.\u00a043(1-4), 331\u2013341 (2000)","journal-title":"Fundam. Inform."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Stahl, C., Reisig, W., Krstic, M.: Hazard detection in a GALS wrapper: A case study. In: ACSD 2005, pp. 234\u2013243. IEEE Computer Society (2005)","DOI":"10.1109\/ACSD.2005.20"},{"key":"13_CR16","unstructured":"Valmari, A.: Error detetction by reduced reachability graph generation. In: 9th European Workshop on Application and Theory of Petri Nets, Venice, Italy, pp. 95\u2013112 (1988)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Valmari, A.: A stubborn attack on state explosion. In: Formal Methods in System Design 1, pp. 297\u2013322 (1992)","DOI":"10.1007\/BF00709154"},{"key":"13_CR18","unstructured":"Valmari, A.: Stubborn set methods for process algebras. In: Workshop on Partial Order Methods in Verification, Princeton, pp. 192\u2013210 (1996)"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-642-13675-7_5","volume-title":"Applications and Theory of Petri Nets","author":"A. Valmari","year":"2010","unstructured":"Valmari, A., Hansen, H.: Can Stubborn Sets Be Optimal? In: Lilius, J., Penczek, W. (eds.) PETRI NETS 2010. LNCS, vol.\u00a06128, pp. 43\u201362. Springer, Heidelberg (2010)"},{"key":"13_CR20","unstructured":"Varpaaniemi, K.: On the stubborn set method in reduced state space generation. PhD thesis, Helsinki University of Technology (1998)"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-73094-1_5","volume-title":"Petri Nets and Other Models of Concurrency \u2013 ICATPN 2007","author":"K. Wolf","year":"2007","unstructured":"Wolf, K.: Generating Petri Net State Spaces. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol.\u00a04546, pp. 29\u201342. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31131-4_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T10:34:19Z","timestamp":1743244459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31131-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311307","9783642311314"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31131-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}