{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T15:55:41Z","timestamp":1723046141645},"reference-count":5,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1990,8,1]],"date-time":"1990-08-01T00:00:00Z","timestamp":649468800000},"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":[[1990,8]]},"DOI":"10.1016\/0020-0190(90)90048-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"219-222","source":"Crossref","is-referenced-by-count":7,"title":["A more efficient generalization of Peterson's mutual exclusion algorithm"],"prefix":"10.1016","volume":"35","author":[{"given":"Kenneth","family":"Block","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tai-Kuo","family":"Woo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0020-0190(90)90048-3_BIB1","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/363162.363167","article-title":"Additional comments on a problem in concurrent programming control","volume":"10","author":"De Bruijn","year":"1967","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(90)90048-3_BIB2","first-page":"43","article-title":"Co-operating sequential processes","author":"Dijkstra","year":"1965"},{"issue":"5","key":"10.1016\/0020-0190(90)90048-3_BIB3","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/355592.365595","article-title":"Additional comments on a problem in concurrent programming control","volume":"9","author":"Knuth","year":"1966","journal-title":"Comm. ACM"},{"issue":"8","key":"10.1016\/0020-0190(90)90048-3_BIB4","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/361082.361093","article-title":"A new solution of Dijkstra's concurrent programming problem","volume":"17","author":"Lamport","year":"1974","journal-title":"Comm. ACM"},{"issue":"3","key":"10.1016\/0020-0190(90)90048-3_BIB5","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(81)90106-X","article-title":"Myths about the mutual exclusion problem","volume":"12","author":"Peterson","year":"1981","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019090900483?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019090900483?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T17:20:51Z","timestamp":1555089651000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019090900483"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,8]]},"references-count":5,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1990,8]]}},"alternative-id":["0020019090900483"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(90)90048-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1990,8]]}}}