{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T13:42:15Z","timestamp":1770298935386,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662476659","type":"print"},{"value":"9783662476666","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-47666-6_26","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T07:46:47Z","timestamp":1434700007000},"page":"324-336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00f4me","family":"Leroux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gr\u00e9goire","family":"Sutre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Totzke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"26_CR1","unstructured":"Atig, M.F., Ganty, P.: Approximating Petri net reachability along context-free traces. In: FSTTCS, pp. 152\u2013163 (2011)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Blondin, M., Finkel, A., G\u00f6ller, S., Haase, C., McKenzie, P.: Reachability in two-dimensional vector addition systems with states is PSPACE-complete. In: LICS (2015, to appear)","DOI":"10.1109\/LICS.2015.14"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0304-3975(02)00397-3","volume":"295","author":"A Bouajjani","year":"2003","unstructured":"Bouajjani, A., Habermehl, P., Mayr, R.: Automatic verification of recursive procedures with one integer parameter. TCS 295, 85\u2013106 (2003)","journal-title":"TCS"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/978-3-662-44522-8_19","volume-title":"Mathematical Foundations of Computer Science 2014","author":"J-B Courtois","year":"2014","unstructured":"Courtois, J.-B., Schmitz, S.: Alternating vector addition systems with states. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part I. LNCS, vol. 8634, pp. 220\u2013231. Springer, Heidelberg (2014)"},{"issue":"1","key":"26_CR5","first-page":"23","volume":"79","author":"S Demri","year":"2013","unstructured":"Demri, S., Jurdzinski, M., Lachish, O., Lazic, R.: The covering and boundedness problems for branching vector addition systems. JCSS 79(1), 23\u201338 (2013)","journal-title":"JCSS"},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"6:1","DOI":"10.1145\/2160910.2160915","volume":"34","author":"P Ganty","year":"2012","unstructured":"Ganty, P., Majumdar, R.: Algorithmic verification of asynchronous programs. ACM Trans. Progr. Lang. Syst. 34(1), 6:1\u20136:48 (2012)","journal-title":"ACM Trans. Progr. Lang. Syst."},{"issue":"2","key":"26_CR7","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas and languages. Pacific J. Math. 16(2), 285\u2013296 (1966)","journal-title":"Pacific J. Math."},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R.: Decidability of reachability in vector addition systems (preliminary version). In: STOC, pp. 267\u2013281 (1982)","DOI":"10.1145\/800070.802201"},{"key":"26_CR9","unstructured":"Lazic, R.: The reachability problem for vector addition systems with a stack is not elementary (2013). CoRR abs\/1310.1767"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Lazic, R., Schmitz, S.: Non-elementary complexities for branching VASS, MELL, and extensions. In: CSL\/LICS (2014)","DOI":"10.1145\/2603088.2603129"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Leroux, J.: Vector addition system reachability problem: a short self-contained proof. In: POPL, pp. 307\u2013316 (2011)","DOI":"10.1145\/1925844.1926421"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Leroux, J., Praveen, M., Sutre, G.: Hyper-ackermannian bounds for pushdown vector addition systems. In: CSL\/LICS (2014)","DOI":"10.1145\/2603088.2603146"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-540-28644-8_26","volume-title":"CONCUR 2004 - Concurrency Theory","author":"J Leroux","year":"2004","unstructured":"Leroux, J., Sutre, G.: On flatness for 2-dimensional vector addition systems with states. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 402\u2013416. Springer, Heidelberg (2004)"},{"key":"26_CR14","unstructured":"Leroux, J., Sutre, G., Totzke, P.: On the coverability problem for pushdown vector addition systems in one dimension. CoRR abs\/1503.04018, April 2015. http:\/\/arxiv.org\/abs\/http:\/\/arxiv.org\/abs\/1503.04018"},{"key":"26_CR15","unstructured":"Lipton, R.J.: The reachability problem requires exponential space. Tech. Rep. 63, Yale University, January 1976"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem. In: STOC, pp. 238\u2013246 (1981)","DOI":"10.1145\/800076.802477"},{"issue":"2","key":"26_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C Rackoff","year":"1978","unstructured":"Rackoff, C.: The covering and boundedness problems for vector addition systems. TCS 6(2), 223\u2013231 (1978)","journal-title":"TCS"},{"key":"26_CR18","first-page":"239","volume":"223","author":"K Reinhardt","year":"2008","unstructured":"Reinhardt, K.: Reachability in Petri nets with inhibitor arcs. ENTCS 223, 239\u2013264 (2008)","journal-title":"ENTCS"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47666-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T02:08:41Z","timestamp":1676945321000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47666-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476659","9783662476666"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47666-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}