{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T04:46:26Z","timestamp":1726029986652},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319961538"},{"type":"electronic","value":"9783319961545"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-319-96154-5_21","type":"book-chapter","created":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T13:09:17Z","timestamp":1558703357000},"page":"161-169","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Inductive Counting and the Reachability Problem for Petri Nets"],"prefix":"10.1007","author":[{"given":"Peter","family":"Chini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,25]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"W. Czerwinski, S. Lasota, R. Lazic, J. Leroux, F. Mazowiecki, The reachability problem for Petri nets is not elementary (extended abstract). CoRR, abs\/1809.07115. arXiv:1809.07115 (2018)","DOI":"10.1145\/3313276.3316369"},{"key":"21_CR2","volume-title":"Unfoldings - A Partial-Order Approach to Model Checking","author":"J Esparza","year":"2008","unstructured":"J. Esparza, K. Heljanko. Unfoldings - A Partial-Order Approach to Model Checking (Springer, Berlin, 2008)"},{"issue":"5","key":"21_CR3","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0217058","volume":"17","author":"N Immerman","year":"1988","unstructured":"N. Immerman, Nondeterministic space is closed under complementation. SIAM J. Comput. 17(5), 935\u2013938 (1988)","journal-title":"SIAM J. Comput."},{"key":"21_CR4","unstructured":"R.J. Lipton, The reachability problem requires exponential space. Technical Report 62, Yale University, 1976"},{"key":"21_CR5","unstructured":"R.J. Lipton, K.W. Regan, We all guessed wrong. G\u00f6del\u2019s lost letter and P = NP (2009). https:\/\/rjlipton.wordpress.com\/2009\/02\/19\/we-all-guessed-wrong\/"},{"key":"21_CR6","unstructured":"R.J. Lipton, K.W. Regan, An EXPSPACE lower bound G\u00f6del\u2019s lost letter and P = NP (2009). https:\/\/rjlipton.wordpress.com\/2009\/04\/08\/an-expspace-lower-bound\/"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"E.W. Mayr, An algorithm for the general Petri net reachability problem. in STOC (ACM, New York, 1981), pp. 238\u2013246","DOI":"10.1145\/800076.802477"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-14295-6_19","volume-title":"Computer Aided Verification","author":"Roland Meyer","year":"2010","unstructured":"R. Meyer, T. Strazny, Petruchio: from dynamic networks to nets, in CAV, ed. by T. Touili, B. Cook, P. Jackson. Lecture Notes in Computer Science, vol. 6174 (Springer, Berlin, 2010), pp. 175\u2013179"},{"key":"21_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri Nets: An Introduction","author":"W Reisig","year":"1985","unstructured":"W. Reisig, Petri Nets: An Introduction (Springer, Berlin, 1985)"},{"key":"21_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-09262-9","volume-title":"Analyse von Petri-Netz-Modellen","author":"PH Starke","year":"1990","unstructured":"P.H. Starke, Analyse von Petri-Netz-Modellen (Teubner, Leipzig, 1990)"},{"issue":"3","key":"21_CR11","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF00299636","volume":"26","author":"R Szelepcs\u00e9nyi","year":"1988","unstructured":"R. Szelepcs\u00e9nyi, The method of forced enumeration for nondeterministic automata. Acta Inform. 26(3), 279\u2013284 (1988)","journal-title":"Acta Inform."}],"container-title":["Carl Adam Petri: Ideas, Personality, Impact"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96154-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T09:28:59Z","timestamp":1574760539000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96154-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783319961538","9783319961545"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96154-5_21","relation":{},"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"25 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}