{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T11:44:10Z","timestamp":1789904650450,"version":"4.0.1"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642108761","type":"print"},{"value":"9783642108778","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10877-8_23","type":"book-chapter","created":{"date-parts":[[2009,12,2]],"date-time":"2009-12-02T02:11:04Z","timestamp":1259719864000},"page":"285-299","source":"Crossref","is-referenced-by-count":8,"title":["Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement"],"prefix":"10.1007","author":[{"given":"Martin","family":"Biely","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Robinson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ulrich","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: On implementing Omega with weak reliability and synchrony assumptions. In: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing, pp. 306\u2013314 (July 2003)","DOI":"10.1145\/872035.872081"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1145\/1011767.1011816","volume-title":"Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC 2004)","author":"M.K. Aguilera","year":"2004","unstructured":"Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Communication-efficient leader election and consensus with limited link synchrony. In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC 2004), St. John\u2019s, Newfoundland, Canada, pp. 328\u2013337. ACM Press, New York (2004)"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1145\/800141.804655","volume-title":"Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Local and global properties in networks of processors (extended abstract). In: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, pp. 82\u201393. ACM, New York (1980)"},{"issue":"4","key":"23_CR4","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1145\/48014.48247","volume":"35","author":"H. Attiya","year":"1988","unstructured":"Attiya, H., Snir, M., Warmuth, M.K.: Computing on an anonymous ring. J. ACM\u00a035(4), 845\u2013875 (1988)","journal-title":"J. ACM"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-540-76627-8_4","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"M. Biely","year":"2007","unstructured":"Biely, M., Hutle, M., Penso, L.D., Widder, J.: Relating stabilizing timing assumptions to stabilizing failure detectors regarding solvability and efficiency. In: Masuzawa, T., Tixeuil, S. (eds.) SSS 2007. LNCS, vol.\u00a04838, pp. 4\u201320. Springer, Heidelberg (2007)"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Biely, M., Robinson, P., Schmid, U.: Weak synchrony models and failure detectors for message passing k-set agreement. Research Report 51\/2009, Technische Universit\u00e4t Wien, Inst. Technische Informatik, 182-2, 1040 Vienna, Austria (2009)","DOI":"10.1007\/978-3-642-10877-8_23"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-540-49823-0_8","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"M. Biely","year":"2006","unstructured":"Biely, M., Widder, J.: Optimal message-driven implementation of Omega with mute processes. In: Datta, A.K., Gradinariu, M. (eds.) SSS 2006. LNCS, vol.\u00a04280, pp. 110\u2013121. Springer, Heidelberg (2006)"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","first-page":"129","volume-title":"SSS 2009","author":"F. Bonnet","year":"2009","unstructured":"Bonnet, F., Raynal, M.: Looking for the weakest failure detector for k-set agreement in message-passing systems: Is \u03a0\n                    k\n                   the end of the road? In: Guerraoui, R., Petit, F. (eds.) SSS 2009. LNCS, vol.\u00a05873, pp. 129\u2013164. Springer, Heidelberg (2009)"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/167088.167119","volume-title":"STOC 1993: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing","author":"E. Borowsky","year":"1993","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: STOC 1993: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pp. 91\u2013100. ACM, New York (1993)"},{"issue":"4","key":"23_CR10","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. Journal of the ACM\u00a043(4), 685\u2013722 (1996)","journal-title":"Journal of the ACM"},{"issue":"2","key":"23_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"Journal of the ACM"},{"issue":"1","key":"23_CR12","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.jalgor.2003.11.001","volume":"51","author":"B. Charron-Bost","year":"2004","unstructured":"Charron-Bost, B., Schiper, A.: Uniform consensus is harder than consensus. J. Algorithms\u00a051(1), 15\u201337 (2004); Also published as Tech. Rep. DSC\/2000\/028, Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne","journal-title":"J. Algorithms"},{"issue":"1","key":"23_CR13","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.\u00a0105(1), 132\u2013158 (1993)","journal-title":"Inf. Comput."},{"key":"23_CR14","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: Shared Memory vs Message Passing. LPD-REPORT 001, Ecole Polytechnique Federale de Lausanne (2003)"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1145\/1011767.1011818","volume-title":"Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC 2004)","author":"C. Delporte-Gallet","year":"2004","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Hadzilacos, V., Kouznetsov, P., Toueg, S.: The weakest failure detectors to solve certain fundamental problems in distributed computing. In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC 2004), pp. 338\u2013346. ACM Press, New York (2004)"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-540-87779-0_8","volume-title":"Distributed Computing","author":"C. Delporte-Gallet","year":"2008","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Tielmann, A.: The weakest failure detector for message passing set-agreement. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 109\u2013120. Springer, Heidelberg (2008)"},{"issue":"1","key":"23_CR17","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"Dolev, D., Dwork, C., Stockmeyer, L.: On the minimal synchronism needed for distributed consensus. Journal of the ACM\u00a034(1), 77\u201397 (1987)","journal-title":"Journal of the ACM"},{"issue":"2","key":"23_CR18","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. Journal of the ACM\u00a035(2), 288\u2013323 (1988)","journal-title":"Journal of the ACM"},{"issue":"2","key":"23_CR19","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"Journal of the ACM"},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1109\/EDCC.2006.11","volume-title":"Proceedings of the Sixth European Dependable Computing Conference (EDCC-6)","author":"M. Fuegger","year":"2006","unstructured":"Fuegger, M., Schmid, U., Fuchs, G., Kempf, G.: Fault-Tolerant Distributed Clock Generation in VLSI Systems-on-Chip. In: Proceedings of the Sixth European Dependable Computing Conference (EDCC-6), pp. 87\u201396. IEEE Computer Society, Los Alamitos (2006)"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Gafni, E., Kuznetsov, P.: The weakest failure detector for solving k-set agreement. In: 28th ACM Symposium on Principles of Distributed Computing (PODC) (2009)","DOI":"10.1145\/1582716.1582735"},{"key":"23_CR22","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1145\/1281100.1281135","volume-title":"Proceedings of the twenty-sixth annual ACM Symposium on Principles of Distributed Computing (PODC 2007)","author":"R. Guerraoui","year":"2007","unstructured":"Guerraoui, R., Herlihy, M., Kouznetsov, P., Lynch, N., Newport, C.: On the weakest failure detector ever. In: Proceedings of the twenty-sixth annual ACM Symposium on Principles of Distributed Computing (PODC 2007), pp. 235\u2013243. ACM, New York (2007)"},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/3-540-61769-8_18","volume-title":"Distributed Algorithms","author":"R. Guerraoui","year":"1996","unstructured":"Guerraoui, R., Schiper, A.: \u201cgamma-accurate\u201d failure detectors. In: Babao\u011flu, \u00d6., Marzullo, K. (eds.) WDAG 1996. LNCS, vol.\u00a01151, pp. 269\u2013286. Springer, Heidelberg (1996)"},{"key":"23_CR24","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1145\/167088.167125","volume-title":"STOC 1993: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing","author":"M. Herlihy","year":"1993","unstructured":"Herlihy, M., Shavit, N.: The asynchronous computability theorem for t-resilient tasks. In: STOC 1993: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pp. 111\u2013120. ACM, New York (1993)"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Hutle, M., Malkhi, D., Schmid, U., Zhou, L.: Chasing the weakest system model for implementing omega and consensus. IEEE Transactions on Dependable and Secure Computing (to appear, 2009)","DOI":"10.1109\/TDSC.2008.24"},{"key":"23_CR26","unstructured":"Larrea, M., Fern\u00e1ndez, A., Ar\u00e9valo, S.: Optimal implementation of the weakest failure detector for solving consensus. In: Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems (SRDS), N\u00fcrnberg, Germany, pp. 52\u201359 (October 2000)"},{"key":"23_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/11561927_16","volume-title":"Distributed Computing","author":"D. Malkhi","year":"2005","unstructured":"Malkhi, D., Oprea, F., Zhou, L.: \u03a9 meets paxos: Leader election and stability without eventual timely links. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 199\u2013213. Springer, Heidelberg (2005)"},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Mostefaoui, A., Mourgaya, E., Raynal, M.: Asynchronous implementation of failure detectors. In: Proceedings of the International Conference on Dependable Systems and Networks (DSN 2003), San Francisco, CA, June 22\u201325 (2003)","DOI":"10.1109\/DSN.2003.1209946"},{"key":"23_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-46691-6_26","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"A. Most\u00e9faoui","year":"1999","unstructured":"Most\u00e9faoui, A., Raynal, M.: Unreliable failure detectors with limited scope accuracy and an application to consensus. In: Pandu Rangan, C., Raman, V., Sarukkai, S. (eds.) FST TCS 1999. LNCS, vol.\u00a01738, pp. 329\u2013340. Springer, Heidelberg (1999)"},{"key":"23_CR30","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/343477.343536","volume-title":"PODC 2000: Proceedings of the 19th annual ACM symposium on Principles of distributed computing","author":"A. Most\u00e9faoui","year":"2000","unstructured":"Most\u00e9faoui, A., Raynal, M.: k-set agreement with limited accuracy failure detectors. In: PODC 2000: Proceedings of the 19th annual ACM symposium on Principles of distributed computing, pp. 143\u2013152. ACM, New York (2000)"},{"key":"23_CR31","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/RELDIS.2004.1353022","volume-title":"Proceedings of the 23rd IEEE Symposium on Reliable Distributed Systems (SRDS 2004)","author":"A. Mostefaoui","year":"2004","unstructured":"Mostefaoui, A., Raynal, M., Travers, C.: Crash-resilient time-free eventual leadership. In: Proceedings of the 23rd IEEE Symposium on Reliable Distributed Systems (SRDS 2004), pp. 208\u2013217. IEEE Computer Society, Los Alamitos (2004)"},{"key":"23_CR32","unstructured":"Raynal, M.: k-anti-\u03a9. Rump session at PODC 2007 (August 2007)"},{"key":"23_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-89335-6_20","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"P. Robinson","year":"2008","unstructured":"Robinson, P., Schmid, U.: The Asynchronous Bounded-Cycle Model. In: Kulkarni, S., Schiper, A. (eds.) SSS 2008. LNCS, vol.\u00a05340, pp. 246\u2013262. Springer, Heidelberg (2008)"},{"issue":"5","key":"23_CR34","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1137\/S0097539796307698","volume":"29","author":"M. Saks","year":"2000","unstructured":"Saks, M., Zaharoglou, F.: Wait-free k-set agreement is impossible: The topology of public knowledge. SIAM J. Comput.\u00a029(5), 1449\u20131483 (2000)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"23_CR35","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/98163.98167","volume":"22","author":"F.B. Schneider","year":"1990","unstructured":"Schneider, F.B.: Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput. Surv.\u00a022(4), 299\u2013319 (1990)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"23_CR36","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s00446-009-0080-x","volume":"22","author":"J. Widder","year":"2009","unstructured":"Widder, J., Schmid, U.: The Theta-Model: Achieving synchrony without clocks. Distributed Computing\u00a022(1), 29\u201347 (2009)","journal-title":"Distributed Computing"},{"key":"23_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-540-75142-7_35","volume-title":"Distributed Computing","author":"P. Zielinski","year":"2007","unstructured":"Zielinski, P.: Automatic classification of eventual failure detectors. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 465\u2013479. Springer, Heidelberg (2007)"},{"key":"23_CR38","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1145\/1400751.1400761","volume-title":"PODC 2008: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing","author":"P. Zielinski","year":"2008","unstructured":"Zielinski, P.: Anti-\u03a9: the weakest failure detector for set agreement. In: PODC 2008: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, pp. 55\u201364. ACM, New York (2008)"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10877-8_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T07:43:08Z","timestamp":1619768588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10877-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108761","9783642108778"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10877-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}