{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:14:24Z","timestamp":1725743664368},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401473"},{"type":"electronic","value":"9783642401480"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40148-0_2","type":"book-chapter","created":{"date-parts":[[2013,8,2]],"date-time":"2013-08-02T01:02:49Z","timestamp":1375405369000},"page":"13-27","source":"Crossref","is-referenced-by-count":0,"title":["Set Agreement and the Loneliness Failure Detector in Crash-Recovery Systems"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Ar\u00e9valo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ernesto","family":"Jim\u00e9nez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s004460050070","volume":"13","author":"M.K. Aguilera","year":"2000","unstructured":"Aguilera, M.K., Chen, W., Toueg, S.: Failure Detection and Consensus in the Crash-Recovery Model. Distributed Computing\u00a013(2), 99\u2013125 (2000)","journal-title":"Distributed Computing"},{"doi-asserted-by":"crossref","unstructured":"Ar\u00e9valo, S., Fern\u00e1ndez Anta, A., Imbs, D., Jim\u00e9nez, E., Raynal, M.: Failure Detectors in Homonymous Distributed Systems (with an Application to Consensus). In: Proc. IEEE 32nd IEEE Int. Conf. on Distributed Computing Systems (ICDCS), pp. 275\u2013284 (2012)","key":"2_CR2","DOI":"10.1109\/ICDCS.2012.13"},{"issue":"4","key":"2_CR3","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.ipl.2010.11.012","volume":"111","author":"S. Ar\u00e9valo","year":"2011","unstructured":"Ar\u00e9valo, S., Jim\u00e9nez, E., Larrea, M., Mengual, L.: Communication-efficient and crash-quiescent Omega with unknown membership. Information Processing Letters\u00a0111(4), 194\u2013199 (2011)","journal-title":"Information Processing Letters"},{"key":"2_CR4","series-title":"LNCS","first-page":"285","volume-title":"OPODIS 2009","author":"M. Biely","year":"2009","unstructured":"Biely, M., Robinson, P., Schmid, U.: Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2009. LNCS, vol.\u00a05923, pp. 285\u2013299. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Bonnet, F., Raynal, M.: Anonymous Asynchronous Systems: The Case of Failure Detectors. Distributed Computing (in press 2013), doi:10.1007\/s00446-012-0169-5","key":"2_CR5","DOI":"10.1007\/s00446-012-0169-5"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/167088.167119","volume-title":"Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC 1993","author":"E. Borowsky","year":"1993","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 91\u2013100. ACM, New York (1993)"},{"issue":"2","key":"2_CR7","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":"2_CR8","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":"2_CR9","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"},{"unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: A Realistic Look At Failure Detectors. In: Proc. 42th International IEEE Conference on Dependable Systems and Networks, DSN 2002, pp. 345\u2013353 (2002)","key":"2_CR10"},{"doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Hadzilacos, V., Kuznetsov, P., Toueg, S.: The Weakest Failure Detectors to Solve Certain Fundamental Problems in Distributed Computing. In: Proceedings of 23th ACM Symp. on Principles of Distrib. Comp., PODC, pp. 338\u2013346 (2004)","key":"2_CR11","DOI":"10.1145\/1011767.1011818"},{"doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Kermarrec, A.M., Ruppert, E., Tran, H.: The Byzantine agreement with homonymous. In: Proceedings of 30th ACM Symp. on Principles of Distrib. Comp., PODC, pp. 21\u201330 (2011)","key":"2_CR12","DOI":"10.1145\/1993806.1993810"},{"key":"2_CR13","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":"2_CR14","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 systems. Journal of the ACM\u00a034(1), 77\u201397 (1987)","journal-title":"Journal of the ACM"},{"issue":"6","key":"2_CR15","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M. Herlihy","year":"1999","unstructured":"Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. Journal of the ACM\u00a046(6), 858\u2013923 (1999)","journal-title":"Journal of the ACM"},{"unstructured":"Hurfin, M., Mostefaoui, A., Raynal, M.: Consensus in asynchronous systems where processes can crash and recover. In: Proceedings of the 17th IEEE Symposium on Reliable Distributed Systems, SRDS 1998, pp. 280\u2013286 (1998)","key":"2_CR16"},{"issue":"2","key":"2_CR17","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.ipl.2006.05.009","volume":"100","author":"E. Jim\u00e9nez","year":"2006","unstructured":"Jim\u00e9nez, E., Ar\u00e9valo, S., Fern\u00e1ndez, A.: Implementing unreliable failure detectors with unknown membership. Information Processing Letters\u00a0100(2), 60\u201363 (2006)","journal-title":"Information Processing Letters"},{"issue":"3","key":"2_CR18","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.jcss.2008.10.002","volume":"75","author":"C. Mart\u00edn","year":"2009","unstructured":"Mart\u00edn, C., Larrea, M., Jim\u00e9nez, E.: Implementing the Omega Failure Detector in the Crash-recovery Failure Model. Journal of Computer and System Sciences\u00a075(3), 178\u2013189 (2009)","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-642-24550-3_26","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"A. Most\u00e9faoui","year":"2011","unstructured":"Most\u00e9faoui, A., Raynal, M., Stainer, J.: Relations Linking Failure Detectors Associated with k-Set Agreement in Message-Passing Systems. In: D\u00e9fago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol.\u00a06976, pp. 341\u2013355. Springer, Heidelberg (2011)"},{"doi-asserted-by":"crossref","unstructured":"Raynal, M.: Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems, 250 pages. Morgan & Claypool Publishers (2010)","key":"2_CR20","DOI":"10.2200\/S00236ED1V01Y201004DCT002"},{"issue":"5","key":"2_CR21","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"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40148-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T04:35:16Z","timestamp":1557981316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40148-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401473","9783642401480"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40148-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}