{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:40:11Z","timestamp":1742593211071,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540540991"},{"type":"electronic","value":"9783540474050"}],"license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54099-7_28","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:28:56Z","timestamp":1330208936000},"page":"422-431","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A bounded first-in, first-enabled solution to the l-exclusion problem"],"prefix":"10.1007","author":[{"given":"Yehuda","family":"Afek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Dolev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eli","family":"Gafni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Merritt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nir","family":"Shavit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"H. Attiya, A. Bar-Noy, D. Dolev, D. Koller, D. Peleg, and R. Reischuk. Achievable cases in an asynchronous environment. In Proc. of the 28th IEEE Annual Symp. on Foundation of Computer Science, pages 337\u2013346, October 1987.","DOI":"10.1109\/SFCS.1987.5"},{"key":"28_CR2","volume-title":"The virtue of patience: concurrent programming with and without waiting","author":"J. H. Anderson","year":"1988","unstructured":"J. H. Anderson, and M. G. Gouda, The virtue of patience: concurrent programming with and without waiting. unpublished manuscript, Dept. of Computer Science, Austin, Texas, January 1988."},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"D. Dolev, E. Gafni, and N. Shavit. Towards a non-atomic era: l-exclusion as a test case. In Proceedings of the 20 th Annual ACM Symposium on Theory of Computing. ACM SIGACT, ACM, 1988.","DOI":"10.1145\/62212.62220"},{"key":"28_CR4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1145\/365559.365617","volume":"8","author":"E.W. Dijkstra","year":"1965","unstructured":"E.W. Dijkstra. Solution of a problem in concurrent programming control. Communications Of The ACM, 8:165, 1965.","journal-title":"Communications Of The ACM"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"D. Dolev and N. Shavit. Bounded concurrent time-stamp systems are constructible. In Proceedings of the 21 st Annual ACM Symposium on Theory of Computing, Seattle, Washington, pages 454\u2013465. ACM SIGACT, ACM, 1989.","DOI":"10.21236\/ADA213853"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"M. Fischer, N. Lynch, J. Burns, and A. Borodin. Resource allocation with immunity to limited process failure. In Proceedings of 20th FOCS, pages 234\u2013254, October 1979.","DOI":"10.1109\/SFCS.1979.37"},{"issue":"1","key":"28_CR7","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/59287.59292","volume":"11","author":"M. Fischer","year":"1989","unstructured":"M. Fischer, N. Lynch, J. Burns, and A. Borodin. Distributed fifo allocation of identical resources using small shared space. ACM Transactions on Programming Languages and Systems, 11(1):90\u2013114, January 1989.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"M. P. Herlihy, Wait free implementations of concurrent objects, Proc. 7th ACM Symp. on Principles of Distributed Computing, 1988, pp. 276\u2013290.","DOI":"10.1145\/62546.62593"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"H. Katseff. A new solution to the critical section problem. In Proceedings of the 10 th Annual ACM Symposium on Theory of Computing, pages 86\u201388. ACM, 1978.","DOI":"10.1145\/800133.804335"},{"issue":"8","key":"28_CR10","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/361082.361093","volume":"78","author":"L. Lamport","year":"1974","unstructured":"L. Lamport. A new solution of dijkstra's concurrent programming problem. Communications of the ACM, 78(8):453\u2013455, 1974.","journal-title":"Communications of the ACM"},{"key":"28_CR11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01786227","volume":"2","author":"L. Lamport","year":"1986","unstructured":"L. Lamport, On interprocess communication. Part I: Basic formalism. Distributed Computing 1, 2 1986, 77\u201385.","journal-title":"Distributed Computing 1"},{"key":"28_CR12","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/BF01786228","volume":"2","author":"L. Lamport","year":"1986","unstructured":"L. Lamport, On interprocess communication. Part II: Algorithms. Distributed Computing 1, 2 1986, pp. 86\u2013101.","journal-title":"Distributed Computing 1"},{"issue":"2","key":"28_CR13","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1145\/5383.5385","volume":"33","author":"L. Lamport","year":"1986","unstructured":"Leslie Lamport. The mutual exclusion problem.part ii: Statement and solutions. J. ACM, 33(2):327\u2013348, 1986.","journal-title":"J. ACM"},{"issue":"3","key":"28_CR14","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(81)90106-X","volume":"12","author":"G. L. Peterson","year":"1981","unstructured":"G. L. Peterson. Myths about the mutual exclusion problem. Information Processing Letters, 12(3):115\u2013116, 1981.","journal-title":"Information Processing Letters"},{"issue":"1","key":"28_CR15","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/357195.357198","volume":"5","author":"G. L. Peterson","year":"1983","unstructured":"G. L. Peterson, Concurrent reading while writing. ACM Transactions on Programming Languages and Systems, Vol. 5, No. 1 (January 1983), pp. 46\u201355.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"28_CR16","unstructured":"G. Peterson. personal communication. unpublished, 1988."},{"key":"28_CR17","unstructured":"Larry Rudolph. Software Structures for Ultra-Parallel Computing. PhD thesis, New York University, 1981."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54099-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:13:56Z","timestamp":1742591636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54099-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540540991","9783540474050"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-54099-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}