{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T01:30:23Z","timestamp":1649122223025},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1986,8,1]],"date-time":"1986-08-01T00:00:00Z","timestamp":523238400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1986,8]]},"DOI":"10.1016\/0020-0190(86)90049-9","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"91-97","source":"Crossref","is-referenced-by-count":0,"title":["Comments on Morris's starvation-free solution to the mutual exclusion problem"],"prefix":"10.1016","volume":"23","author":[{"given":"J.K.","family":"Annot","sequence":"first","affiliation":[]},{"given":"M.D.","family":"Janssens","sequence":"additional","affiliation":[]},{"given":"A.J.","family":"Van de Goor","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(86)90049-9_BIB1","series-title":"Programming Languages","article-title":"Cooperating sequential processes","author":"Dijkstra","year":"1968"},{"issue":"8","key":"10.1016\/0020-0190(86)90049-9_BIB2","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/360933.360975","article-title":"Guarded commands, nondeterminacy and formal derivation of programs","volume":"18","author":"Dijkstra","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(86)90049-9_BIB3","series-title":"Rept. EWD651","article-title":"A strong P\/V-implementation of conditional critical regions","author":"Dijkstra","year":"1978"},{"issue":"11","key":"10.1016\/0020-0190(86)90049-9_BIB4","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1145\/355606.361895","article-title":"Further comments on Dijkstra's concurrent programming control problem","volume":"15","author":"Eisenberg","year":"1972","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/0020-0190(86)90049-9_BIB5","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0020-0190(79)90147-9","article-title":"A starvation-free solution to the mutual exclusion problem","volume":"8","author":"Morris","year":"1979","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900499?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900499?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:50:00Z","timestamp":1553593800000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019086900499"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,8]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,8]]}},"alternative-id":["0020019086900499"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90049-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,8]]}}}