{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:17Z","timestamp":1759637837929,"version":"3.40.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,5,17]],"date-time":"2012-05-17T00:00:00Z","timestamp":1337212800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s00446-012-0169-5","type":"journal-article","created":{"date-parts":[[2012,5,16]],"date-time":"2012-05-16T13:04:43Z","timestamp":1337173483000},"page":"141-158","source":"Crossref","is-referenced-by-count":23,"title":["Anonymous asynchronous systems: the case of failure detectors"],"prefix":"10.1007","volume":"26","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","published-online":{"date-parts":[[2012,5,17]]},"reference":[{"key":"169_CR1","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processes. In: Proc. 12th Symposium on Theory of Computing (STOC\u201980). ACM Press, pp. 82\u201393 (1980)","DOI":"10.1145\/800141.804655"},{"issue":"4","key":"169_CR2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D. Angluin","year":"2006","unstructured":"Angluin D., Aspnes J., Diamadi Z., Fischer M.J., Peralta R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235\u2013253 (2006)","journal-title":"Distrib. Comput."},{"issue":"4","key":"169_CR3","doi-asserted-by":"crossref","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. 35(4), 845\u2013875 (1988)","journal-title":"J. ACM."},{"key":"169_CR4","doi-asserted-by":"crossref","unstructured":"Attiya, H. Welch, J.: Distributed computing, fundamentals, simulation and advanced topics, 2nd edn. Wiley Series on Parallel and Distributed Computing, p. 414 (2004)","DOI":"10.1002\/0471478210"},{"key":"169_CR5","doi-asserted-by":"crossref","unstructured":"Biely, M., Robinson, P., Schmid, U.: Weak synchrony models and failure detectors for message-passing (k) set agreement. In: Proc. 13th Int\u2019l Conference on Principles of Distributed Systems (OPODIS\u201909), Springer-Verlag LNCS #5923, pp. 285\u2013299 (2009)","DOI":"10.1007\/978-3-642-10877-8_23"},{"key":"169_CR6","doi-asserted-by":"crossref","unstructured":"Bonnet, F., Raynal, M.: The price of anonymity: optimal consensus despite asynchrony, crash and anonymity. ACM Trans. Auton. Adapt. Syst. (TAAS). 6(4):Article 23 (2011)","DOI":"10.1145\/2019591.2019592"},{"issue":"4","key":"169_CR7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/j.ipl.2009.11.011","volume":"110","author":"F. Bonnet","year":"2010","unstructured":"Bonnet F., Raynal M.: A simple proof of the necessity of the failure detector \u03a3 to implement an atomic register in asynchronous message-passing systems. Inf. Process. Lett. 110(4), 153\u2013157 (2010)","journal-title":"Inf. Process. Lett."},{"key":"169_CR8","doi-asserted-by":"crossref","unstructured":"Bonnet, F., Raynal, M.: Anonymous asynchronous systems: the case of failure detectors. Tech Report PI 1945, IRISA, Rennes (2010)","DOI":"10.1007\/978-3-642-15763-9_22"},{"issue":"4","key":"169_CR9","doi-asserted-by":"crossref","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. J. ACM. 43(4), 685\u2013722 (1996)","journal-title":"J. ACM."},{"issue":"2","key":"169_CR10","doi-asserted-by":"crossref","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. J. ACM. 43(2), 225\u2013267 (1996)","journal-title":"J. ACM."},{"key":"169_CR11","doi-asserted-by":"crossref","unstructured":"Chothia, T., Chatzikokolakis, K.: A survey of anonymous peer-to-peer file-sharing. In: Proc. Satellite workshop of the Int\u2019l Conference on Embedded and Ubiquitous Systems (EUS\u201905), pp. 744\u2013755 (2005)","DOI":"10.1007\/11596042_77"},{"key":"169_CR12","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: A realistic look at failure detectors. In: Proc. Int\u2019l Conference International on Dependable Systems and Networks (DSN\u201902). IEEE Computer Press, pp. 345\u2013353 (2002)","DOI":"10.1109\/DSN.2002.1028919"},{"key":"169_CR13","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui R.: Tight failure detectors bounds on atomic object implementations. J. ACM. 57(4) (2010). http:\/\/dx.doi.org\/10.1145\/1734213.1734216","DOI":"10.1145\/1734213.1734216"},{"key":"169_CR14","doi-asserted-by":"crossref","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\u201904) ACM Press, pp. 338\u2013346 (2004)","DOI":"10.1145\/1011767.1011818"},{"key":"169_CR15","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Tielmann, A.: The weakest failure detector for message passing set-agreement. In: Proc. 22th Int\u2019l Symposium on Distributed Computing (DISC\u201908), Springer-Verlag LNCS #5218, pp. 109\u2013120 (2008)","DOI":"10.1007\/978-3-540-87779-0_8"},{"key":"169_CR16","doi-asserted-by":"crossref","unstructured":"Durresi, A., Paruchuri, V., Durresi, M., Barolli, L.: A hierarchical anonymous communication protocol for sensor networks. In: Proc. Int\u2019l Conference on Embedded and Ubiquitous Systems (EUS\u201905), Springer Verlag LNCS #3824, pp. 1123\u20131132 (2005)","DOI":"10.1007\/11596356_111"},{"issue":"2","key":"169_CR17","doi-asserted-by":"crossref","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. J. ACM. 32(2), 374\u2013382 (1985)","journal-title":"J. ACM."},{"key":"169_CR18","doi-asserted-by":"crossref","unstructured":"Gifford, D.K.: Weighted voting for replicated data. In: Proc. 7th ACM Symposium on Operating System Principles (SOSP\u201979), ACM Press, pp. 150\u2013172 (1979)","DOI":"10.1145\/800215.806583"},{"issue":"1","key":"169_CR19","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1093\/comjnl\/bxl046","volume":"50","author":"R. Guerraoui","year":"2007","unstructured":"Guerraoui R., Raynal M.: The alpha of indulgent consensus. Comput. J. 50(1), 53\u201367 (2007)","journal-title":"Comput. J."},{"key":"169_CR20","doi-asserted-by":"crossref","unstructured":"Jayanti, P., Toueg, S.: Every problem has a weakest failure detector. In: Proc. 27th ACM Symposium on Principles of Distributed Computing (PODC\u201908), pp. 75\u201384 (2008)","DOI":"10.1145\/1400751.1400763"},{"issue":"2","key":"169_CR21","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/12.262125","volume":"43","author":"T.V. Lakshman","year":"1994","unstructured":"Lakshman T.V., Wei V.K.: Distributed computing on regular networks with anonymous nodes. IEEE Trans. Comput. 43(2), 211\u2013218 (1994)","journal-title":"IEEE Trans. Comput."},{"key":"169_CR22","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Pub., San Francisco, CA, p. 872 (1996)"},{"issue":"3","key":"169_CR23","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s00446-008-0064-2","volume":"21","author":"A. Mostefaoui","year":"2008","unstructured":"Mostefaoui A., Rajsbaum S., Raynal M., Travers C.: On the computability power and the robustness of set agreement-oriented failure detector classes. Distrib. Comput. 21(3), 201\u2013222 (2008)","journal-title":"Distrib. Comput."},{"key":"169_CR24","doi-asserted-by":"crossref","unstructured":"Mostefaoui, A., Rajsbaum, S., Raynal, M., Travers, C.: The combined power of conditions and information on failures to solve asynchronous set agreement. SIAM J. Comput. 38(4), 1574\u20131601 (2008). http:\/\/dx.doi.org\/10.1137\/050645580","DOI":"10.1137\/050645580"},{"key":"169_CR25","doi-asserted-by":"crossref","unstructured":"Mostefaoui, A., Raynal, M.: Solving consensus using Chandra\u2013Toueg\u2019s unreliable failure detectors: a general quorum-based approach. In: Proc. 13th Int\u2019l Symposium on Distributed Computing (DISC\u201999), Springer-Verlag LNCS #1693, pp. 49\u201363 (1999)","DOI":"10.1007\/3-540-48169-9_4"},{"issue":"1","key":"169_CR26","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1142\/S0129626401000452","volume":"11","author":"A. Mostefaoui","year":"2001","unstructured":"Mostefaoui A., Raynal M.: Leader-based consensus. Parallel Process. Lett. 11(1), 95\u2013107 (2001)","journal-title":"Parallel Process. Lett."},{"key":"169_CR27","unstructured":"Raynal, M.: Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems. Morgan & Claypool Publishers, San Francisco, CA, p. 251, ISBN 978-1-60845-293-4 (2010)"},{"issue":"1","key":"169_CR28","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/71.481599","volume":"7","author":"M. Yamashita","year":"1996","unstructured":"Yamashita M., Kameda T.: Computing on anonymous networks: part I-characterizing the solvable cases. IEEE Trans. Parallel Distrib. Syst. 7(1), 69\u201389 (1996)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"169_CR29","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1109\/71.481600","volume":"7","author":"M. Yamashita","year":"1996","unstructured":"Yamashita M., Kameda T.: Computing on anonymous networks: part II-decision and membership problems. IEEE Trans. Parallel Distrib. Syst. 7(1), 90\u201396 (1996)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-012-0169-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-012-0169-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-012-0169-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:24:31Z","timestamp":1743135871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-012-0169-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,17]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["169"],"URL":"https:\/\/doi.org\/10.1007\/s00446-012-0169-5","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2012,5,17]]}}}