{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:22:48Z","timestamp":1762298568881,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032095237"},{"type":"electronic","value":"9783032095244"}],"license":[{"start":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T00:00:00Z","timestamp":1762300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T00:00:00Z","timestamp":1762300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-09524-4_9","type":"book-chapter","created":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:14:00Z","timestamp":1762290840000},"page":"126-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Box-Reachability in\u00a0Vector Addition Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9021-1175","authenticated-orcid":false,"given":"Shaull","family":"Almagor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Itay","family":"Hasson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7891-1988","authenticated-orcid":false,"given":"Micha\u0142","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Zaslavski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,5]]},"reference":[{"key":"9_CR1","unstructured":"Almagor, S., Cohen, N., P\u00e9rez, G.A., Shirmohammadi, M., Worrell, J.: Coverability in 1-VASS with disequality tests. In: 31st International Conference on Concurrency Theory (CONCUR 2020). Schloss-Dagstuhl-Leibniz Zentrum f\u00fcr Informatik (2020)"},{"key":"9_CR2","unstructured":"Almagor, S., Ghosh, A., Leys, T., P\u00e9rez, G.A.: The geometry of reachability in continuous vector addition systems with states. In: 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"issue":"5","key":"9_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3464794","volume":"68","author":"M Blondin","year":"2021","unstructured":"Blondin, M.: The reachability problem for two-dimensional vector addition systems with states. J. ACM (JACM) 68(5), 1\u201343 (2021)","journal-title":"J. ACM (JACM)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Blondin, M., Haase, C.: Logics for continuous reachability in petri nets and vector addition systems with states. In: 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2017), pp. 1\u201312. IEEE (2017)","DOI":"10.1109\/LICS.2017.8005068"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Cslovjecsek, J., Kouteck\u1ef3, M., Lassota, A., Pilipczuk, M., Polak, A.: Parameterized algorithms for block-structured integer programs with large entries. TheoretiCS 4 (2025)","DOI":"10.46298\/theoretics.25.15"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Czerwi\u0144ski, W., Orlikowski, \u0141.: Reachability in vector addition systems is Ackermann-complete. In: IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS 2021), pp. 1229\u20131240. IEEE (2022)","DOI":"10.1109\/FOCS52979.2021.00120"},{"issue":"5","key":"9_CR7","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.jcss.2013.01.014","volume":"79","author":"S Demri","year":"2013","unstructured":"Demri, S.: On selective unboundedness of VASS. J. Comput. Syst. Sci. 79(5), 689\u2013713 (2013)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF01086559","volume":"14","author":"VS Grinberg","year":"1980","unstructured":"Grinberg, V.S., Sevast\u2019yanov, S.V.: Value of the Steinitz constant. Funct. Anal. Appl. 14(2), 125\u2013126 (1980)","journal-title":"Funct. Anal. Appl."},{"key":"9_CR9","unstructured":"Guttenberg, R., Raskin, M., Esparza, J.: Geometry of reachability sets of vector addition systems. In: 34th International Conference on Concurrency Theory (CONCUR 2023). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"issue":"2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"J Hopcroft","year":"1979","unstructured":"Hopcroft, J., Pansiot, J.J.: On the reachability problem for 5-dimensional vector addition systems. Theor. Comput. Sci. 8(2), 135\u2013159 (1979)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"RM Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147\u2013195 (1969)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR12","unstructured":"K\u00fcnnemann, M., Mazowiecki, F., Sch\u00fctze, L., Sinclair-Banks, H., W\u0119grzycki, K.: Coverability in VASS revisited: improving Rackoff\u2019s bound to obtain conditional optimality. In: 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Leroux, J.: The reachability problem for Petri nets is not primitive recursive. In: IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS 2021), pp. 1241\u20131252. IEEE (2022)","DOI":"10.1109\/FOCS52979.2021.00121"},{"key":"9_CR14","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). https:\/\/doi.org\/10.1007\/978-3-540-28644-8_26"},{"issue":"2","key":"9_CR15","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. Theor. Comput. Sci. 6(2), 223\u2013231 (1978)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0022-0000(86)90006-1","volume":"32","author":"LE Rosier","year":"1986","unstructured":"Rosier, L.E., Yen, H.C.: A multiparameter analysis of the boundedness problem for vector addition systems. J. Comput. Syst. Sci. 32(1), 105\u2013135 (1986)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/2893582.2893585","volume":"3","author":"S Schmitz","year":"2016","unstructured":"Schmitz, S.: The complexity of reachability in vector addition systems. ACM SigLog News 3(1), 4\u201321 (2016)","journal-title":"ACM SigLog News"},{"issue":"1","key":"9_CR18","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BF01292722","volume":"7","author":"H Weyl","year":"1934","unstructured":"Weyl, H.: Elementare Theorie der konvexen Polyeder. Commentarii Mathematici Helvetici 7(1), 290\u2013306 (1934)","journal-title":"Commentarii Mathematici Helvetici"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09524-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:17:46Z","timestamp":1762298266000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09524-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,5]]},"ISBN":["9783032095237","9783032095244"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09524-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,11,5]]},"assertion":[{"value":"5 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rp25.software.imdea.org\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}