{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T11:56:24Z","timestamp":1648641384531},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,12,1]],"date-time":"1983-12-01T00:00:00Z","timestamp":439084800000},"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":10821,"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":[[1983,12]]},"DOI":"10.1016\/0022-0000(83)90047-8","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"350-377","source":"Crossref","is-referenced-by-count":1,"title":["A technique for decomposing algorithms which use a single shared variable"],"prefix":"10.1016","volume":"27","author":[{"given":"Nancy A.","family":"Lynch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael J.","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(83)90047-8_BIB1","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1145\/365559.365617","article-title":"Solution of a problem in concurrent programming control","volume":"9","author":"Dijkstra","year":"1965","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(83)90047-8_BIB2","series-title":"Proceedings, 5th ICALP Udine","first-page":"165","article-title":"Mutual Exclusion of N processors using an O(N)-valued message variable","author":"Cremers","year":"1978"},{"key":"10.1016\/0022-0000(83)90047-8_BIB3","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-09510-1_12","article-title":"Arbitration and Queueing Under Limited Shared Storage Requirements","author":"Cremers","year":"1979"},{"issue":"2","key":"10.1016\/0022-0000(83)90047-8_BIB4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/322290.322302","article-title":"Data requirements for implementation of N-Process mutual exclusion using a single shared variable","volume":"29","author":"Burns","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(83)90047-8_BIB5","series-title":"Proceedings, 20th Annual Symposium on Foundations of Computer Science","article-title":"Resource allocation with immunity to limited process failure","author":"Fischer","year":"1979"},{"key":"10.1016\/0022-0000(83)90047-8_BIB6","unstructured":"N. A. Lynch and M. J. Fischer, \u201cOn Describing the Behavior and Implementation of Distributed Systems,\u201d GIT-ICS-79\/03"},{"key":"10.1016\/0022-0000(83)90047-8_BIB9","unstructured":"Semenatics of Concurrent Computation proceedings, pp. 147\u2013171, Evian, France, preliminary version in Lecture Notes in Computer Science, in Theoret. Comput. Sci., in press."},{"issue":"2","key":"10.1016\/0022-0000(83)90047-8_BIB7","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/0022-0000(81)90015-5","article-title":"Upper bounds for static resource allocation in a distributed system","volume":"23","author":"Lynch","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90047-8_BIB8","series-title":"New Bounds on Mutual Exclusion Problems","author":"Peterson","year":"1980"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900478?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900478?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:51:21Z","timestamp":1550325081000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000083900478"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,12]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,12]]}},"alternative-id":["0022000083900478"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(83)90047-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1983,12]]}}}