{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T14:29:10Z","timestamp":1673015350118},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1977,2,1]],"date-time":"1977-02-01T00:00:00Z","timestamp":223603200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":13316,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1977,2]]},"DOI":"10.1016\/s0019-9958(77)90558-7","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T09:12:12Z","timestamp":1103101932000},"page":"177-192","source":"Crossref","is-referenced-by-count":27,"title":["Petri nets and szilard languages"],"prefix":"10.1016","volume":"33","author":[{"given":"S.","family":"Crespi-reghizzi","sequence":"first","affiliation":[]},{"given":"D.","family":"Mandrioli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(77)90558-7_bib1","article-title":"Petri nets and commutative grammars","author":"Crespi-Reghizzi","year":"1974","journal-title":"Rapp. 74-75"},{"key":"10.1016\/S0019-9958(77)90558-7_bib2","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. Letters"},{"key":"10.1016\/S0019-9958(77)90558-7_bib3","first-page":"742","article-title":"Proper termination of flow-of-control in programs involving concurrent processes","volume":"Vol. II","author":"Gostelow","year":"1972"},{"key":"10.1016\/S0019-9958(77)90558-7_bib4","article-title":"Analysis of production schemata by Petri nets","volume":"TR-94","author":"Hack","year":"1972","journal-title":"M.I.T.-Project MAC"},{"key":"10.1016\/S0019-9958(77)90558-7_bib5","article-title":"Extended state-machine-allocatable nets (ESMA), an extension of free choice Petri net results","volume":"78","author":"Hack","year":"1973","journal-title":"Computation Structures Group Memo"},{"key":"10.1016\/S0019-9958(77)90558-7_bib6","article-title":"Decision problems for Petri nets and vector addition systems","author":"Hack","year":"1974"},{"key":"10.1016\/S0019-9958(77)90558-7_bib7","series-title":"M.I.T. Project MAC","article-title":"Petri net languages","author":"Hack","year":"1975"},{"key":"10.1016\/S0019-9958(77)90558-7_bib8","series-title":"Events and conditions: information system theory project","author":"Holt","year":"1970"},{"key":"10.1016\/S0019-9958(77)90558-7_bib9","series-title":"Formal Languages and their Relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/S0019-9958(77)90558-7_bib10","doi-asserted-by":"crossref","first-page":"167","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\/S0019-9958(77)90558-7_bib11","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0019-9958(73)90237-4","article-title":"Associate languages and derivational complexity of formal grammars and languages","volume":"22","author":"Moriya","year":"1973","journal-title":"Inform. Contr."},{"key":"10.1016\/S0019-9958(77)90558-7_bib12","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF00288639","article-title":"On derivation languages corresponding to context-free grammars","volume":"3","author":"Penttonen","year":"1974","journal-title":"Acta Informatica"},{"key":"10.1016\/S0019-9958(77)90558-7_bib13","series-title":"Computation sequence sets","author":"Peterson","year":"1974"},{"key":"10.1016\/S0019-9958(77)90558-7_bib14","series-title":"Formal languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/S0019-9958(77)90558-7_bib15","series-title":"6th Annual ACM Symp. on Theory of Computing","article-title":"A partial solution to the reachability problem for vector addition systems","author":"Van Leeuwen","year":"1974"},{"key":"10.1016\/S0019-9958(77)90558-7_bib16","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/365153.365162","article-title":"Euler: A generalization of Algol, and its formal definition: Part I","volume":"9","author":"Wirth","year":"1966","journal-title":"Comm. ACM"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995877905587?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995877905587?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T14:21:31Z","timestamp":1548944491000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995877905587"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,2]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1977,2]]}},"alternative-id":["S0019995877905587"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(77)90558-7","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1977,2]]}}}