{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T21:40:19Z","timestamp":1763415619631,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031210167"},{"type":"electronic","value":"9783031210174"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-21017-4_13","type":"book-chapter","created":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T18:06:34Z","timestamp":1667930794000},"page":"193-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reaching Consensus in\u00a0the\u00a0Presence of\u00a0Contention-Related Crash Failures"],"prefix":"10.1007","author":[{"given":"Ana\u00efs","family":"Durand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gadi","family":"Taubenfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,9]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Attiya, H., Welch, J.L.: Distributed Computing: Fundamentals, Simulations And Advanced Topics, 2nd edn., p. 414. Wiley-Interscience, New Jersey (2004). ISBN 0-471-45324-2","DOI":"10.1002\/0471478210"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/inco.1993.1043","volume":"105","author":"S Chaudhuri","year":"1993","unstructured":"Chaudhuri, S.: More choices allow more faults: set consensus problems in totally asynchronous systems. Inf. Comput. 105(1), 132\u2013158 (1993)","journal-title":"Inf. Comput."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-642-15260-3","volume-title":"Reliable And Secure Distributed Programming","author":"Ch Cachin","year":"2011","unstructured":"Cachin, Ch., Guerraoui, R., Rodrigues, L.: Reliable And Secure Distributed Programming, p. 367. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-15260-3"},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s00446-021-00417-3","volume":"35","author":"A Casta\u00f1eda","year":"2022","unstructured":"Casta\u00f1eda, A., Gonczarowski, Y.A., Moses, Y.: Unbeatable consensus. Distrib. Comput. 35(2), 123\u2013143 (2022). https:\/\/doi.org\/10.1007\/s00446-021-00417-3","journal-title":"Distrib. Comput."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2022.01.029","volume":"909","author":"A Durand","year":"2022","unstructured":"Durand, A., Raynal, M., Taubenfeld, G.: Contention-related crash-failures: definitions, agreement algorithms and impossibility results. Theoret. Comput. Sci. 909, 76\u201386 (2022)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Guerraoui R.: Indulgent algorithms. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing (PODC 2000), pp. 289\u2013297. ACM Press (2000)","DOI":"10.1145\/343477.343630"},{"issue":"4","key":"13_CR8","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1109\/TC.2004.1268403","volume":"53","author":"R Guerraoui","year":"2004","unstructured":"Guerraoui, R., Raynal, M.: The information structure of indulgent consensus. IEEE Trans. Comput. 53(4), 453\u2013466 (2004)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"MP Herlihy","year":"1991","unstructured":"Herlihy, M.P.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"163\u2013183","key":"13_CR10","first-page":"3","volume":"4","author":"M Loui","year":"1987","unstructured":"Loui, M., Abu-Amara, H.: Memory requirements for agreement among unreliable asynchronous processes. Adv. Comput. Res. 4(163\u2013183), 3\u20135 (1987)","journal-title":"Adv. Comput. Res."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Gafni E.: Round-by-round fault detectors: unifying synchrony and asynchrony. In: Proceedings of the 17th ACM Symposium on Principles of Distributed Computing (PODC), pp. 143\u2013152. ACM Press (1998)","DOI":"10.1145\/277697.277724"},{"issue":"2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L Lamport","year":"1998","unstructured":"Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133\u2013169 (1998)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"4","key":"13_CR13","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1137\/S0097539799364006","volume":"31","author":"Y Moses","year":"2002","unstructured":"Moses, Y., Rajsbaum, S.: A layered analysis of consensus. SIAM J. Comput. 31(4), 989\u20131021 (2002)","journal-title":"SIAM J. Comput."},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Raynal, M.: Concurrent Programming: Algorithms Principles And Foundations, p. 515. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-32027-9. ISBN 978-3-642-32026-2","DOI":"10.1007\/978-3-642-32027-9"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Raynal, M.: Fault-tolerant Message-passing Distributed Systems: An Algorithmic Approach, p. 492. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-94141-7. ISBN 978-3-319-94140-0","DOI":"10.1007\/978-3-319-94141-7"},{"key":"13_CR16","first-page":"423","volume-title":"Synchronization Algorithms And Concurrent Programming","author":"G Taubenfeld","year":"2006","unstructured":"Taubenfeld, G.: Synchronization Algorithms And Concurrent Programming, p. 423. Pearson Education\/Prentice Hall, Hoboken (2006)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Taubenfeld G.: A closer look at fault tolerance. Theor. Comput. Syst. 62(5) :1085\u20131108 (2018). (First version in Proceedings of PODC 2012, 261\u2013270)","DOI":"10.1007\/s00224-017-9779-4"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-030-05529-5_4","volume-title":"Networked Systems","author":"G Taubenfeld","year":"2019","unstructured":"Taubenfeld, G.: Weak failures: definitions, algorithms and impossibility results. In: Podelski, A., Ta\u00efani, F. (eds.) NETYS 2018. LNCS, vol. 11028, pp. 51\u201366. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05529-5_4"},{"issue":"4","key":"13_CR19","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01407859","volume":"18","author":"G Taubenfeld","year":"1989","unstructured":"Taubenfeld, G., Katz, S., Moran, S.: Initial failures in distributed computations. Int. J. Parallel Prog. 18(4), 255\u2013276 (1989). https:\/\/doi.org\/10.1007\/BF01407859","journal-title":"Int. J. Parallel Prog."},{"issue":"128","key":"13_CR20","first-page":"30","volume":"2","author":"K Winkler","year":"2019","unstructured":"Winkler, K., Schmid, S.: An Overview of recent results for consensus in directed dynamic networks. Bull. Eur. Assoc. Theor. Comput. Sci. 2(128), 30 (2019)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21017-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T18:40:04Z","timestamp":1728326404000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21017-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031210167","9783031210174"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21017-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"9 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Clermont-Ferrand","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sss2022.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}