From crash-stop to permanent omission: Automatic transformation and weakest failure detectors

5Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

This paper studies the impact of omission failures on asynchronous distributed systems with crash-stop failures. We provide two different transformations for algorithms, failure detectors, and problem specifications, one of which is weakest failure detector preserving. We prove that our transformation of failure detector Ω [1] is the weakest failure detector for consensus in environments with crash-stop and permanent omission failures and a majority of correct processes. Our results help to use the power of the well-understood crash-stop model to automatically derive solutions for the general omission model, which has recently raised interest for being noticeably applicable for security problems in distributed environments equipped with security modules such as smartcards [2,3,4]. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Delporte-Gallet, C., Fauconnier, H., Freiling, F. C., Penso, L. D., & Tielmann, A. (2007). From crash-stop to permanent omission: Automatic transformation and weakest failure detectors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4731 LNCS, pp. 165–178). Springer Verlag. https://doi.org/10.1007/978-3-540-75142-7_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free