Perfect failure detector
A perfect failure detector eventually and permanently suspects every crashed process at every correct process, without suspecting any process before it crashes.
Class P combines strong completeness with strong accuracy in Chandra and Toueg's crash-stop model. A correct process never crashes during the modeled run; a crashed process does not recover. Strong completeness concerns every crashed process and every correct observer, not just one observer. [1]
Strong accuracy forbids premature suspicion even of a process that will crash later. Completeness is eventual: the class alone specifies neither immediate detection nor a numerical detection deadline. An eventually perfect detector relaxes accuracy by allowing initial mistakes. [1]
These are properties of detector histories in a stated system model, not a certification obtained from a heartbeat sample. Arbitrarily delayed messages prevent a timeout alone from distinguishing a crash from a slow process in a fully asynchronous system. Timing assumptions must be supplied separately. [1]
Relations
- related
- Failure detector, Eventually perfect failure detector, Partial synchrony, FLP impossibility, Fail-stop processor, Crash-stop failure model
Limitations
- These crash-stop process properties do not certify storage health, establish Byzantine fault tolerance, cover recovery after restart or enforce fencing against a stale writer. [1]
Citations
Sources & caveats
- CT1996 sections 2.1-2.4 define the crash-stop model, completeness, accuracy and class P. This entry is a source synthesis, not a measured implementation or a recovery-protocol guarantee.