{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T06:31:44Z","timestamp":1794378704704,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642141614","type":"print"},{"value":"9783642141621","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14162-1_39","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T05:26:21Z","timestamp":1278307581000},"page":"466-477","source":"Crossref","is-referenced-by-count":10,"title":["The Downward-Closure of Petri Net Languages"],"prefix":"10.1007","author":[{"given":"Peter","family":"Habermehl","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roland","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Harro","family":"Wimmel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"39_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/B:FORM.0000033962.51898.1a","volume":"25","author":"P.A. Abdulla","year":"2004","unstructured":"Abdulla, P.A., Collomb-Annichini, A., Bouajjani, A., Jonsson, B.: Using forward reachability analysis for verification of lossy channel systems. Form. Methods Syst. Des.\u00a025(1), 39\u201365 (2004)","journal-title":"Form. Methods Syst. Des."},{"key":"39_CR2","first-page":"178","volume":"44","author":"B. Courcelle","year":"1991","unstructured":"Courcelle, B.: On constructing obstruction sets of words. Bulletin of the EATCS\u00a044, 178\u2013186 (1991)","journal-title":"Bulletin of the EATCS"},{"key":"39_CR3","unstructured":"Hack, M.: Decidability questions for Petri nets. Technical report, Cambridge, MA, USA (1976)"},{"issue":"3","key":"39_CR4","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G. Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc.\u00a02(3), 326\u2013336 (1952)","journal-title":"Proc. London Math. Soc."},{"issue":"2","key":"39_CR5","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R.M. Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci.\u00a03(2), 147\u2013195 (1969)","journal-title":"J. Comput. Syst. Sci."},{"key":"39_CR6","first-page":"267","volume-title":"STOC","author":"S.R. Kosaraju","year":"1982","unstructured":"Kosaraju, S.R.: Decidability of reachability in vector addition systems (preliminary version). In: STOC, pp. 267\u2013281. ACM, New York (1982)"},{"issue":"3","key":"39_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0898-1221(88)90172-1","volume":"15","author":"J.L. Lambert","year":"1988","unstructured":"Lambert, J.L.: Finding a partial solution to a linear system of equations in positive integers. Comput. Math. Applic.\u00a015(3), 209\u2013212 (1988)","journal-title":"Comput. Math. Applic."},{"issue":"1","key":"39_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0304-3975(92)90173-D","volume":"99","author":"J.L. Lambert","year":"1992","unstructured":"Lambert, J.L.: A structure to decide reachability in Petri nets. Theor. Comp. Sci.\u00a099(1), 79\u2013104 (1992)","journal-title":"Theor. Comp. Sci."},{"key":"39_CR9","first-page":"238","volume-title":"STOC","author":"E.W. Mayr","year":"1981","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem. In: STOC, pp. 238\u2013246. ACM, New York (1981)"},{"issue":"3","key":"39_CR10","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E.W. Mayr","year":"1984","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM J. Comp.\u00a013(3), 441\u2013460 (1984)","journal-title":"SIAM J. Comp."},{"issue":"1-3","key":"39_CR11","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0304-3975(02)00646-1","volume":"297","author":"R. Mayr","year":"2003","unstructured":"Mayr, R.: Undecidable problems in unreliable computations. Theor. Comp. Sci.\u00a0297(1-3), 337\u2013354 (2003)","journal-title":"Theor. Comp. Sci."},{"issue":"3","key":"39_CR12","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1145\/356698.356702","volume":"9","author":"J.L. Peterson","year":"1977","unstructured":"Peterson, J.L.: Petri nets. ACM Computing Surveys\u00a09(3), 223\u2013252 (1977)","journal-title":"ACM Computing Surveys"},{"key":"39_CR13","volume-title":"Petri-Netze","author":"L. Priese","year":"2003","unstructured":"Priese, L., Wimmel, H.: Petri-Netze. Springer, Heidelberg (2003)"},{"key":"39_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/978-3-540-27793-4_24","volume-title":"Applications and Theory of Petri Nets 2004","author":"H. Wimmel","year":"2004","unstructured":"Wimmel, H.: Infinity of intermediate states is decidable for Petri nets. In: Cortadella, J., Reisig, W. (eds.) ICATPN 2004. LNCS, vol.\u00a03099, pp. 426\u2013434. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14162-1_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:37:01Z","timestamp":1558280221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14162-1_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141614","9783642141621"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14162-1_39","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-14162-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}