{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T16:38:40Z","timestamp":1648917520042},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"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":10273,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1985,6]]},"DOI":"10.1016\/0022-0000(85)90049-2","type":"journal-article","created":{"date-parts":[[2003,12,3]],"date-time":"2003-12-03T06:59:35Z","timestamp":1070434775000},"page":"318-328","source":"Crossref","is-referenced-by-count":0,"title":["Free semiring-representations and nondeterminism"],"prefix":"10.1016","volume":"30","author":[{"given":"Michael G.","family":"Main","sequence":"first","affiliation":[]},{"given":"David B.","family":"Benson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(85)90049-2_BIB1","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-009-7893-5_11","article-title":"Algebras, Theories, and Freeness: An Introduction for Computer Scientists","author":"Burstall","year":"1982"},{"key":"10.1016\/0022-0000(85)90049-2_BIB2","doi-asserted-by":"crossref","unstructured":"P. Freyd, private communication, March 1983.","DOI":"10.1017\/S0140525X00015156"},{"key":"10.1016\/0022-0000(85)90049-2_BIB3","series-title":"Mathematical Foundations of Computer Science 79","first-page":"108","article-title":"Full abstraction for a simple parallel programming language","volume":"Vol. 74","author":"Hennessy","year":"1979"},{"key":"10.1016\/0022-0000(85)90049-2_BIB4","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1016\/0022-0000(83)90050-8","article-title":"Deterministic and nondeterministic flowchart interpretations","volume":"27","author":"Lorentz","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(85)90049-2_BIB5","series-title":"Formalizations of Programming Concepts","first-page":"447","article-title":"Using least fixed points to characterize formal computations of nondeterminate equations","volume":"Vol. 107","author":"Poigne","year":"1981"},{"key":"10.1016\/0022-0000(85)90049-2_BIB6","series-title":"5th International Symposium on Programming","first-page":"323","article-title":"On effective computations of nondeterministic schemes","volume":"Vol. 137","author":"Poigne","year":"1982"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000085900492?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000085900492?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T10:53:56Z","timestamp":1550314436000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000085900492"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["0022000085900492"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(85)90049-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1985,6]]}}}