{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T07:10:24Z","timestamp":1737097824088,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540411437"},{"type":"electronic","value":"9783540400264"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":[[2000]]},"DOI":"10.1007\/3-540-40026-5_15","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T23:59:07Z","timestamp":1181692747000},"page":"223-237","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Self-Stabilizing Local Mutual Exclusion and Daemon Refinement"],"prefix":"10.1007","author":[{"given":"Joffroy","family":"Beauquier","sequence":"first","affiliation":[]},{"given":"Ajoy K.","family":"Datta","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Gradinariu","sequence":"additional","affiliation":[]},{"given":"Frederic","family":"Magniette","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"A. Arora and M. Nesterenko. Stabilization-preserving atomicity refinement. DISC\u201999, pages 254\u2013268, 1999.","DOI":"10.1007\/3-540-48169-9_18"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1109\/FSCS.1990.89525","volume":"1","author":"B. Awerbuch","year":"1990","unstructured":"B. Awerbuch and M. Saks. A dining philosophers algorithm with polynomial response time. 31st Annual Symposium on Foundations of Computer Science, volume 1:65\u201374, October 1990.","journal-title":"31st Annual Symposium on Foundations of Computer Science"},{"key":"15_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1007\/3-540-48311-X_116","volume-title":"Euro-par99, Parallel Processing, Proceedings","author":"G.H. Antonoiu","year":"1999","unstructured":"GH. Antonoiu and P.K. Srimani. Mutual exclusion between neighboring nodes in an arbitrary system graph tree that stabilizes using read\/write atomicity. In Euro-par99, Parallel Processing, Proceedings LNCS:1685, pages 823\u2013830, 1999."},{"issue":"4","key":"15_CR4","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1145\/69558.69560","volume":"11","author":"V. Barbosa","year":"1989","unstructured":"V. Barbosa and E. Gafni. Concurrency in heavily loaded neighborhood-constrained systems. Transactions on Programming Languages and Systems Vol 11 Num 4, pages 562\u2013584, 1989.","journal-title":"Transactions on Programming Languages and Systems"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"J.M. Couvreur, N. Francez, and M.G. Gouda. Asynchronous unison. ICD-CS92 Proceedings of the 12th International Conference on Distributed Computing Systems, pages 486\u2013493, 1992.","DOI":"10.1109\/ICDCS.1992.235005"},{"issue":"4","key":"15_CR6","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1145\/1780.1804","volume":"6","author":"M. Chandy","year":"1984","unstructured":"M. Chandy and J. Misra. The drinking philosophers problem. ACM Transa-tions on Programming Languages and Systems, pages 6(4):632\u2013646, October 1984.","journal-title":"ACM Transa-tions on Programming Languages and Systems"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"S. Dolev, M. G. Gouda, and M. Schneider. Memory requirements for silent stabilization. In PODC96 Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, pages 27\u201334, 1996.","DOI":"10.1145\/248052.248055"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"E. W. Dijkstra. Hierarchical ordering of sequential processes. Ada Informatica, pages 115\u2013138, 1971.","DOI":"10.1007\/BF00289519"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. ACM 17, pages 643\u2013644, 1974.","DOI":"10.1145\/361179.361202"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02278851","volume":"7","author":"S. Dolev","year":"1993","unstructured":"S. Dolev, A. Israeli, and S. Moran. Self-stabilizing of dynamic systems assuming only read\/write atomicity. Distributed Computing, 7:3\u201316, 1993.","journal-title":"Distributed Computing"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"S. Dolev. Self-Stabilization. The MIT Press, 2000.","DOI":"10.7551\/mitpress\/6156.001.0001"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"M. Gouda and F. Hadix. The linear alternator. Proceedings of the third workshop on self-stabilizing systems (WSS-97), International Informatics Series 7, Carleton University Press, pages 31\u201347, 1997.","DOI":"10.1515\/9780773591141-004"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"M. Gouda and F. Hadix. The alternator. In Proceedings of the Third Workshop on Self-Stabilizing Systems (published in association with ICDCS99 The 19th IEEE International Conference on Distributed Computing Systems), pages 48\u201353, 1999.","DOI":"10.1109\/SLFSTB.1999.777486"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF02278856","volume":"7","author":"S. Ghosh","year":"1993","unstructured":"S. Ghosh and Mehmet Hakan Karaata. A self-stabilizing algorithm for coloring planar graphs. Distributed Computing, pages 7:55\u201359, 1993.","journal-title":"Distributed Computing"},{"key":"15_CR15","unstructured":"M. G. Gouda. The stabilizing philosopher: asymmetry by memory and by action. Tech Rep TR-87-12, Univesity of Texas at Austin, 1987."},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"D. Hoover and J. Poole. A distributed self-stabilizing solution for the dining philosophers problem. Information Processing Letter 1 1, pages 209\u2013213, 1989.","DOI":"10.1016\/0020-0190(92)90182-U"},{"key":"15_CR17","unstructured":"S.T. Huang. The fuzzy philoshophers. In Workshop on Advances of Paral-leland Distributed Computational Models, page to appear, May 2000."},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"C. Johnen, L. O. Alima, A. K. Datta, and S. Tixeuil. Self-stabilizing neighborhood synchronizer in tree networks. In Proceedings of the Nineteenth International Conference on Distributed Computing Systems (ICDCS\u201999), pages 487\u2013494, June 1999.","DOI":"10.1109\/ICDCS.1999.776551"},{"key":"15_CR19","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0020-0190(98)00069-6","volume":"66","author":"M. Mizuno","year":"1997","unstructured":"M. Mizuno and M. Nesterenko. A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments. Information Processing Letter 66, pages 285\u2013290, 1997.","journal-title":"Information Processing Letter"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40026-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T06:42:34Z","timestamp":1737096154000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40026-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540411437","9783540400264"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-40026-5_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"15 March 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}