{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:06Z","timestamp":1750307706930,"version":"3.41.0"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2008,11,1]],"date-time":"2008-11-01T00:00:00Z","timestamp":1225497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Auton. Adapt. Syst."],"published-print":{"date-parts":[[2008,11]]},"abstract":"<jats:p>An indulgent algorithm is a distributed algorithm that, besides tolerating process failures, also tolerates unreliable information about the interleaving of the processes. This article presents a general characterization of indulgence in an abstract computing model that encompasses various communication and resilience schemes. We use our characterization to establish several results about the inherent power and limitations of indulgent algorithms.<\/jats:p>","DOI":"10.1145\/1452001.1452010","type":"journal-article","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T15:32:31Z","timestamp":1228923151000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["A general characterization of indulgence"],"prefix":"10.1145","volume":"3","author":[{"given":"R.","family":"Guerraoui","sequence":"first","affiliation":[{"name":"Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne"}]},{"given":"N.","family":"Lynch","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology"}]}],"member":"320","published-online":{"date-parts":[[2008,12,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90056-0"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200869"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/800221.806707"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/234533.234549"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226647"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1043"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571838"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2005.57"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/343477.343630"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00171-X"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s446-002-8027-4"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.1268403"},{"key":"e_1_2_1_15_1","first-page":"97","article-title":"Fault-tolerant broadcasts and related problems. In Distributed Systems, S. J. Mullender, Ed. Addison-Wesley","volume":"5","author":"Hadzilacos V.","year":"1993","unstructured":"Hadzilacos , V. and Toueg , S. 1993 . Fault-tolerant broadcasts and related problems. In Distributed Systems, S. J. Mullender, Ed. Addison-Wesley , Chapter 5 , 97 -- 145 . Hadzilacos, V. and Toueg, S. 1993. Fault-tolerant broadcasts and related problems. In Distributed Systems, S. J. Mullender, Ed. Addison-Wesley, Chapter 5, 97--145.","journal-title":"Chapter"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146408"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1977.229904"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675439"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_2_1_22_1","unstructured":"Lynch N. A. 1996. Distributed Algorithms. Morgan Kaufmann.   Lynch N. A. 1996. Distributed Algorithms. Morgan Kaufmann."},{"volume-title":"Proceedings of the IEEE International Symposium on Reliable Distributed Systems (SRDS). IEEE Computer Society","author":"Mostefaoui A.","key":"e_1_2_1_23_1","unstructured":"Mostefaoui , A. , Raynal , M. , and Travers , C . 2004. Crash-resilient time-free eventual leadership . In Proceedings of the IEEE International Symposium on Reliable Distributed Systems (SRDS). IEEE Computer Society , Los Alamitos, CA, 208--217. Mostefaoui, A., Raynal, M., and Travers, C. 2004. Crash-resilient time-free eventual leadership. In Proceedings of the IEEE International Symposium on Reliable Distributed Systems (SRDS). IEEE Computer Society, Los Alamitos, CA, 208--217."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2005.16"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/582318.582339"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2006.21"},{"volume-title":"Proceedings of the IEEE International Symposium on Reliable Distributed Systems (SRDS). IEEE Computer Society","author":"Vicente P.","key":"e_1_2_1_27_1","unstructured":"Vicente , P. and Rodrigues , L . 2002. An indulgent uniform total order broadcast algorithm with optimistic delivery . In Proceedings of the IEEE International Symposium on Reliable Distributed Systems (SRDS). IEEE Computer Society , Los Alamitos, CA, 92--80. Vicente, P. and Rodrigues, L. 2002. An indulgent uniform total order broadcast algorithm with optimistic delivery. In Proceedings of the IEEE International Symposium on Reliable Distributed Systems (SRDS). IEEE Computer Society, Los Alamitos, CA, 92--80."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.06.008"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11408901_3"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPDC.2006.37"}],"container-title":["ACM Transactions on Autonomous and Adaptive Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1452001.1452010","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1452001.1452010","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:06Z","timestamp":1750253406000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1452001.1452010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["10.1145\/1452001.1452010"],"URL":"https:\/\/doi.org\/10.1145\/1452001.1452010","relation":{},"ISSN":["1556-4665","1556-4703"],"issn-type":[{"type":"print","value":"1556-4665"},{"type":"electronic","value":"1556-4703"}],"subject":[],"published":{"date-parts":[[2008,11]]},"assertion":[{"value":"2007-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-12-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}