{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T18:40:37Z","timestamp":1649184037018},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1982,5,1]],"date-time":"1982-05-01T00:00:00Z","timestamp":389059200000},"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":11400,"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":[[1982,5]]},"DOI":"10.1016\/0304-3975(82)90020-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"149-171","source":"Crossref","is-referenced-by-count":8,"title":["Adequacy properties of path programs"],"prefix":"10.1016","volume":"18","author":[{"given":"E.","family":"Best","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(82)90020-2_BIB1","series-title":"Proc. Advanced Course in General Net Theory","first-page":"291","article-title":"Adequacy of path programs","volume":"84","author":"Best","year":"1980"},{"key":"10.1016\/0304-3975(82)90020-2_BIB2","article-title":"Proc. Advanced Course in General Net Theory","volume":"84","year":"1980"},{"key":"10.1016\/0304-3975(82)90020-2_BIB3","article-title":"The specification of process synchronisation by path expressions","volume":"16","author":"Campbell","year":"1974"},{"key":"10.1016\/0304-3975(82)90020-2_BIB4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF00264027","article-title":"Synchronisationgraphen","volume":"2","author":"Genrich","year":"1973","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(82)90020-2_BIB5","series-title":"Proc. Advanced Course in General Net Theory","first-page":"519","article-title":"A dictionary of some basic notions of net theory","volume":"84","author":"Genrich","year":"1980"},{"key":"10.1016\/0304-3975(82)90020-2_BIB6","series-title":"Proc. Advanced Course in General Net Theory","first-page":"21","article-title":"An overview of net theory","volume":"84","author":"Genrich","year":"1980"},{"key":"10.1016\/0304-3975(82)90020-2_BIB7","series-title":"TR-94","article-title":"Analysis of production schemata by Petri nets","author":"Hack","year":"1972"},{"key":"10.1016\/0304-3975(82)90020-2_BIB8","series-title":"Proc. Advanced Course in General Net Theory","first-page":"165","article-title":"Formal properties of place-transition nets","volume":"84","author":"Jantzen","year":"1980"},{"key":"10.1016\/0304-3975(82)90020-2_BIB9","series-title":"Proc. MFCS'80","first-page":"348","article-title":"A method to compare the descriptive power of different types of Petri nets","volume":"88","author":"Jensen","year":"1980"},{"key":"10.1016\/0304-3975(82)90020-2_BIB10","first-page":"247","article-title":"Formal semantics for a class of high-level primitives for coordinating concurrent processes","volume":"5","author":"Laurer","year":"1975","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(82)90020-2_BIB11","article-title":"Liveness in Petri nets","author":"Lautenbach","year":"1975","journal-title":"GMD-ISF Internal Report"},{"key":"10.1016\/0304-3975(82)90020-2_BIB12","series-title":"TR 143","article-title":"Formal theory of the basic COSY notation","author":"Lauer","year":"1978"},{"key":"10.1016\/0304-3975(82)90020-2_BIB13","article-title":"Design and analysis of highly parallel and distributed systems","volume":"86","author":"Lauer","year":"1979"},{"key":"10.1016\/0304-3975(82)90020-2_BIB14","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF00266047","article-title":"COSY\u2014A system specification language based on paths and processes","volume":"12","author":"Lauer","year":"1979","journal-title":"Acta Informat."},{"issue":"3","key":"10.1016\/0304-3975(82)90020-2_BIB15","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/356698.356702","article-title":"Petri nets","volume":"9","author":"Peterson","year":"1977","journal-title":"Comput. Surveys"},{"key":"10.1016\/0304-3975(82)90020-2_BIB16_1","series-title":"TR 142","article-title":"Adequate path expressions","author":"Shields","year":"1979"},{"key":"10.1016\/0304-3975(82)90020-2_BIB16_2","first-page":"249","article-title":"Adequate path expressions","volume":"70","author":"Shields","year":"1979"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900202?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900202?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:26:22Z","timestamp":1555125982000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397582900202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,5]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,5]]}},"alternative-id":["0304397582900202"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90020-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1982,5]]}}}