{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:57:20Z","timestamp":1725487040072},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425229"},{"type":"electronic","value":"9783540447436"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44743-1_10","type":"book-chapter","created":{"date-parts":[[2007,6,29]],"date-time":"2007-06-29T02:23:38Z","timestamp":1183083818000},"page":"98-111","source":"Crossref","is-referenced-by-count":3,"title":["Quiescent Uniform Reliable Broadcast as an Introduction to Failure Detector Oracles"],"prefix":"10.1007","author":[{"given":"Michel","family":"Raynal","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"issue":"6","key":"10_CR1","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1145\/195613.195651","volume":"41","author":"Y. Afek","year":"1994","unstructured":"Afek Y., Attiya H., Fekete A.D., Fischer M., Lynch N., Mansour Y., Wang D. and Zuck L., Reliable Communication over Unreliable Channels. Journal of the ACM, 41(6): 1267\u20131297, 1994.","journal-title":"Journal of the ACM"},{"issue":"6","key":"10_CR2","doi-asserted-by":"publisher","first-page":"2040","DOI":"10.1137\/S0097539798341296","volume":"29","author":"M.K. Aguilera","year":"2000","unstructured":"Aguilera M.K., Chen W. and Toueg S., On Quiescent Reliable Communication. SI AM Journal of Computing, 29(6):2040\u20132073, 2000.","journal-title":"SI AM Journal of Computing"},{"issue":"3","key":"10_CR3","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1137\/S0097539796312915","volume":"28","author":"M.K. Aguilera","year":"1998","unstructured":"Aguilera M.K. and Toueg S., Failure Detection and Randomization: a Hybrid Approach to Solve Consensus. SI AM Journal of Computing, 28(3):890\u2013903, 1998.","journal-title":"SI AM Journal of Computing"},{"key":"10_CR4","series-title":"Lect Notes Comput Sci","first-page":"21","volume-title":"Proc. 13th Int. Symposium on DIStributed Computing (DISC\u201999)","author":"M.K. Aguilera","year":"1999","unstructured":"Aguilera M.K., Toueg S. and Deianov B., Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast. Proc. 13th Int. Symposium on DIStributed Computing (DISC\u201999), Springer-Verlag LNCS #1693, pp. 21\u201334, 1999."},{"key":"10_CR5","unstructured":"Attiya H. and Welch J., Distributed Computing: Fundamentals, Simulations and Advanced Topics, McGraw-Hill, 451 pages, 1998."},{"key":"10_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/3-540-61769-8_8","volume-title":"Proc. 10th Int. Workshop on Distributed Algorithms (now, DISC)","author":"A. Basu","year":"1996","unstructured":"Basu A., Charron-Bost B. and Toueg S., Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes. Proc. 10th Int. Workshop on Distributed Algorithms (now, DISC), Springer-Verlag LNCS #1051, pp. 105\u2013121, 1996."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Or M., Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols. Proc. 2nd ACM Symposium on Principles of Distributed Computing (PODC\u201983), ACM Press, pp. 27\u201330, Montr\u00e9al (Canada), 1983.","DOI":"10.1145\/800221.806707"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/0196-6774(90)90020-F","volume":"11","author":"O. Biran","year":"1990","unstructured":"Biran O., Moran S. and Zaks S., A Combinatorial Characterization of the Distributed 1-Solvable Tasks. Journal of Algorithms, 11:420\u2013440, 1990.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T. Chandra","year":"1996","unstructured":"Chandra T. and Toueg S., Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM, 43(2):225\u2013267, 1996.","journal-title":"Journal of the ACM"},{"issue":"4","key":"10_CR10","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T. Chandra","year":"1996","unstructured":"Chandra T., Hadzilacos V. and Toueg S., The Weakest Failure Detector for Solving Consensus. Journal of the ACM, 43(4):685\u2013722, July 1996.","journal-title":"Journal of the ACM"},{"key":"10_CR11","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, 105:132\u2013158, 1993.","journal-title":"Information and Computation"},{"issue":"3","key":"10_CR12","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D. Dolev","year":"1986","unstructured":"Dolev D., Lynch N., Pinter S., Stark E.W., and Weihl W.E., Reaching Approximate Agreement in the Presence of Faults. Journal of the ACM, 33(3):499\u2013516, 1986.","journal-title":"Journal of the ACM"},{"issue":"5","key":"10_CR13","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1145\/174147.169676","volume":"40","author":"A.D. Fekete","year":"1993","unstructured":"Fekete A.D., Lynch N., Mansour Y. and Spinelli J., The Impossibility of Implementing Reliable Communication in Face of Crashes. Journal of the ACM, 40(5):1087\u20131107, 1993.","journal-title":"Journal of the ACM"},{"issue":"2","key":"10_CR14","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. and Paterson M.S., Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM, 32(2):374\u2013382, 1985.","journal-title":"Journal of the ACM"},{"key":"10_CR15","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R. and Johnson D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman W.H. & Co, New York, 340 pages, 1979."},{"key":"10_CR16","unstructured":"Hadzilacos V. and Toueg S., Reliable Broadcast and Related Problems. In Distributed Systems, ACM Press (S. Mullender Ed.), New-York, pp. 97\u2013145, 1993."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Halpern J.Y. and Ricciardi A., A Knowledge-Theoretic Analysis of Uniform Distributed Coordination and Failure Detectors. Proc. 18th ACM Symposium on Principles of Distributed Computing (PODC\u201999), pp. 73\u201382, Atlanta (GA), 1999.","DOI":"10.1145\/301308.301331"},{"issue":"9","key":"10_CR18","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1109\/71.879773","volume":"11","author":"J.-M. H\u00e9lary","year":"2000","unstructured":"H\u00e9lary J.-M., Hurfin M., Mostefaoui A., Raynal M. and Tronel F., Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors. IEEE Transactions on Parallel and Distributed Systems, 11(9):897\u2013909, 2000.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10_CR19","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft J.E. and Ullman J.D. Introduction to Automata Theory, Languages and Computation. Addison Wesley, Reading (MA), 418 pages, 1979."},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Lynch N., A Hundred Impossibility Proofs for Distributed Computing. Invited Talk, Proc. 8th ACM Symposium on Principles of Distributed Computing (PODC\u201989), ACM Press, pp. 1\u201327, Edmonton (Canada), 1989.","DOI":"10.1145\/72981.72982"},{"key":"10_CR21","volume-title":"Distributed Algorithms","author":"N. Lynch","year":"1996","unstructured":"Lynch N., Distributed Algorithms. Morgan Kaufmann Pub., San Francisco (CA), 872 pages, 1996."},{"key":"10_CR22","volume-title":"Proc. 33rd ACM Symposium on Theory of Computing (STOC\u201901)","author":"A. Mostefaoui","year":"2001","unstructured":"Mostefaoui A., Rajsbaum S. and Raynal M., Conditions on Input Vectors for Consensus Solvability in Asynchronous Distributed Systems. Proc. 33rd ACM Symposium on Theory of Computing (STOC\u201901), ACM Press, Crete (Greece), July 2001."},{"key":"10_CR23","volume-title":"Proc. 20th ACM Symposium on Principles of Distributed Computing (PODC\u201901)","author":"A. Mostefaoui","year":"2001","unstructured":"Mostefaoui A., Rajsbaum S., Raynal M. and Roy M., A Hierarchy of Conditions for Consensus Solvability. Proc. 20th ACM Symposium on Principles of Distributed Computing (PODC\u201901), ACM Press, Newport (RI), August 2001."},{"key":"10_CR24","volume-title":"Research Report #1393","author":"A. Mostefaoui","year":"2001","unstructured":"Mostefaoui A., Rajsbaum S., Raynal M. and Roy M., Condition-Based Protocols for Set Agreement Problems. Research Report #1393, IRISA, University of Rennes, France, April 2001, 21 pages. http:\/\/www.irisa.fr\/bibli\/publi\/pi\/2001\/1393\/1393.html ."},{"key":"10_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/3-540-48169-9_4","volume-title":"Proc. 13th Symp. on DIStributed Computing (DISC\u201999)","author":"A. Mostefaoui","year":"1999","unstructured":"Mostefaoui A. and Raynal M., Solving Consensus Using Chandra-Toueg\u2019s Unreli-able Failure Detectors: a General Quorum-Based Approach. Proc. 13th Symp. on DIStributed Computing (DISC\u201999), Springer Verlag LNCS #1693, pp. 49\u201363, 1999."},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Mostefaoui A. and Raynal M., k-Set Agreement with Limited Accuracy Failure Detectors. Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC\u201900), Portland (OR), pp. 143\u2013152, 2000.","DOI":"10.1145\/343477.343536"},{"key":"10_CR27","series-title":"Research Report","volume-title":"Proc. 13th th ACM Symposium on Parallel Algorithms and Architectures (SPAA\u2019 01)","author":"A. Mostefaoui","year":"2001","unstructured":"Mostefaoui A. and Raynal M., Randomized k-Set Agreement. Proc. 13th th ACM Symposium on Parallel Algorithms and Architectures (SPAA\u2019 01), ACM Press, Crete (Greece), July 2001. Research Report #1340, IRISA, University of Rennes, France, July 2000, 14 pages. http:\/\/www.irisa.fr\/bibli\/publi\/pi\/2000\/1340\/1340.html ."},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Mostefaoui A., Raynal M. and Tronel F., The Best of Both Worlds: a Hybrid Approach to Solve Consensus. Proc. Int. Conference on Dependable Systems and Networks (DSN\u201900, previously FTCS), IEEE Computer Society Press, pp. 513\u2013522, New-York City, June 2000.","DOI":"10.1109\/ICDSN.2000.857584"},{"key":"10_CR29","doi-asserted-by":"publisher","first-page":"9197","DOI":"10.1016\/S0020-0190(99)00136-2","volume":"72","author":"M. Raynal","year":"1999","unstructured":"Raynal M. and Tronel F., Restricted Failure Detectors: Definition and Reduction Protocols. Information Processing Letters, 72:9197, 1999.","journal-title":"Information Processing Letters"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Wang D.-W. and Zuck L.D., Tight Bounds for the Sequence Transmission Problem. Proc. 8th ACM Symposium on Principles of Distributed Computing (PODC\u201989), ACM Press, pp. 73\u201383, Edmonton (Canada), 1989.","DOI":"10.1145\/72981.72986"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Yang J., Neiger G. and Gafni E., Structured Derivations of Consensus Algorithms for Failure Detectors. Proc. 17th ACM Symposium on Principles of Distributed Computing (PODC\u201998), Puerto Vallarta (Mexico), pp. 297\u2013308, 1998.","DOI":"10.1145\/277697.277755"}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44743-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T18:51:05Z","timestamp":1556563865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44743-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425229","9783540447436"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-44743-1_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}