{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:35:11Z","timestamp":1782970511175,"version":"3.54.5"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T00:00:00Z","timestamp":1238544000000},"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":[[2009,4]]},"DOI":"10.1007\/s00446-009-0084-6","type":"journal-article","created":{"date-parts":[[2009,7,7]],"date-time":"2009-07-07T14:55:49Z","timestamp":1246978549000},"page":"49-71","source":"Crossref","is-referenced-by-count":158,"title":["The Heard-Of model: computing in distributed systems with benign faults"],"prefix":"10.1007","volume":"22","author":[{"given":"Bernadette","family":"Charron-Bost","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andr\u00e9","family":"Schiper","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,7,8]]},"reference":[{"key":"84_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Or, M. : Another advantage of free choice: Completely asynchronous agreement protocols. In: Proceedings of the Second ACM Symposium on Principles of Distributed Computing, pp. 27\u201330 (1983)","DOI":"10.1145\/800221.806707"},{"key":"84_CR2","doi-asserted-by":"crossref","unstructured":"Biely, M., Charron-Bost, B., Gaillard, A., Hutle, M., Schiper, A., Widder, J.: Tolerating corrupted communications. In: Proceedings of the Twentysixth ACM Symposium on Principles of Distributed Computing, pp. 244\u2013253 (2007)","DOI":"10.1145\/1281100.1281136"},{"key":"84_CR3","doi-asserted-by":"crossref","unstructured":"Brasileiro, F., Greve, F., Most\u00e9faoui, A., Raynal, M.: Consensus in one communication step. In: 6th International Conference Parallel Computing Technologies (PaCT), pp. 42\u201350. Springer, LNCS 2127 (2001)","DOI":"10.1007\/3-540-44743-1_4"},{"issue":"4","key":"84_CR4","doi-asserted-by":"crossref","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. J. ACM 43(4), 685\u2013722 (1996)","journal-title":"J. ACM"},{"issue":"2","key":"84_CR5","doi-asserted-by":"crossref","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 asynchronous systems. J. ACM 43(2), 225\u2013267 (1996)","journal-title":"J. ACM"},{"issue":"1","key":"84_CR6","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/BF01843569","volume":"1","author":"K.M. Chandy","year":"1986","unstructured":"Chandy K.M., Misra J.: How processes learn. Distrib. Comput. 1(1), 40\u201352 (1986)","journal-title":"Distrib. Comput."},{"key":"84_CR7","unstructured":"Charron-Bost, B., Hutle, M., Widder, J.: In search of lost time. Technical Report LSR\/2008-006, EPFL (2008)"},{"key":"84_CR8","unstructured":"Charron-Bost, B., Merz, S.: Formal verification of a Consensus algorithm in the Heard-Of model. TR 20009\/07, LIX (2009)"},{"key":"84_CR9","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/(SICI)1097-0037(199607)27:4<309::AID-NET5>3.0.CO;2-K","volume":"27","author":"B.S. Chlebus","year":"1996","unstructured":"Chlebus B.S., Dicks K., Pelc A.: Broadcasting in synchronous networks with dynamic faults. Networks 27, 309\u2013318 (1996)","journal-title":"Networks"},{"key":"84_CR10","first-page":"443","volume":"5","author":"B. Chor","year":"1989","unstructured":"Chor B., Dwork C.: Randomization in byzantine agreement. Adv. Comput. Res. 5, 443\u2013497 (1989)","journal-title":"Adv. Comput. Res."},{"issue":"4","key":"84_CR11","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/j.jda.2004.04.004","volume":"2","author":"S. Dobrev","year":"2004","unstructured":"Dobrev S.: Computing input multiplicity in anonymous synchronous networks with dynamic faults. J. Discrete Algorithms 2(4), 425\u2013438 (2004)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"84_CR12","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D. Dolev","year":"1982","unstructured":"Dolev D.: The Byzantine generals strike again. J. Algorithms 3(1), 14\u201330 (1982)","journal-title":"J. Algorithms"},{"issue":"1","key":"84_CR13","doi-asserted-by":"crossref","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. J. ACM 34(1), 77\u201397 (1987)","journal-title":"J. ACM"},{"issue":"4","key":"84_CR14","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1145\/96559.96565","volume":"37","author":"D. Dolev","year":"1990","unstructured":"Dolev D., Reischuk R., Strong H.R.: Early stopping in Byzantine agreement. J. ACM 37(4), 720\u2013741 (1990)","journal-title":"J. ACM"},{"key":"84_CR15","doi-asserted-by":"crossref","unstructured":"Dolev, D., Strong, H.R.: Polynomial algorithms for multiple processor agreement. In: Proceedings of the Fourteenth ACM Symposium on Theory of Computing, pp. 401\u2013407. ACM Press, New York (1982)","DOI":"10.1145\/800070.802215"},{"issue":"4","key":"84_CR16","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D. Dolev","year":"1983","unstructured":"Dolev D., Strong H.R.: Authenticated algorithms for Byzantine agreement. SIAM J. Comput. 12(4), 656\u2013666 (1983)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"84_CR17","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork C., Lynch N.A., Stockmeyer L.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"key":"84_CR18","doi-asserted-by":"crossref","unstructured":"Elrad, T.E., Francez, N.: Decomposition of distributed programs into communication-closed-layers. Sci. Comput. Progr. 2(3), April 1982","DOI":"10.1016\/0167-6423(83)90013-8"},{"key":"84_CR19","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"M.J. Fischer","year":"1982","unstructured":"Fischer M.J., Lynch N.A.: A lower bound for the time to assure interactive consistency. Inf. Process. Lett. 14, 183\u2013186 (1982)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"84_CR20","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"},{"issue":"3","key":"84_CR21","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(91)90105-Q","volume":"39","author":"P. Fraigniaud","year":"1991","unstructured":"Fraigniaud P., Peyrat C.: Broadcasting in a hypercube when some calls fail. Inf. Process. Lett. 39(3), 115\u2013119 (1991)","journal-title":"Inf. Process. Lett."},{"key":"84_CR22","doi-asserted-by":"crossref","unstructured":"Gafni, E.: Round-by-round fault detectors: unifying synchrony and asynchrony. In: Proceedings of the Seventeenth ACM Symposium on Principles of Distributed Computing, pp. 143\u2013152 (1998)","DOI":"10.1145\/277697.277724"},{"key":"84_CR23","doi-asserted-by":"crossref","unstructured":"Gopal, A., Toueg, S.: Reliable broadcast in synchronous and asynchronous environments (preliminary version). In: Bermond, J.-C., Raynal, M. (eds.) Proceedings of the Third International Workshop on Distributed Algorithms. Lecture Notes on Computer Science, vol. 392, pp. 110\u2013123. Springer, Heidelberg (1989)","DOI":"10.1007\/3-540-51687-5_36"},{"key":"84_CR24","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S., Tuttle, M.: Unifying synchronous and asynchronous message-passing models. In: Proceedings of the Seventeenth ACM Symposium on Principles of Distributed Computing, pp. 123\u2013132 (1998)","DOI":"10.1145\/277697.277722"},{"key":"84_CR25","doi-asserted-by":"crossref","unstructured":"Keidar, I., Shraer, A.: Timeliness, failure-detectors, and consensus performance. In: ACM Symposium on Principles of Distributed Computing, pp. 169\u2013178 (2006)","DOI":"10.1145\/1146381.1146408"},{"key":"84_CR26","unstructured":"Kralovic, R., Kralovic, R., Ruzicka, P.: Broadcasting with many faulty links. In: SIROCCO, pp. 211\u2013222 (2003)"},{"issue":"2","key":"84_CR27","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L. Lamport","year":"1998","unstructured":"Lamport L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133\u2013169 (1998)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"2","key":"84_CR28","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s00446-006-0005-x","volume":"19","author":"L. Lamport","year":"2006","unstructured":"Lamport L.: Fast Paxos. Distrib. Comput. 19(2), 79\u2013103 (2006)","journal-title":"Distrib. Comput."},{"key":"84_CR29","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch N.A.: Distributed Algorithms. Morgan Kaufmann, Menlo Park (1996)"},{"key":"84_CR30","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Oprea, F., Zhou, L.: \u03a9 meets Paxos: leader election and stability without eventual timely links. In: International Conference on Distributeed Computing (DISC), pp. 199\u2013213 (2005)","DOI":"10.1007\/11561927_16"},{"key":"84_CR31","unstructured":"Merritt, M.J.: Unpublished Notes (1985)"},{"issue":"4","key":"84_CR32","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1137\/S0097539799364006","volume":"31","author":"Y. Moses","year":"2002","unstructured":"Moses Y., Rajsbaum S.: A layered analysis of consensus. SIAM J. Comput. 31(4), 989\u20131021 (2002)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"84_CR33","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/0196-6774(90)90019-B","volume":"11","author":"G. Neiger","year":"1990","unstructured":"Neiger G., Toueg S.: Automatically increasing the fault-tolerance of distributed algorithms. J. Algorithms 11(3), 374\u2013419 (1990)","journal-title":"J. Algorithms"},{"issue":"2","key":"84_CR34","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"Pease M., Shostak R., Lamport L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"84_CR35","doi-asserted-by":"crossref","unstructured":"Pedone, F., Schiper, A., Urban, P., Cavin, D.: Solving agreement problems with weak ordering oracles. In: Proceedings of the 4th European Dependable Computing Conference (EDCC-4), LNCS-2485, pp. 44\u201361, Toulouse, France. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-36080-8_5"},{"issue":"3","key":"84_CR36","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1109\/TSE.1986.6312888","volume":"12","author":"K.J. Perry","year":"1986","unstructured":"Perry K.J., Toueg S.: Distributed agreement in the presence of processor and communication faults. IEEE Trans. Softw. Eng. 12(3), 477\u2013482 (1986)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"84_CR37","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.tcs.2007.04.036","volume":"384","author":"N. Santoro","year":"2007","unstructured":"Santoro N., Widmayer P.: Agreement in synchronous networks with ubiquitous faults. Theor. Comput. Sci. 384, 232\u2013249 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"84_CR38","doi-asserted-by":"crossref","unstructured":"Santoro, N., Widmayer, P.: Time is not a healer. In: Proceedings of the 6th Symposium on Theor. Aspects of Computer Science, pp. 304\u2013313, Paderborn, Germany (1989)","DOI":"10.1007\/BFb0028994"},{"key":"84_CR39","doi-asserted-by":"crossref","unstructured":"Santoro, N., Widmayer, P.: Distributed function evaluation in the presence of transmission faults. In: SIGAL International Symposium on Algorithms, pp. 358\u2013367 (1990)","DOI":"10.1007\/3-540-52921-7_85"},{"key":"84_CR40","doi-asserted-by":"crossref","unstructured":"Santoro, N., Widmayer, P.: Majority and unanimity in synchronous networks with ubiquitous dynamic faults. In: Proceedings of the 12th International Colloquium SIROCCO. Lecture Notes on Computer Science, vol. 3499, pp. 262\u2013276, Mont Saint Michel, France. Springer, Heidelberg (2005)","DOI":"10.1007\/11429647_21"},{"key":"84_CR41","doi-asserted-by":"crossref","unstructured":"Schmid, U.: How to model link failures: A perception-based fault model. In: IEEE International Conference on Dependable Systems and Networks (DSN), pp. 57\u201366 (2001)","DOI":"10.1109\/DSN.2001.941391"},{"key":"84_CR42","doi-asserted-by":"crossref","unstructured":"Tsuchiya, T., Schiper, A.: Using bounded model checking to verify consensus algorithms. In: International Conference on Distributeed Computing (DISC), pp. 466\u2013480 (2008)","DOI":"10.1007\/978-3-540-87779-0_32"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-009-0084-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-009-0084-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-009-0084-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:26:43Z","timestamp":1559136403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-009-0084-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["84"],"URL":"https:\/\/doi.org\/10.1007\/s00446-009-0084-6","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,4]]}}}