{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:15:30Z","timestamp":1787508930600,"version":"build-2736575974"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1987,4,1]],"date-time":"1987-04-01T00:00:00Z","timestamp":544233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1987,4]]},"DOI":"10.1016\/0020-0190(87)90089-5","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"27-33","source":"Crossref","is-referenced-by-count":25,"title":["An O(n1.5) algorithm to decide boundedness for conflict-free vector replacement systems"],"prefix":"10.1016","volume":"25","author":[{"given":"Rodney R.","family":"Howell","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Louis E.","family":"Rosier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hsu-Chun","family":"Yen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0020-0190(87)90089-5_BIB1","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\/0020-0190(87)90089-5_BIB2","series-title":"15th Ann. Symp. on Switching and Automata Theory","first-page":"156","article-title":"The recursive equivalence of the reachability problem and the liveness problem for Petri nets and vector addition systems","author":"Hack","year":"1974"},{"key":"10.1016\/0020-0190(87)90089-5_BIB3","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\/0020-0190(87)90089-5_BIB4","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 Informatica"},{"key":"10.1016\/0020-0190(87)90089-5_BIB5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","article-title":"Complete problems for deterministic polynomial time","volume":"3","author":"Jones","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(87)90089-5_BIB6","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0304-3975(77)90014-7","article-title":"Complexity of some problems in Petri nets","volume":"4","author":"Jones","year":"1977","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/0020-0190(87)90089-5_BIB7","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\/0020-0190(87)90089-5_BIB8","article-title":"Vector replacement systems: A formalism for modelling asynchronous systems","author":"Keller","year":"1972"},{"issue":"3","key":"10.1016\/0020-0190(87)90089-5_BIB9","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\/0020-0190(87)90089-5_BIB10","article-title":"The reachability problem requires exponential space","author":"Lipton","year":"1976"},{"key":"10.1016\/0020-0190(87)90089-5_BIB11","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","article-title":"The covering and boundedness problems for vector addition systems","volume":"6","author":"Rackoff","year":"1978","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/0020-0190(87)90089-5_BIB12","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. Comput. System Sci."},{"key":"10.1016\/0020-0190(87)90089-5_BIB13","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087900895?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087900895?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T05:53:44Z","timestamp":1553579624000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019087900895"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,4]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,4]]}},"alternative-id":["0020019087900895"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90089-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,4]]}}}