{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:34:29Z","timestamp":1725539669607},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642051173"},{"type":"electronic","value":"9783642051180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05118-0_11","type":"book-chapter","created":{"date-parts":[[2009,11,4]],"date-time":"2009-11-04T07:32:03Z","timestamp":1257319923000},"page":"149-164","source":"Crossref","is-referenced-by-count":10,"title":["Looking for the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems: Is ${\\it \\Pi}_k$ the End of the Road?"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Bonnet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/11947950_36","volume-title":"Distributed Computing and Networking","author":"Y. Afek","year":"2006","unstructured":"Afek, Y., Gafni, E., Rajsbaum, S., Raynal, M., Travers, C.: Simultaneous consensus tasks: A tighter characterization of set-consensus. In: Chaudhuri, S., Das, S.R., Paul, H.S., Tirthapura, S. (eds.) ICDCN 2006. LNCS, vol.\u00a04308, pp. 331\u2013341. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Bonnet, F., Raynal, M.: Looking for the Weakest Failure Detector for k-Set Agreement in Message-passing Systems: Is \u03a0 k the End of the Road? Tech. Report #1929, 19 pages, IRISA, Universit\u00e9 de Rennes 1 (France) (May 2009)","key":"11_CR2","DOI":"10.1007\/978-3-642-05118-0_11"},{"doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP Impossibility Results for t-Resilient Asynchronous Computations. In: Proc. 25th ACM Symposium on Theory of Computation (STOC 1993), San Diego, CA, pp. 91\u2013100 (1993)","key":"11_CR3","DOI":"10.1145\/167088.167119"},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T. Chandra","year":"1996","unstructured":"Chandra, T., 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":"4","key":"11_CR5","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T. Chandra","year":"1996","unstructured":"Chandra, T., 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"},{"key":"11_CR6","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. Information and Computation\u00a0105, 132\u2013158 (1993)","journal-title":"Information and Computation"},{"issue":"5","key":"11_CR7","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1145\/355483.355489","volume":"47","author":"S. Chaudhuri","year":"2000","unstructured":"Chaudhuri, S., Herlihy, M., Lynch, N., Tuttle, M.: Tight Bounds for k-Set Agreement. Journal of the ACM\u00a047(5), 912\u2013943 (2000)","journal-title":"Journal of the ACM"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-75142-7_12","volume-title":"Distributed Computing","author":"W. Chen","year":"2007","unstructured":"Chen, W., Zhang, J., Chen, Y., Liu, X.: Weakening failure detectors for k-set agreement via the partition approach. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 123\u2013138. Springer, Heidelberg (2007)"},{"key":"11_CR9","first-page":"85","volume-title":"27th ACM Symp. on Princ. of Distributed Computing (PODC 2008)","author":"C. Delporte-Gallet","year":"2008","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: Sharing is harder than agreeing. In: 27th ACM Symp. on Princ. of Distributed Computing (PODC 2008), pp. 85\u201394. ACM Press, New York (2008)"},{"unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: Shared Memory vs Message Passing. Technical Report2003-77, EPFL Lausanne (2003)","key":"11_CR10"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1145\/1011767.1011818","volume-title":"Proc. 23th 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: Proc. 23th ACM Symposium on Principles of Distributed Computing (PODC 2004), pp. 338\u2013346. ACM Press, New York (2004)"},{"key":"11_CR12","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)"},{"key":"11_CR13","volume-title":"Proc. 28th ACM Symposium on Principles of Distributed Computing (PODC 2009)","author":"C. Delporte-Gallet","year":"2009","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Tielmann, A.: The disagreement power of an adversary. In: Proc. 28th ACM Symposium on Principles of Distributed Computing (PODC 2009). ACM Press, New York (2009)"},{"key":"11_CR14","volume-title":"Proc. 28th ACM Symposium on Principles of Distributed Computing (PODC 2009)","author":"A. Fernandez Anta","year":"2009","unstructured":"Fernandez Anta, A., Rajsbaum, S., Travers, C.: Weakest failure detectors with an edge-laying simulation. In: Proc. 28th ACM Symposium on Principles of Distributed Computing (PODC 2009). ACM Press, New York (2009)"},{"key":"11_CR15","volume-title":"Proc. 28th ACM Symp. on Principles of Distributed Computing (PODC 2009)","author":"E. Gafni","year":"2009","unstructured":"Gafni, E., Kuznetzov, P.: The weakest failure detector for solving k-set agreeemnt. In: Proc. 28th ACM Symp. on Principles of Distributed Computing (PODC 2009). ACM Press, New York (2009)"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s00446-007-0043-z","volume":"20","author":"R. Guerraoui","year":"2008","unstructured":"Guerraoui, R., Kouznetsov, P.: Failure detectors as types boosters. Distributed Computing\u00a020, 343\u2013358 (2008)","journal-title":"Distributed Computing"},{"issue":"2","key":"11_CR17","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00446-005-0141-8","volume":"18","author":"M.P. Herlihy","year":"2005","unstructured":"Herlihy, M.P., Penso, L.D.: Tight Bounds for k-Set Agreement with Limited Scope Accuracy Failure Detectors. Distributed Computing\u00a018(2), 157\u2013166 (2005)","journal-title":"Distributed Computing"},{"issue":"6","key":"11_CR18","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M.P. Herlihy","year":"1999","unstructured":"Herlihy, M.P., Shavit, N.: The Topological Structure of Asynchronous Computability. Journal of the ACM\u00a046(6), 858\u2013923 (1999)","journal-title":"Journal of the ACM"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/BFb0020440","volume-title":"Distributed Algorithms","author":"W.-K. Lo","year":"1994","unstructured":"Lo, W.-K., Hadzilacos, V.: Using failure detectors to solve consensus in asynchronous shared-memory systems. In: Tel, G., Vit\u00e1nyi, P.M.B. (eds.) WDAG 1994. LNCS, vol.\u00a0857, pp. 280\u2013295. Springer, Heidelberg (1994)"},{"issue":"1-2","key":"11_CR20","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0304-3975(97)00303-4","volume":"193","author":"Y. Manabe","year":"1998","unstructured":"Manabe, Y., Baldoni, R., Raynal, M., Aoyagia, S.: K-arbiter: a safe and general scheme for h-out of-k mutual exclusion. Theoretical Computer Science\u00a0193(1-2), 97\u2013112 (1998)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"11_CR21","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s00446-008-0064-2","volume":"21","author":"A. Most\u00e9faoui","year":"2008","unstructured":"Most\u00e9faoui, A., Rajsbaum, S., Raynal, M., Travers, C.: On the Computability Power and the Robustness of Set Agreement-oriented Failure Detector Classes. Distributed Computing\u00a021(3), 201\u2013222 (2008)","journal-title":"Distributed Computing"},{"doi-asserted-by":"crossref","unstructured":"Most\u00e9faoui, A., Raynal, M.: k-Set Agreement with Limited Accuracy Failure Detectors. In: 19th ACM Symp. on Principles of Distributed Computing (PODC 2000), pp. 143\u2013152 (2000)","key":"11_CR22","DOI":"10.1145\/343477.343536"},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1145\/378580.378690","volume-title":"Proc. 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2001)","author":"A. Most\u00e9faoui","year":"2001","unstructured":"Most\u00e9faoui, A., Raynal, M.: Randomized Set Agreement. In: Proc. 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2001), pp. 291\u2013297. ACM Press, New York (2001)"},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1145\/224964.224976","volume-title":"14th ACM Symposium on Principles of Distributed Computing (PODC 1995)","author":"G. Neiger","year":"1995","unstructured":"Neiger, G.: Failure Detectors and the Wait-free Hierarchy. In: 14th ACM Symposium on Principles of Distributed Computing (PODC 1995), pp. 100\u2013109. ACM Press, New York (1995)"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/11945529_2","volume-title":"Principles of Distributed Systems","author":"M. Raynal","year":"2006","unstructured":"Raynal, M., Travers, C.: In search of the holy grail: looking for the weakest failure detector for wait-free set agreement. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol.\u00a04305, pp. 3\u201319. Springer, Heidelberg (2006)"},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1109\/PRDC.2006.59","volume-title":"Proc. 12th IEEE Pacific Rim Int\u2019l Symposium on Dependable Computing (PRDC 2006)","author":"M. Raynal","year":"2006","unstructured":"Raynal, M., Travers, C.: Synchronous Set Agreement: a concise guided tour (including a new algorithm and a list of open problems). In: Proc. 12th IEEE Pacific Rim Int\u2019l Symposium on Dependable Computing (PRDC 2006), pp. 267\u2013274. IEEE Computer Press, Los Alamitos (2006)"},{"unstructured":"Raynal, M.: K-anti-Omega. In: Rump Session at 26th ACM Symposium on Principles of Distributed Computing, PODC 2007 (2007)","key":"11_CR27"},{"issue":"5","key":"11_CR28","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 Journal on Computing\u00a029(5), 1449\u20131483 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR29","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1145\/1400751.1400761","volume-title":"Proc. 27th ACM Symp. on Principles of Distributed Computing (PODC 2008)","author":"P. Zielinski","year":"2008","unstructured":"Zielinski, P.: Anti-Omega: the weakest failure detector for set agreement. In: Proc. 27th ACM Symp. on Principles of Distributed Computing (PODC 2008), pp. 55\u201364. ACM Press, New York (2008)"}],"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-642-05118-0_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:47:46Z","timestamp":1606186066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05118-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642051173","9783642051180"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05118-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}