Automatic Transformations from Crash-Stop to Permanent Omission

Carole Delporte-Gallet (1) , Hugues Fauconnier (1) , Felix Freiling (2) , Lucia Draque Penso (2) , Andreas Tielmann (1)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
2 Laboratory of Dependable Distributed Systems

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 Omega CHT 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 FFPBK06, FHP05, A05.

Mots clés: Fault-Tolerance; Weakest failure deectors; Transformations; Asynchronous Systems; Crashstop; Permanent Omission

Domaines: Informatique

Carole Delporte-Gallet, Hugues Fauconnier, Felix Freiling, Lucia Draque Penso, Andreas Tielmann. Automatic Transformations from Crash-Stop to Permanent Omission. 2007. ⟨hal-00160626v2⟩