{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:08:48Z","timestamp":1725491328359},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540751410"},{"type":"electronic","value":"9783540751427"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75142-7_15","type":"book-chapter","created":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T14:00:46Z","timestamp":1189000846000},"page":"165-178","source":"Crossref","is-referenced-by-count":4,"title":["From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors"],"prefix":"10.1007","author":[{"given":"Carole","family":"Delporte-Gallet","sequence":"first","affiliation":[]},{"given":"Hugues","family":"Fauconnier","sequence":"additional","affiliation":[]},{"given":"Felix C.","family":"Freiling","sequence":"additional","affiliation":[]},{"given":"Lucia Draque","family":"Penso","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Tielmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/135419.135451","volume-title":"PODC 1992","author":"T.D. Chandra","year":"1992","unstructured":"Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. In: Herlihy, M. (ed.) PODC 1992. Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing, Vancouver, BC, Canada, pp. 147\u2013158. ACM Press, New York (1992)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/11863908_3","volume-title":"Computer Security \u2013 ESORICS 2006","author":"M. Fort","year":"2006","unstructured":"Fort, M., Freiling, F., Penso, L.D., Benenson, Z., Kesdogan, D.: Trustedpals: Secure multiparty computation implemented with smartcards. In: Gollmann, D., Meier, J., Sabelfeld, A. (eds.) ESORICS 2006. LNCS, vol.\u00a04189, pp. 34\u201348. Springer, Heidelberg (2006)"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11795490_7","volume-title":"Principles of Distributed Systems","author":"F. Freiling","year":"2006","unstructured":"Freiling, F., Herlihy, M., Penso, L.D.: Optimal randomized omission-tolerant uniform consensus in message passing systems. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol.\u00a03974, Springer, Heidelberg (2006)"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/11408901_5","volume-title":"Dependable Computing - EDCC 2005","author":"G. Avoine","year":"2005","unstructured":"Avoine, G., G\u00e4rtner, F.C., Guerraoui, R., Vukolic, M.: Gracefully degrading fair exchange with security modules. In: Dal Cin, M., Ka\u00e2niche, M., Pataricza, A. (eds.) EDCC 2005. LNCS, vol.\u00a03463, pp. 55\u201371. Springer, Heidelberg (2005)"},{"unstructured":"Hadzilacos, V.: Issues of fault tolerance in concurrent computations (databases, reliability, transactions, agreement protocols, distributed computing). PhD thesis, Harvard University (1985)","key":"15_CR5"},{"issue":"3","key":"15_CR6","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.\u00a012(3), 477\u2013482 (1986)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"3","key":"15_CR7","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Trans. Program. Lang. Syst.\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"doi-asserted-by":"crossref","unstructured":"Chaudhuri, S.: Agreement is harder than consensus: set consensus problems in totally asynchronous systems. In: Proceedings of Principles of Distributed Computing 1990 (1990)","key":"15_CR8","DOI":"10.1145\/93385.93431"},{"issue":"2","key":"15_CR9","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.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"issue":"2","key":"15_CR10","doi-asserted-by":"publisher","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 reliable distributed systems. Journal of the ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"Journal of the ACM"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/3-540-48254-7_7","volume-title":"Dependable Computing - EDDC-3","author":"A. Doudou","year":"1999","unstructured":"Doudou, A., Garbinato, B., Guerraoui, R., \u00e9 Schiper, A.: Muteness failure detectors: Specification and implementation. In: Hlavicka, J., Maehle, E., Pataricza, A. (eds.) Dependable Computing - EDDC-3. LNCS, vol.\u00a01667, pp. 71\u201387. Springer, Heidelberg (1999)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/11560647_26","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2005","author":"C. Delporte-Gallet","year":"2005","unstructured":"Delporte-Gallet, C., Fauconnier, H., Freiling, F.C.: Revisiting failure detection and consensus in omission failure environments. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol.\u00a03722, pp. 394\u2013408. Springer, Heidelberg (2005)"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/3-540-61769-8_8","volume-title":"Distributed Algorithms","author":"A. Basu","year":"1996","unstructured":"Basu, A., Charron-Bost, B., Toueg, S.: Simulating reliable links with unreliable links in the presence of process crashes. In: Babao\u011flu, \u00d6., Marzullo, K. (eds.) WDAG 1996. LNCS, vol.\u00a01151, pp. 105\u2013122. Springer, Heidelberg (1996)"},{"issue":"3","key":"15_CR14","doi-asserted-by":"publisher","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. Journal of Algorithms\u00a011(3), 374\u2013419 (1990)","journal-title":"Journal of Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Pochon, B.: The perfectly-synchronised round-based model of distributed computing. Information & Computation (to appear, 2007)","key":"15_CR15","DOI":"10.1016\/j.ic.2006.11.003"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/3-540-56188-9_12","volume-title":"Distributed Algorithms","author":"R.A. Bazzi","year":"1992","unstructured":"Bazzi, R.A., Neiger, G.: Simulating crash failures with many faulty processors (extended abstract). In: Segall, A., Zaks, S. (eds.) WDAG 1992. LNCS, vol.\u00a0647, pp. 166\u2013184. Springer, Heidelberg (1992)"},{"doi-asserted-by":"crossref","unstructured":"Dolev, D., Friedman, R., Keidar, I., Malkhi, D.: Brief announcement: Failure detectors in omission failure environments. In: Symposium on Principles of Distributed Computing, p. 286 (1997)","key":"15_CR17","DOI":"10.1145\/259380.259501"},{"unstructured":"Delporte-Gallet, C., Fauconnier, H., Freiling, F., Penso, L.D., Tielmann, A.: Automatic transformations from crash-stop to permanent omission. HAL archives ouvertes, hal-00160626 (2007)","key":"15_CR18"},{"issue":"2","key":"15_CR19","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/BF01667080","volume":"2","author":"T.K. Srikanth","year":"1987","unstructured":"Srikanth, T.K., Toueg, S.: Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distributed Computing\u00a02(2), 80\u201394 (1987)","journal-title":"Distributed Computing"},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1145\/1011767.1011818","volume-title":"PODC 2004","author":"C. Delporte-Gallet","year":"2004","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: PODC 2004. Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pp. 338\u2013346. ACM Press, New York (2004)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75142-7_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:52:35Z","timestamp":1619520755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75142-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540751410","9783540751427"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75142-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}