{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:27:12Z","timestamp":1725460032705},"publisher-location":"Boston","reference-count":16,"publisher":"Kluwer Academic Publishers","isbn-type":[{"type":"print","value":"1402081405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/1-4020-8141-3_16","type":"book-chapter","created":{"date-parts":[[2006,2,21]],"date-time":"2006-02-21T15:15:11Z","timestamp":1140534911000},"page":"181-194","source":"Crossref","is-referenced-by-count":3,"title":["The Driving Philosophers"],"prefix":"10.1007","author":[{"given":"S.","family":"Baehni","sequence":"first","affiliation":[]},{"given":"R.","family":"Baldoni","sequence":"additional","affiliation":[]},{"given":"R.","family":"Guerraoui","sequence":"additional","affiliation":[]},{"given":"B.","family":"Pochon","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"H. Attiya and J. Welch. Distributed Computing. McGraw-Hill, 1998."},{"key":"16_CR2","series-title":"Technical Report","volume-title":"The Driving Philosophers","author":"S. Baehni","year":"2004","unstructured":"S. Baehni, R. Baldoni, R. Guerraoui, and B. Pochon. The Driving Philosophers. Technical Report IC\/2004\/15, EPFL, Lausanne, 2004."},{"issue":"4","key":"16_CR3","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. ACM Transactions on Programming Languages and Systems, 11(4):562\u2013584, 1989.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"16_CR4","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/974104.974111","volume":"38","author":"M. Bencha\u00efba","year":"2004","unstructured":"M. Bencha\u00efba, A. Bouabdallah, N. Badache, and M. Ahmed-Nacer. Distributed mutual exclusion algorithms in mobile ad-hoc networks. ACM Operating Systems Review, 38(1):74\u201389, January 2004.","journal-title":"ACM Operating Systems Review"},{"issue":"4","key":"16_CR5","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1145\/1780.1804","volume":"6","author":"K. M. Chandy","year":"1984","unstructured":"K. M. Chandy and J. Misra. The drinking philosophers problem. ACM Transactions on Programming Languages and Systems, 6(4):632\u2013646, 1984.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2","key":"16_CR6","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF00289519","volume":"1","author":"E. W. Dijkstra","year":"1971","unstructured":"E. W. Dijkstra. Hierarchical ordering of sequential processes. Acta Informatica, 1(2): 115\u2013138, 1971.","journal-title":"Acta Informatica"},{"issue":"5","key":"16_CR7","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/332833.332836","volume":"43","author":"D. Estrin","year":"2000","unstructured":"D. Estrin, R. Govindan, and J. Heidemann. Embedding the internet. Communication of the ACM, 43(5):39\u201341, 2000.","journal-title":"Communication of the ACM"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"M. Fischer, N. Lynch, J. Burns, and A. Borodin. Resource allocation with immunity to limited process failure. In IEEE Symposium on Foundations of Computer Science, pages 234\u2013254, 1979.","DOI":"10.1109\/SFCS.1979.37"},{"issue":"1","key":"16_CR9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1023\/A:1012719525108","volume":"8","author":"N. Garg","year":"2002","unstructured":"N. Garg, M. Papatriantafilou, and P. Tsigas. Distributed long-lived list colouring: How to dynamically allocate frequencies in cellular networks. ACM Wireless Network, 8(1):49\u201360, 2002.","journal-title":"ACM Wireless Network"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/inco.2000.3004","volume":"173","author":"R. Grossi","year":"2002","unstructured":"R. Grossi, A. Pietracaprina, and G. Pucci. Optimal deterministic protocols for mobile robots on a grid. Information and Computation, 173:132\u2013142, 2002.","journal-title":"Information and Computation"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Y. Joung. Asynchronous group mutual exclusion. In Proceedings of the 17 th ACM Symposium on Principles of Distributed Computing (PODC\u201998) pages 51\u201360, 1998.","DOI":"10.1145\/277697.277706"},{"issue":"2","key":"16_CR12","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/5383.5384","volume":"33","author":"L. Lamport","year":"1985","unstructured":"L. Lamport. The mutual exclusion problem. Journal of the ACM, 33(2):313\u2013348, 1985.","journal-title":"Journal of the ACM"},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/7351.7352","volume":"5","author":"L. Lamport","year":"1987","unstructured":"L. Lamport. A fast mutual exclusion algorithm. ACM Transactions on Computer Systems, 5(1): 1\u201311, February 1987.","journal-title":"ACM Transactions on Computer Systems"},{"key":"16_CR14","unstructured":"N. A. Lynch. Distributed Algorithms. Morgan-Kaufmann, 1996."},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"M. Merritt and G. Taubenfeld. Resilient consensus for infinitely many processes. In Proceedings of the 17 th International Symposium on Distributed Computing (DISC\u201903), pages 1\u201315, October 2003.","DOI":"10.1007\/978-3-540-39989-6_1"},{"issue":"6","key":"16_CR16","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1023\/A:1012363200403","volume":"9","author":"J. Walter","year":"2001","unstructured":"J. Walter, J. Welch, and N. Vaidya. A mutual exclusion algorithm for ad hoc mobile networks. Wireless Networks, 9(6):585\u2013600, 2001.","journal-title":"Wireless Networks"}],"container-title":["IFIP International Federation for Information Processing","Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/1-4020-8141-3_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:28:08Z","timestamp":1619555288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/1-4020-8141-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["1402081405"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/1-4020-8141-3_16","relation":{},"subject":[]}}