Paper Info
Title
From crash-stop to permanent omission: automatic transformation and weakest failure detectors
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].
Year
DOI
Venue
2007
10.1007/978-3-540-75142-7_15
DISC
Keywords
Field
DocType
weakest failure detector,security problem,well-understood crash-stop model,failure detector,correct process,permanent omission failure,crash-stop failure,general omission model,derive solution,automatic transformation,omission failure,distributed system,distributed environment,smartcard
Failure detector,Crash,Computer science,Asynchronous distributed systems,Smart card,Real-time computing,Detector,Distributed computing
Conference
Volume
ISSN
ISBN
4731
0302-9743
3-540-75141-6
Citations 
PageRank 
References 
3
0.40
18
Authors
5
Name
Order
Citations
PageRank
Carole Delporte-Gallet172148.96
Hugues Fauconnier272148.96
Felix C. Freiling31415137.30
Lucia Draque Penso419620.46
Andreas Tielmann5583.61