{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:17:51Z","timestamp":1725891471236},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540490180"},{"type":"electronic","value":"9783540498230"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/978-3-540-49823-0_15","type":"book-chapter","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T12:12:32Z","timestamp":1182859952000},"page":"214-230","source":"Crossref","is-referenced-by-count":7,"title":["Self-stabilizing Philosophers with Generic Conflicts"],"prefix":"10.1007","author":[{"given":"Praveen","family":"Danturi","sequence":"first","affiliation":[]},{"given":"Mikhail","family":"Nesterenko","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1007\/3-540-48311-X_116","volume-title":"Euro-Par\u201999 Parallel Processing","author":"G. Antonoiu","year":"1999","unstructured":"Antonoiu, G., Srimani, P.K.: Mutual exclusion between neighboring nodes in an arbitrary system graph that stabilizes using read\/write atomicity. In: Amestoy, P.R., Berger, P., Dayd\u00e9, M., Duff, I.S., Frayss\u00e9, V., Giraud, L., Ruiz, D. (eds.) Euro-Par 1999. LNCS, vol.\u00a01685, pp. 823\u2013830. Springer, Heidelberg (1999)"},{"issue":"3","key":"15_CR2","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s00446-004-0111-6","volume":"17","author":"A. Arora","year":"2005","unstructured":"Arora, A., Nesterenko, M.: Unifying stabilization and termination in message-passing systems. Distributed Computing\u00a017(3), 279\u2013290 (2005)","journal-title":"Distributed Computing"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Arumugam, M., Kulkarni, S.S.: Self-stabilizing deterministic TDMA for sensor networks. Technical Report MSU-CSE-05-19, Michigan State University (2005)","DOI":"10.21236\/ADA455715"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-40026-5_15","volume-title":"Distributed Computing","author":"J. Beauquier","year":"2000","unstructured":"Beauquier, J., Datta, A.K., Gradinariu, M., Magniette, F.: Self-stabilizing local mutual exclusion and daemon refinement. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol.\u00a01914, pp. 223\u2013237. Springer, Heidelberg (2000)"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1145\/1011767.1011790","volume-title":"PODC 2004: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing","author":"C. Boulinier","year":"2004","unstructured":"Boulinier, C., Petit, F., Villain, V.: When graph theory helps self-stabilization. In: PODC 2004: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pp. 150\u2013159. ACM Press, New York (2004)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Bui, A., Datta, A.K., Petit, F., Villain, V.: Space optimal PIF algorithm: self-stabilized with no extra space. In: IEEE International Conference on Performance, Computing and Communications, pp. 20\u201326 (1999)","DOI":"10.1109\/PCCC.1999.749416"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/3-540-45032-7_8","volume-title":"Self-Stabilizing Systems","author":"S. Cantarell","year":"2003","unstructured":"Cantarell, S., Datta, A.K., Petit, F.: Self-stabilizing atomicity refinement allowing neighborhood concurrency. In: Huang, S.-T., Herman, T. (eds.) SSS 2003. LNCS, vol.\u00a02704, pp. 102\u2013112. Springer, Heidelberg (2003)"},{"issue":"4","key":"15_CR8","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1145\/1780.1804","volume":"6","author":"K.M. Chandy","year":"1984","unstructured":"Chandy, K.M., Misra, J.: The drinking philosophers problem. ACM Transactions on Programming Languages and Systems\u00a06(4), 632\u2013646 (1984)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"15_CR9","volume-title":"Parallel Program Design: a Foundation","author":"K.M. Chandy","year":"1988","unstructured":"Chandy, K.M., Misra, J.: Parallel Program Design: a Foundation. Addison-Wesley, Reading (1988)"},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.ipl.2005.03.006","volume":"95","author":"A.K. Datta","year":"2005","unstructured":"Datta, A.K., Gradinariu, M., Raynal, M.: Stabilizing mobile philosophers. Information Procesing Letters\u00a095(1), 299\u2013306 (2005)","journal-title":"Information Procesing Letters"},{"key":"15_CR11","volume-title":"Cooperating Sequential Processes","author":"E. Dijkstra","year":"1968","unstructured":"Dijkstra, E.: Cooperating Sequential Processes. Academic Press, London (1968)"},{"key":"15_CR12","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-Stabilization","author":"S. Dolev","year":"2000","unstructured":"Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)"},{"issue":"3-4","key":"15_CR13","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1142\/S0129626404001970","volume":"14","author":"M. Gairing","year":"2004","unstructured":"Gairing, M., Goddard, W., Hedetniemi, S.T., Kristiansen, P., McRae, A.A.: Distance-two information in self-stabilizing algorithms. Parallel Processing Letters\u00a014(3-4), 387\u2013398 (2004)","journal-title":"Parallel Processing Letters"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/11780823_27","volume-title":"Structural Information and Communication Complexity","author":"W. Goddard","year":"2006","unstructured":"Goddard, W., Hedetniemi, S.T., Jacobs, D.P., Trevisan, V.: Distance-k information in self-stabilizing algorithms. In: Flocchini, P., G\u0105sieniec, L. (eds.) SIROCCO 2006. LNCS, vol.\u00a04056, pp. 349\u2013356. Springer, Heidelberg (2006)"},{"key":"15_CR15","volume-title":"Elmnts. of Network Protocol Design","author":"M.G. Gouda","year":"1998","unstructured":"Gouda, M.G.: Elmnts. of Network Protocol Design. John Wiley & Sons, Inc., Chichester (1998)"},{"key":"15_CR16","first-page":"48","volume-title":"Proceedings of the Fourth Workshop on Self-Stabilizing Systems","author":"M.G. Gouda","year":"1999","unstructured":"Gouda, M.G., Haddix, F.: The alternator. In: Proceedings of the Fourth Workshop on Self-Stabilizing Systems, pp. 48\u201353. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"15_CR17","unstructured":"Herman, T.: A comprehensive bibliography on self-stabilization (working paper). CJTCS: Chicago Journal of Theoretical Computer Science (1995)"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-540-27820-7_6","volume-title":"Algorithmic Aspects of Wireless Sensor Networks","author":"T. Herman","year":"2004","unstructured":"Herman, T., Tixeuil, S.: A distributed TDMA slot assignment algorithm for wireless sensor networks. In: Nikoletseas, S.E., Rolim, J.D.P. (eds.) ALGOSENSORS 2004. LNCS, vol.\u00a03121, pp. 45\u201358. Springer, Heidelberg (2004)"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-540-27820-7_6","volume-title":"Algorithmic Aspects of Wireless Sensor Networks","author":"T. Herman","year":"2004","unstructured":"Herman, T., Tixeuil, S.: A distributed TDMA slot assignment algorithm for wireless sensor networks. In: Nikoletseas, S.E., Rolim, J.D.P. (eds.) ALGOSENSORS 2004. LNCS, vol.\u00a03121, pp. 45\u201358. Springer, Heidelberg (2004)"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-45591-4_16","volume-title":"Parallel and Distributed Processing","author":"S.T. Huang","year":"2000","unstructured":"Huang, S.T.: The fuzzy philosophers. In: Rolim, J.D.P. (ed.) IPDPS-WS 2000. LNCS, vol.\u00a01800, pp. 130\u2013136. Springer, Heidelberg (2000)"},{"issue":"3-4","key":"15_CR21","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1142\/S0129626402001026","volume":"12","author":"C. Johnen","year":"2002","unstructured":"Johnen, C., Alima, L.O., Datta, A.K., Tixeuil, S.: Optimal snap-stabilizing neighborhood synchronizer in tree networks. Parallel Processing Letters\u00a012(3-4), 327\u2013340 (2002)","journal-title":"Parallel Processing Letters"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-45032-7_2","volume-title":"Self-Stabilizing Systems","author":"S.S. Kulkarni","year":"2003","unstructured":"Kulkarni, S.S., Arumugam, M.: Collision-free communication in sensor networks. In: Huang, S.-T., Herman, T. (eds.) SSS 2003. LNCS, vol.\u00a02704, pp. 17\u201331. Springer, Heidelberg (2003)"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Malhotra, M., Krasniewski, M., Yang, C., Bagchi, S., Chappbell, W.: Location estimation in ad-hoc networks with directional antennas. In: The 25th\u00a0 IEEE International Conference on Distributed Computing Systems, pp. 633\u2013642 (2005)","DOI":"10.1109\/ICDCS.2005.47"},{"key":"15_CR24","volume-title":"Proceedings of ICPADS 2006","author":"N. Mitton","year":"2006","unstructured":"Mitton, N., Fleury, E., Gu\u00e9rin-Lassous, I., S\u00e9ricola, B., Tixeuil, S.: On fast randomized colorings in sensor networks. In: Proceedings of ICPADS 2006. IEEE Press, Los Alamitos (to appear, 2006)"},{"issue":"6","key":"15_CR25","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0020-0190(98)00069-6","volume":"66","author":"M. Mizuno","year":"1998","unstructured":"Mizuno, M., Nesterenko, M.: A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments. Information Processing Letters\u00a066(6), 285\u2013290 (1998)","journal-title":"Information Processing Letters"},{"issue":"5","key":"15_CR26","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1006\/jpdc.2001.1828","volume":"62","author":"M. Nesterenko","year":"2002","unstructured":"Nesterenko, M., Arora, A.: Stabilization-preserving atomicity refinement. Journal of Parallel and Distributed Computing\u00a062(5), 766\u2013791 (2002)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"15_CR27","unstructured":"Sivilotti, P.A.G., Pike, S.M., Sridhar, N.: A new distributed resource-allocation algorithm with optimal failure locality. In: Proceedings of the \u00a012th\u00a0 IASTED International Conference on Parallel and Distributed Computing and Systems, vol.\u00a02, November 2000, pp. 524\u2013529. IASTED\/ACTA Press (2000)"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-49823-0_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:07:35Z","timestamp":1605762455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-49823-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540490180","9783540498230"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-49823-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}