{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:37:37Z","timestamp":1720201057191},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":10059,"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":[[1986]]},"DOI":"10.1016\/0304-3975(86)90026-5","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"107-140","source":"Crossref","is-referenced-by-count":22,"special_numbering":"C","title":["Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states"],"prefix":"10.1016","volume":"46","author":[{"given":"Rodney R.","family":"Howell","sequence":"first","affiliation":[]},{"given":"Louis E.","family":"Rosier","sequence":"additional","affiliation":[]},{"given":"Dung T.","family":"Huynh","sequence":"additional","affiliation":[]},{"given":"Hsu-Chun","family":"Yen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(86)90026-5_BIB1","series-title":"Proc. 16th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"169","article-title":"Computational complexity of decision procedures for polynomials","author":"Adleman","year":"1975"},{"key":"10.1016\/0304-3975(86)90026-5_BIB2","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(86)90026-5_BIB3","first-page":"299","article-title":"Bounds on positive integral solutions of linear Diophantine equations","volume":"55","author":"Borosh","year":"1976"},{"issue":"1","key":"10.1016\/0304-3975(86)90026-5_BIB4","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/0304-3975(86)90026-5_BIB5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0304-3975(86)90169-6","article-title":"The finite containment problem for Petri nets","volume":"43","author":"Clote","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90026-5_BIB6","series-title":"Proc. 8th Ann. ACM Symp. on Theory of Computing","first-page":"50","article-title":"Exponential space complete problems for Petri nets and commutative semigroups","author":"Cardoza","year":"1976"},{"issue":"3","key":"10.1016\/0304-3975(86)90026-5_BIB7","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/0020-0190(75)90020-4","article-title":"A decidability theorem for a class of vector addition systems","volume":"3","author":"Crespi-Reghizzi","year":"1975","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(86)90026-5_BIB8","first-page":"323","article-title":"Hilbert's tenth problem. Diophantine equations: Positive aspects of a negative solution","volume":"28","author":"Davis","year":"1976"},{"issue":"1","key":"10.1016\/0304-3975(86)90026-5_BIB9","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0020-0190(80)90026-5","article-title":"The decidability of persistence for vector addition systems","volume":"11","author":"Grabowski","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(86)90026-5_BIB10","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0022-0000(80)90009-4","article-title":"Vector addition systems and regular languages","volume":"20","author":"Ginzburg","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(86)90026-5_BIB11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(76)90008-6","article-title":"The equality problem for vector addition systems is undecidable","volume":"2","author":"Hack","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90026-5_BIB12","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(86)90026-5_BIB13","first-page":"291","article-title":"The complexity of semilinear sets","volume":"18","author":"Huynh","year":"1982","journal-title":"Elektron. Informationsverarb. Kybernet."},{"key":"10.1016\/0304-3975(86)90026-5_BIB14","series-title":"Proc. 17th Ann. ACM Symp. on Theory of Computing","first-page":"405","article-title":"The complexity of the equivalence problem for commutative semigroups and symmetric vector addition systems","author":"Huynh","year":"1985"},{"key":"10.1016\/0304-3975(86)90026-5_BIB15","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF00288776","article-title":"Complexity of the word problem for commutative semigroups of fixed dimension","volume":"22","author":"Huynh","year":"1985","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(86)90026-5_BIB16","doi-asserted-by":"crossref","unstructured":"D. Huynh, The complexity of the membership problem for two subclasses of polynomial ideals, SIAM J. on Comput., to appear.","DOI":"10.1137\/0215042"},{"key":"10.1016\/0304-3975(86)90026-5_BIB17","first-page":"147","article-title":"A simple proof for the \u03a32P upper bound of the inequivalence problem for semilinear sets","volume":"22","author":"Huynh","year":"1986","journal-title":"Elektron. Informationsverarb. Kybernet."},{"issue":"2","key":"10.1016\/0304-3975(86)90026-5_BIB18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF01744435","article-title":"A note on the complexity of program evaluation","volume":"17","author":"Ibarra","year":"1984","journal-title":"Math. Systems Theory"},{"issue":"2","key":"10.1016\/0304-3975(86)90026-5_BIB19","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. System Sci."},{"key":"10.1016\/0304-3975(86)90026-5_BIB20","series-title":"Proc. 14th Ann. ACM Symp. on Theory of Computing","first-page":"267","article-title":"Decidability of reachability in vector addition systems","author":"Kosaraju","year":"1982"},{"key":"10.1016\/0304-3975(86)90026-5_BIB21","article-title":"The reachability problem requires exponential space","author":"Lipton","year":"1976"},{"issue":"3","key":"10.1016\/0304-3975(86)90026-5_BIB22","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1145\/322077.322079","article-title":"Properties of conflict-free and persistent Petri nets","volume":"25","author":"Landweber","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(86)90026-5_BIB23","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF00289268","article-title":"Persistence of vector replacement systems is decidable","volume":"15","author":"Mayr","year":"1981","journal-title":"Acta Inform."},{"issue":"3","key":"10.1016\/0304-3975(86)90026-5_BIB24","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."},{"key":"10.1016\/0304-3975(86)90026-5_BIB25","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0304-3975(84)90029-X","article-title":"Petri nets and large finite sets","volume":"32","author":"McAloon","year":"1984","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/0304-3975(86)90026-5_BIB26","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1145\/322261.322271","article-title":"The complexity of the finite containment problem for Petri nets","volume":"28","author":"Mayr","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(86)90026-5_BIB27","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":"Advances in Mathematics"},{"key":"10.1016\/0304-3975(86)90026-5_BIB28","series-title":"Proc. 9th Symp. on Mathematical Foundations of Computer Science","first-page":"426","article-title":"Decidability of reachability in persistent vector replacement systems","volume":"88","author":"Muller","year":"1980"},{"key":"10.1016\/0304-3975(86)90026-5_BIB29","unstructured":"H. Muller, Weak Petri net computers for Ackermann functions, Elektron. Informationsverarb. Kybernet., to appear."},{"issue":"1","key":"10.1016\/0304-3975(86)90026-5_BIB30","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0022-0000(86)90006-1","article-title":"A multiparameter analysis of the boundedness problem for vector addition systems","volume":"32","author":"Rosier","year":"1986","journal-title":"J. of Comput. System Sci."},{"key":"10.1016\/0304-3975(86)90026-5_BIB31","series-title":"Proc. 3rd Ann. Symp. on Theoretical Aspects of Computer Science","first-page":"306","article-title":"Logspace hierarchies, polynomial time and the complexity of fairness problems concerning \u03c9-machines","volume":"210","author":"Rosier","year":"1986"},{"key":"10.1016\/0304-3975(86)90026-5_BIB32","series-title":"Proc. 13th Internat. Coll. on Automata, Languages and Programming","first-page":"334","article-title":"On the complexity of deciding fair termination of probabilistic concurrent finite-state programs","author":"Rosier","year":"1986"},{"key":"10.1016\/0304-3975(86)90026-5_BIB33","series-title":"Convexity and Optimization in Finite Dimensions, Part I","author":"Stoer","year":"1970"},{"key":"10.1016\/0304-3975(86)90026-5_BIB34","series-title":"Proc. 6th Ann. ACM Symp. on Theory of Computing","first-page":"303","article-title":"A partial solution to the reachability problem for vector addition systems","author":"van Leeuwen","year":"1974"},{"key":"10.1016\/0304-3975(86)90026-5_BIB35","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0022-0000(81)90067-2","article-title":"Petri nets and regular languages","volume":"23","author":"Valk","year":"1981","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/0304-3975(86)90026-5_BIB36","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0020-0190(81)90117-4","article-title":"On weak persistency of Petri nets","volume":"13","author":"Yamasaki","year":"1981","journal-title":"Inform. Process. Lett."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900265?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900265?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T20:53:44Z","timestamp":1553201624000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586900265"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":36,"alternative-id":["0304397586900265"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90026-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}