{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T21:51:01Z","timestamp":1672696261603},"reference-count":38,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"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":7471,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1993,2]]},"DOI":"10.1016\/0022-0000(93)90046-y","type":"journal-article","created":{"date-parts":[[2004,1,6]],"date-time":"2004-01-06T10:48:13Z","timestamp":1073386093000},"page":"1-26","source":"Crossref","is-referenced-by-count":20,"title":["Normal and sinkless petri nets"],"prefix":"10.1016","volume":"46","author":[{"given":"Rodney R.","family":"Howell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louis E.","family":"Rosier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsu-Chun","family":"Yen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(93)90046-Y_BIB1","article-title":"Rabin's Proof of the Undecidability of the Reachability Set Inclusion Problem of Vector Addition Systems","author":"Baker","year":"1973"},{"key":"10.1016\/0022-0000(93)90046-Y_BIB2","first-page":"299","article-title":"Bounds on positive integral solutions of linear Diophantine equations","volume":"55","author":"Borosh","year":"1976"},{"key":"10.1016\/0022-0000(93)90046-Y_BIB3","series-title":"Proceedings, 8th Annual ACM Symposium on Theory of Computing","first-page":"50","article-title":"Exponential space complete problems for Petri nets and commutative semigroups","author":"Cardoza","year":"1976"},{"key":"10.1016\/0022-0000(93)90046-Y_BIB4","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\/0022-0000(93)90046-Y_BIB5","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\/0022-0000(93)90046-Y_BIB6","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":"Ginsburg","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(93)90046-Y_BIB7","article-title":"Petri Net Languages","author":"Hack","year":"1975"},{"key":"10.1016\/0022-0000(93)90046-Y_BIB8","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\/0022-0000(93)90046-Y_BIB9","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":"Hopcroet","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(93)90046-Y_BIB10","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0022-0000(88)90013-X","article-title":"Completeness results for conflict-free vector replacement systems","volume":"37","author":"Howell","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(93)90046-Y_BIB11","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(89)90053-4","article-title":"Problems concerning fairness and temporal logic for conflict-free Petri nets","volume":"64","author":"Howell","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(93)90046-Y_BIB12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0304-3975(86)90026-5","article-title":"Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states","volume":"46","author":"Howell","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(93)90046-Y_BIB13","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0020-0190(87)90089-5","article-title":"An O(n1) algorithm to decide boundedness for conflict-free vector replacement systems","volume":"25","author":"Howell","year":"1987","journal-title":"Inform. Process Lett."},{"key":"10.1016\/0022-0000(93)90046-Y_BIB14","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcropt","year":"1979"},{"key":"10.1016\/0022-0000(93)90046-Y_BIB15","first-page":"291","article-title":"The complexity of semilinear sets","volume":"18","author":"Huynh","year":"1982","journal-title":"Elektron. Inform. Kybernet."},{"key":"10.1016\/0022-0000(93)90046-Y_BIB16","series-title":"Proceedings, 17th Annual ACM Symposium 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\/0022-0000(93)90046-Y_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. Inform. Kybernet."},{"key":"10.1016\/0022-0000(93)90046-Y_BIB18","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."},{"key":"10.1016\/0022-0000(93)90046-Y_BIB19","series-title":"Theorie der Endlichen and Unendlichen Graphen","author":"K\u00f6nig","year":"1936"},{"key":"10.1016\/0022-0000(93)90046-Y_BIB20","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\/0022-0000(93)90046-Y_BIB21","series-title":"Proceedings, 14th Annual ACM Symposium on Theory of Computing","first-page":"267","article-title":"Decidability of reachability in vector addition systems","author":"Kosaraju","year":"1982"},{"key":"10.1016\/0022-0000(93)90046-Y_BIB22","series-title":"Theoret. Comput. Sci.","first-page":"451","article-title":"Consequences of the decidability of the reachability problem for Petri nets","author":"Lambert","year":"1987"},{"key":"10.1016\/0022-0000(93)90046-Y_BIB23","article-title":"The Reachability Problem Requires Exponential Space","author":"Lipton","year":"1976"},{"key":"10.1016\/0022-0000(93)90046-Y_BIB24","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. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(93)90046-Y_BIB25","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/978-3-7091-8596-4_6","article-title":"On the reachability problem for persistent vector replacement systems","volume":"3","author":"Moller","year":"1981","journal-title":"Computing Suppl."},{"key":"10.1016\/0022-0000(93)90046-Y_BIB26","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."},{"key":"10.1016\/0022-0000(93)90046-Y_BIB27_1","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\/0022-0000(93)90046-Y_BIB27_2","series-title":"13th Annual Symposium on Theory of Computing","year":"1981"},{"key":"10.1016\/0022-0000(93)90046-Y_BIB28","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. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(93)90046-Y_BIB29","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. in Math."},{"key":"10.1016\/0022-0000(93)90046-Y_BIB30","series-title":"Petri Net Theory and the Modeling of Systems","author":"Peterson","year":"1981"},{"key":"10.1016\/0022-0000(93)90046-Y_BIB31","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."},{"key":"10.1016\/0022-0000(93)90046-Y_BIB32","series-title":"Petri Nets: An Introduction","author":"Reisig","year":"1985"},{"key":"10.1016\/0022-0000(93)90046-Y_BIB33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(93)90046-Y_BIB34","series-title":"Convexity and Optimization in Finite Dimensions 1","author":"Stoer","year":"1970"},{"key":"10.1016\/0022-0000(93)90046-Y_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":"No. 1","key":"10.1016\/0022-0000(93)90046-Y_BIB36","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1090\/S0002-9939-1978-0500555-0","article-title":"A bound on solutions of linear integer equalities and inequalities","volume":"72","author":"von zur Gathen","year":"1978","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0022-0000(93)90046-Y_BIB37","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0304-3975(84)90038-0","article-title":"Normal Petri nets","volume":"31","author":"Yamasaki","year":"1984","journal-title":"Theoret. Comput. Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390046Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390046Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T19:23:39Z","timestamp":1550258619000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009390046Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["002200009390046Y"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(93)90046-y","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}