{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:21:26Z","timestamp":1776316886345,"version":"3.50.1"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/lics.2019.8785796","type":"proceedings-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T01:15:55Z","timestamp":1565054155000},"page":"1-13","source":"Crossref","is-referenced-by-count":44,"title":["Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension"],"prefix":"10.1109","author":[{"given":"Jerome","family":"Leroux","sequence":"first","affiliation":[]},{"given":"Sylvain","family":"Schmitz","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","first-page":"123:1","article-title":"The complexity of downward closure comparisons","volume":"55","author":"zetzsche","year":"2016","journal-title":"Proc ICALP'J6 ser Leibniz Int Proc Inf"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47666-6_35"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.2307\/2272973"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14162-1_39"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90041-0"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(69)80011-5"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802201"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90173-D"},{"key":"ref15","author":"lasota","year":"2018","journal-title":"VASS reachability in three steps"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-6(3:22)2010"},{"key":"ref17","first-page":"214","article-title":"Vector addition systems reachability problem (A simpler solution)","volume":"10","author":"leroux","year":"2012","journal-title":"Turing-100 EPIC"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.16"},{"key":"ref19","author":"lipton","year":"1976","journal-title":"The reachability problem requires exponential space"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/2893582.2893585","article-title":"Automata column: The complexity of reachability in vector addition systems","volume":"3","author":"schmitz","year":"2016","journal-title":"ACM SIGLOG News"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00009-1"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2858784"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/800113.803630"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316369"},{"key":"ref29","author":"schmitz","year":"2017","journal-title":"Algorithmic complexity of well-quasi-orders"},{"key":"ref5","first-page":"119:1","article-title":"Unboundedness problems for languages of vector addition systems","volume":"107","author":"czerwi?ski","year":"2018","journal-title":"Proc ICALP'J8 ser LIPIcs"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2933577"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/359138.359142"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.14"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04081-8_25"},{"key":"ref1","first-page":"49:1","article-title":"On the upward\/downward closures of Petri nets","volume":"83","author":"atig","year":"2017","journal-title":"Proc MFCS’ 17 ser Leibniz Int Proc Inf"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF01967649","article-title":"Hierarchies of number-theoretic functions. I","volume":"13","author":"l\u00f6band","year":"1970","journal-title":"Arch Math Logic"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-15204-0_21"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802477"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(78)90036-1"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-53904-2_94"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11439-2_1"},{"key":"ref25","author":"reutenauer","year":"1990","journal-title":"The Mathematics of Petri Nets"}],"event":{"name":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Vancouver, BC, Canada","start":{"date-parts":[[2019,6,24]]},"end":{"date-parts":[[2019,6,27]]}},"container-title":["2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8765678\/8785654\/08785796.pdf?arnumber=8785796","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:20:37Z","timestamp":1658262037000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8785796\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/lics.2019.8785796","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}