{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T07:33:59Z","timestamp":1672385639343},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,4,1]],"date-time":"1989-04-01T00:00:00Z","timestamp":607392000000},"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":8873,"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":[[1989,4]]},"DOI":"10.1016\/0304-3975(89)90098-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"67-81","source":"Crossref","is-referenced-by-count":10,"title":["Semi-commutations and Petri nets"],"prefix":"10.1016","volume":"64","author":[{"given":"Dang","family":"Van Hung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"El\u00f6d","family":"Knuth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90098-4_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(88)90051-5","article-title":"Theory of traces","volume":"60","author":"Aalbersberg","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90098-4_BIB2","first-page":"146","article-title":"A hierarchy of regular trace languages and some combinatorial applications","author":"Bertoni","year":"1982","journal-title":"Proc. 2nd World Conf. on Math. at the Service of Men"},{"key":"10.1016\/0304-3975(89)90098-4_BIB3","series-title":"Seminar on Concurrency","first-page":"221","article-title":"Concurrent behaviour: sequences, processes and axioms","volume":"197","author":"Best","year":"1985"},{"key":"10.1016\/0304-3975(89)90098-4_BIB4","article-title":"Net Theory and Applications","volume":"84","year":"1980"},{"key":"10.1016\/0304-3975(89)90098-4_BIB5","first-page":"89","article-title":"The Specification of Process Synchronization by Path Expressions","volume":"16","author":"Campbell","year":"1974"},{"key":"10.1016\/0304-3975(89)90098-4_BIB6","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0890-5401(87)90040-X","article-title":"Semi-commutations","volume":"73","author":"Clerbout","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(89)90098-4_BIB7","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(86)90094-0","article-title":"Mixed product and asynchronous automata","volume":"48","author":"Duboc","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90098-4_BIB8","first-page":"51","article-title":"Petri nets and regular trace languages","author":"Knuth","year":"1979","journal-title":"Proc. 1st European Conf. Parallel and Distributed Processing"},{"key":"10.1016\/0304-3975(89)90098-4_BIB9","series-title":"DAIMI Report PB-78","article-title":"Concurrent program schemes and their interpretations","author":"Mazurkiewicz","year":"1977"},{"key":"10.1016\/0304-3975(89)90098-4_BIB10","first-page":"389","article-title":"Processes in Petri nets","volume":"EIK 17","author":"Starker","year":"1981","journal-title":"Informationsverarbeitung und Kybernet"},{"key":"10.1016\/0304-3975(89)90098-4_BIB11","first-page":"39","article-title":"The closure of languages on a binary relation","author":"Szijj\u00e1rt\u00f3","year":"1982","journal-title":"Proc. IMYCS'82"},{"key":"10.1016\/0304-3975(89)90098-4_BIB12","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1051\/ita\/1987210200991","article-title":"Notes on finite asynchronous automata","volume":"21","author":"Zielonka","year":"1987","journal-title":"Theoret. Informat. and Appl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900984?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900984?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:55:32Z","timestamp":1555127732000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589900984"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,4]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,4]]}},"alternative-id":["0304397589900984"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90098-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,4]]}}}