{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T03:53:38Z","timestamp":1649130818593},"reference-count":5,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1983,9,1]],"date-time":"1983-09-01T00:00:00Z","timestamp":431222400000},"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":10912,"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":[[1983,9]]},"DOI":"10.1016\/0304-3975(83)90087-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"225-231","source":"Crossref","is-referenced-by-count":1,"title":["Determinism in parallel systems"],"prefix":"10.1016","volume":"26","author":[{"given":"Vaclav","family":"Rajlich","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90087-7_BIB1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0022-0000(80)90010-0","article-title":"Adherence of languages","volume":"20","author":"Boasson","year":"1980","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0304-3975(83)90087-7_BIB2","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","article-title":"Confluent reductions: Abstract properties and applications to term rewriting systems","volume":"22","author":"Huet","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(83)90087-7_BIB3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","article-title":"Parallel program schemata","volume":"3","author":"Karp","year":"1969","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0304-3975(83)90087-7_BIB4","series-title":"Applied Computation Theory","article-title":"Application of formal grammars and automata to programming language definition","author":"Pratt","year":"1976"},{"key":"10.1016\/0304-3975(83)90087-7_BIB5","series-title":"Graph-Grammars and Their Application to Computer Science and Biology","first-page":"401","article-title":"Determinism in relational systems","volume":"73","author":"Rajlich","year":"1979"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900877?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900877?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:28:32Z","timestamp":1555111712000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583900877"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,9]]},"references-count":5,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1983,9]]}},"alternative-id":["0304397583900877"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90087-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983,9]]}}}