{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:21:27Z","timestamp":1776316887632,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1976,6,1]],"date-time":"1976-06-01T00:00:00Z","timestamp":202435200000},"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":13560,"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":[[1976,6]]},"DOI":"10.1016\/0304-3975(76)90008-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"77-95","source":"Crossref","is-referenced-by-count":78,"title":["The equality problem for vector addition systems is undecidable"],"prefix":"10.1016","volume":"2","author":[{"given":"Michel","family":"Hack","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(76)90008-6_BIB1","series-title":"Computation Structures Group Memo 79, Project MAC","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\/0304-3975(76)90008-6_BIB2_1","series-title":"Technical Report TR-94, Project MAC","article-title":"Analysis of production schemata by Petri nets","author":"Hack","year":"1972"},{"key":"10.1016\/0304-3975(76)90008-6_BIB2_2","series-title":"Computation Structures Note 17, Project MAC","article-title":"Analysis of production schemata by Petri nets","author":"Hack","year":"1974"},{"key":"10.1016\/0304-3975(76)90008-6_BIB3","series-title":"MAC Technical Memorandum 59, Project MAC","article-title":"Decision problems for Petri nets and vector addition systems","author":"Hack","year":"1975"},{"key":"10.1016\/0304-3975(76)90008-6_BIB4","doi-asserted-by":"crossref","DOI":"10.1109\/SWAT.1974.28","article-title":"The recursive equivalence of the reachability problem and the liveness problem for Petri nets and vector addition systems","author":"Hack","year":"1974","journal-title":"Proc. 15th Annual IEEE Symposium on Switching and Automata Theory"},{"key":"10.1016\/0304-3975(76)90008-6_BIB5","first-page":"253","article-title":"Mathematische Probleme. Vortrag, gehalten auf dem internationalen Mathematiker-Kongress zu Paris 1900","author":"Hilbert","year":"1900","journal-title":"Nachr. Akad. Wiss. G\u00f6ttingen Math.-Phys."},{"key":"10.1016\/0304-3975(76)90008-6_BIB6","series-title":"Technical Report RADC-TR-68-305","article-title":"Final report of the information systems theory project","author":"Holt","year":"1968"},{"key":"10.1016\/0304-3975(76)90008-6_BIB7","series-title":"Record of the Project MAC Conference on Concurrent Systems and Parallel Computation","first-page":"3","article-title":"Events and conditions","author":"Holt","year":"1970"},{"issue":"2","key":"10.1016\/0304-3975(76)90008-6_BIB8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","article-title":"Parallel program schemata: A mathematical model for parallel computation","volume":"3","author":"Karp","year":"1969","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(76)90008-6_BIB9","series-title":"TR 117","article-title":"Vector replacement systems: A formalism for modeling asynchronous systems","author":"Keller","year":"1972"},{"issue":"2","key":"10.1016\/0304-3975(76)90008-6_BIB10","first-page":"354","article-title":"Enumerable sets are diophantine","volume":"11","author":"Matijas'evi\u010d","year":"1970","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0304-3975(76)90008-6_BIB11","article-title":"Some relationships between various models of parallelism and synchronization","author":"Miller","year":"1974","journal-title":"IBM Research report RC-5074"},{"key":"10.1016\/0304-3975(76)90008-6_BIB12","doi-asserted-by":"crossref","first-page":"292","DOI":"10.2307\/2318455","article-title":"Reachability problems in vector addition systems","volume":"80","author":"Nash","year":"1973","journal-title":"Am. Math. Monthly"},{"key":"10.1016\/0304-3975(76)90008-6_BIB13","series-title":"Kommunikation mit Automaten","author":"Petri","year":"1962"},{"key":"10.1016\/0304-3975(76)90008-6_BIB14","unstructured":"M. Rabin, Private communication, Fall 1972"},{"key":"10.1016\/0304-3975(76)90008-6_BIB15","first-page":"303","article-title":"A partial solution to the reachability problem for vector addition systems","author":"van Leeuwen","year":"1974","journal-title":"6th Annual ACM Symposium on Theory of Computing"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900086?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900086?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:20:57Z","timestamp":1555111257000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397576900086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,6]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,6]]}},"alternative-id":["0304397576900086"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(76)90008-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1976,6]]}}}