{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:18:37Z","timestamp":1648865917683},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8843,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1989,5]]},"DOI":"10.1016\/0304-3975(89)90055-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"343-350","source":"Crossref","is-referenced-by-count":3,"title":["Projections of vector addition system reachability sets are semilinear"],"prefix":"10.1016","volume":"64","author":[{"given":"Hans","family":"Kleine B\u00fcning","sequence":"first","affiliation":[]},{"given":"Theodor","family":"Lettmann","sequence":"additional","affiliation":[]},{"given":"Ernst W.","family":"Mayr","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90055-8_BIB1","article-title":"Rabin's proof of the undecidability of the reachability set inclusion problem of vector addition systems","author":"Baker","year":"1973","journal-title":"MIT Project MAC, CSGM 79"},{"key":"10.1016\/0304-3975(89)90055-8_BIB2","doi-asserted-by":"crossref","first-page":"413","DOI":"10.2307\/2370405","article-title":"Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors","volume":"35","author":"Dickson","year":"1913","journal-title":"Amer. J. Math."},{"key":"10.1016\/0304-3975(89)90055-8_BIB3","article-title":"Decidability questions for Petri nets","author":"Hack","year":"1976","journal-title":"MIT, LCS, TR 161"},{"key":"10.1016\/0304-3975(89)90055-8_BIB4","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","article-title":"On the reachability problem for 5-dimensional vector addition systems","volume":"8","author":"Hopcroft","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90055-8_BIB5","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","article-title":"Parallel program schemata","volume":"3","author":"Karp","year":"1969","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/0304-3975(89)90055-8_BIB6","series-title":"Tech. Report 62","article-title":"The reachability problem is exponential-space-hard","author":"Lipton","year":"1976"},{"issue":"3","key":"10.1016\/0304-3975(89)90055-8_BIB7","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1137\/0213029","article-title":"An algorithm for the general Petri net reachability problem","volume":"13","author":"Mayr","year":"1984","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/0304-3975(89)90055-8_BIB8","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0001-8708(82)90048-2","article-title":"The complexity of the word problems for commutative semigroups and polynomial ideals","volume":"46","author":"Mayr","year":"1982","journal-title":"Adv. Math."},{"key":"10.1016\/0304-3975(89)90055-8_BIB9","first-page":"92","article-title":"\u00dcber die Vollst\u00e4ndigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt","author":"Presburger","year":"1930","journal-title":"Comptes Rendus du I. Congr\u00e8s des Math\u00e9maticiens des Pays Slavs"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900558?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900558?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:55:40Z","timestamp":1555113340000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589900558"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["0304397589900558"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90055-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}