Optimal implementation of the weakest failure detector for solving consensus (brief announcement)
Mikel Larrea, Antonio Fernández Anta, Sergio Arévalo · 2000
Unreliable failure detectors were introduced by Chandra and Toueg [2] as a mechanism that provides (possibly incorrect) information about process failures. They showed how unreliable failure detectors can be used to solve the Consensus problem in asynchronous systems. They also showed in [1] that one of the classes of failure detectors they defined, namely Eventually Strong (⋄S), is the weakest class allowing to solve Consensus1.