{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T07:00:26Z","timestamp":1779087626848,"version":"3.51.4"},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"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":7716,"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":[[1992,6]]},"DOI":"10.1016\/0304-3975(92)90173-d","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"79-104","source":"Crossref","is-referenced-by-count":81,"title":["A structure to decide reachability in Petri nets"],"prefix":"10.1016","volume":"99","author":[{"given":"J.L.","family":"Lambert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90173-D_BIB1","series-title":"Les Langages Alg\u00e9briques","author":"Autebert","year":"1987"},{"issue":"8","key":"10.1016\/0304-3975(92)90173-D_BIB2","doi-asserted-by":"crossref","DOI":"10.1145\/359138.359142","article-title":"Proving termination with multiset ordering","volume":"22","author":"Dershowitz","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(92)90173-D_BIB3","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0304-3975(92)90173-D_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."},{"issue":"1","key":"10.1016\/0304-3975(92)90173-D_BIB5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1051\/ita\/1979130100191","article-title":"On the hierarchy of Petri net languages","volume":"13","author":"Jantzen","year":"1979","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(92)90173-D_BIB6","first-page":"147","article-title":"Parallel program schemata","volume":"3","author":"Karp","year":"1969","journal-title":"J. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90173-D_BIB7","first-page":"267","article-title":"Decidability of reachability in vector addition systems","author":"Kosaraju","year":"1982","journal-title":"Proc. 14th Ann. ACM STOC"},{"issue":"3","key":"10.1016\/0304-3975(92)90173-D_BIB8","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0898-1221(88)90172-1","article-title":"Finding a partial solution to a linear system of equations in positive integers","volume":"15","author":"Lambert","year":"1988","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/0304-3975(92)90173-D_BIB9","article-title":"Combinatorics on words","volume":"Vol. 17","author":"Lothaire","year":"1983"},{"issue":"3","key":"10.1016\/0304-3975(92)90173-D_BIB10_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\/0304-3975(92)90173-D_BIB10_2","first-page":"238","article-title":"An algorithm for the general Petri net reachability problem","author":"Mayr","year":"1981","journal-title":"Proc. 13th Ann. ACM STOC"},{"key":"10.1016\/0304-3975(92)90173-D_BIB11","series-title":"Advances in Petri nets 1984","first-page":"376","article-title":"The reachability problem for VAS","volume":"Vol. 188","author":"Muller","year":"1984"},{"key":"10.1016\/0304-3975(92)90173-D_BIB12","series-title":"Advances in Petri nets 1985","first-page":"346","article-title":"A logical formalism for the study of the finite behaviour of Petri nets","volume":"Vol. 222","author":"Parigot","year":"1985"},{"key":"10.1016\/0304-3975(92)90173-D_BIB13","series-title":"Petri Net Theory and the Modeling of Systems","author":"Peterson","year":"1981"},{"key":"10.1016\/0304-3975(92)90173-D_BIB14","series-title":"Kommunikation mit Automaten","author":"Petri","year":"1962"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290173D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290173D?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:58:21Z","timestamp":1555113501000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290173D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["030439759290173D"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90173-d","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}