{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T22:34:24Z","timestamp":1784241264985,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540661320","type":"print"},{"value":"9783540487456","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48745-x_4","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T04:12:59Z","timestamp":1193458379000},"page":"46-65","source":"Crossref","is-referenced-by-count":29,"title":["Stubborn Sets for Standard Properties"],"prefix":"10.1007","author":[{"given":"Karsteb","family":"Schmidt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2003,4,18]]},"reference":[{"key":"4_CR1","unstructured":"A. Finkel. A minimal coverability graph for Petri nets. Proc. of the 11th Int. Conf. Application and Theory of Petri Nets, pages 1\u201321, 1990."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"R.. Gerth, R. Kuiper, D. Peled, and W. Penczek. A partial order approach to branching time logic model checking. 3rd Israel Symp. on the Theory of Computing and Systems, IEE 1995, pages 130\u2013140, 1995.","DOI":"10.1109\/ISTCS.1995.377038"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"P. Godefroid and P. Wolper. A partial approach to model checking. 6th IEEE Symp. on Logic in Computer Science, Amsterdam, pages 406\u2013415, 1991.","DOI":"10.1109\/LICS.1991.151664"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"R. M. Karp and R. E. Miller. Parallel program schemata. Journ. Computer and System Sciences 4, pages 147\u2013195, May 1969.","DOI":"10.1016\/S0022-0000(69)80011-5"},{"key":"4_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/3-540-63166-6_33","volume-title":"9th Int. Conf. Computer Aided Verification","author":"I. Kokkarinen","year":"1997","unstructured":"I. Kokkarinen, D. Peled, and A. Valmari. Relaxed visibility enhances partial order reduction. 9th Int. Conf. Computer Aided Verification, LNCS 1254, pages 328\u2013339, 1997."},{"key":"4_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"5th Int. Conf. Computer Aided Verification","author":"D. Peled","year":"1993","unstructured":"D. Peled. All from one, one for all: on model-checking using representatives. 5th Int. Conf. Computer Aided Verification, LNCS 697, pages 409\u2013423, 1993."},{"key":"4_CR7","series-title":"Technical Report","volume-title":"INA Integrierter Netz Analysator Version 2.1","author":"S. Roch","year":"1998","unstructured":"S. Roch and P. Starcke. INA Integrierter Netz Analysator Version 2.1. Technical Report 12, Humboldt-Uneversit\u00e4t zu Berlin, 1998."},{"key":"4_CR8","unstructured":"P. Starke. Private communication, 1998."},{"key":"4_CR9","unstructured":"A. Valmari. Error detection by reduced reachability graph generation. 9th European Workshop on Application and Theory of Petri Nets, pages 95\u2013112, 1988."},{"key":"4_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/3-540-53863-1_36","volume-title":"Advances in Petri Nets 1990","author":"A. Valmari","year":"1991","unstructured":"A. Valmari. Stubborn sets for reduced state space generation. Advances in Petri Nets 1990, LNCS 483, pages 491\u2013511, 1991."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"A. Valmari. A stubborn attack on state explosion. Formal methods in System Design 1, pages 297\u2013322, 1992.","DOI":"10.1007\/BF00709154"},{"key":"4_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/3-540-56922-7_33","volume-title":"5th Int. Cinf. Computer Aided Verification","author":"A. Valmari","year":"1993","unstructured":"A. Valmari. On-the-fly verification with stubborn sets. 5th Int. Cinf. Computer Aided Verification, LNCS 697, pages 397\u2013408, 1993."},{"key":"4_CR13","unstructured":"A. Valmari. State of the art report: stubborn sets. Petri Net Newsletter 46, pages 6\u201314, 1994."},{"key":"4_CR14","unstructured":"A. Valmari. Stubborn set methods for process algebras. Workshop on Partial order Methods in Verification, Princeton, pages 192\u2013210, 1996."},{"key":"4_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","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":"A. Valmari. The state explosion problem. Lectures on Petri Nets I: Basic Models, LNCS 1491, pages 429\u2013528, 1998."},{"key":"4_CR16","unstructured":"K. Varpaaniemi. Private communication, 1993."},{"key":"4_CR17","unstructured":"K. Varpaaniemi. On the stubborn set method in reduced state space generation. PhD thesis, Helsinki Uneversity of Technology, 1998."},{"key":"4_CR18","unstructured":"K. Varpaaniemi. Private Communication, 1998."}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets 1999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48745-X_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:09:36Z","timestamp":1556921376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48745-X_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540661320","9783540487456"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-48745-x_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}