{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T05:51:35Z","timestamp":1747806695069},"reference-count":8,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1985]]},"DOI":"10.1016\/0167-6423(85)90015-2","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T16:44:35Z","timestamp":1048610675000},"page":"265-276","source":"Crossref","is-referenced-by-count":40,"special_numbering":"C","title":["Distributed mutual exclusion on a ring of processes"],"prefix":"10.1016","volume":"5","author":[{"given":"Alain J.","family":"Martin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(85)90015-2_BIB1","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0167-6423(85)90015-2_BIB2","article-title":"Reducing control traffic in a distributed implementation of mutual exclusion","author":"Dijkstra","year":"1983","journal-title":"EWD851b"},{"key":"10.1016\/0167-6423(85)90015-2_BIB3","article-title":"On the correctness of a design by Alain J. Martin","author":"Dijkstra","year":"1978","journal-title":"EWD668"},{"key":"10.1016\/0167-6423(85)90015-2_BIB4","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","author":"Hoare","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(85)90015-2_BIB5","article-title":"Distributed mutual exclusion algorithms","author":"Martin","year":"1982","journal-title":"Caltech Technical Report 5047:TR:82"},{"key":"10.1016\/0167-6423(85)90015-2_BIB6","article-title":"The probe: An addition to communication primitives","author":"Martin","year":"1984","journal-title":"Caltech Technical Report 5124:TR:84"},{"key":"10.1016\/0167-6423(85)90015-2_BIB7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF00261260","article-title":"An axiomatic definition of synchronisation primitives","volume":"16","author":"Martin","year":"1981","journal-title":"Acta Inform."},{"issue":"4","key":"10.1016\/0167-6423(85)90015-2_BIB8","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","article-title":"An axiomatic proof technique for parallel programs","volume":"6","author":"Owicki","year":"1976","journal-title":"Acta Inform."}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642385900152?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642385900152?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T15:30:50Z","timestamp":1553441450000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642385900152"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":8,"alternative-id":["0167642385900152"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(85)90015-2","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}