{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T15:43:19Z","timestamp":1791214999807,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540676935","type":"print"},{"value":"9783540449881","type":"electronic"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44988-4_27","type":"book-chapter","created":{"date-parts":[[2007,8,1]],"date-time":"2007-08-01T01:38:07Z","timestamp":1185932287000},"page":"465-474","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":99,"title":["LoLA A Low Level Analyser"],"prefix":"10.1007","author":[{"given":"Karsten","family":"Schmidt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2000,6,9]]},"reference":[{"key":"27_CR1","unstructured":"A. Finkel. A minimal coverability graph for Petri nets. Proc. 11th International Conference on Application and Theory of Petri nets, pages 1\u201321, 1990."},{"key":"27_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, IEEE 1995, pages 130\u2013140, 1995.","DOI":"10.1109\/ISTCS.1995.377038"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"4","author":"R. M. Karp","year":"1969","unstructured":"R. M. Karp and R. E. Miller. Parallel programm schemata. Journ. Computer and System Sciences 4, pages 147\u2013195, 1969.","journal-title":"Journ. Computer and System Sciences"},{"key":"27_CR4","unstructured":"K. Schmidt. Symmetries of Petri nets. Informatik-Bericht 33, Humboldt-Universit\u00e4t zu Berlin, 1994."},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s002360050002","volume":"36","author":"K. Schmidt","year":"2000","unstructured":"K. Schmidt. How to calculate symmetries of Petri nets. Acta Informatica 36, pages 545\u2013590, 2000.","journal-title":"Acta Informatica"},{"key":"27_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/3-540-46419-0_22","volume-title":"Proc. 6th International Conference Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Schmidt","year":"2000","unstructured":"K. Schmidt. Integrating low level symmetries into reachability analysis. Proc. 6th International Conference Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1785, pages 315\u2013330, 2000."},{"key":"27_CR7","unstructured":"K. Schmidt. Stubborn sets for model checking the EF\/AG fragment of CTL. to appear in Fundamenta Informaticae, 2000."},{"key":"27_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/3-540-48745-X_4","volume-title":"20th International Conference on Application and Theory of Petri nets","author":"K. Schmidt","year":"1999","unstructured":"K. Schmidt. Stubborn sets for standard properties. 20th International Conference on Application and Theory of Petri nets, LNCS 1639, pages 46\u201365, 1999."},{"key":"27_CR9","unstructured":"A. Valmari. Error detection by reduced reachability graph generation. Proc. 9th European Workshop on Application and Theory of Petri Nets, 1988."},{"key":"27_CR10","first-page":"6","volume":"46","author":"A. Valmari","year":"1994","unstructured":"A. Valmari. State of the art report: Stubborn sets. Petri net Newsletter 46, pages 6\u201314, 1994.","journal-title":"Petri net Newsletter"},{"key":"27_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/3-540-57208-2_31","volume-title":"Proc. CONCUR","author":"B. Vergauwen","year":"1993","unstructured":"B. Vergauwen and J. Lewi. A linear local model checking algorithm for ctl. Proc. CONCUR, LNCS 715, pages 447\u2013461, 1993."}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets 2000"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44988-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T01:32:16Z","timestamp":1737336736000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-44988-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676935","9783540449881"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44988-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"9 June 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}