Failure detector¶
A distributed-system abstraction that supplies processes with possibly fallible suspicions about crashed peers, classified by completeness and accuracy guarantees.
Core Idea¶
A failure detector encapsulates extra timing or oracle information needed to reason about failures that pure asynchrony cannot distinguish from delay. Local observations produce evolving suspicion sets; detector classes specify which real crashes are eventually suspected and which correct processes avoid permanent false suspicion. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.
The load-bearing residual is not the broad topic of distributed computing. It is A distributed-system abstraction that supplies processes with possibly fallible suspicions about crashed peers, classified by completeness and accuracy guarantees.
Scope of Application¶
Failure detector belongs to distributed computing and is useful where the analyst can specify asynchronous processes, crash failures, monitoring module, suspicion outputs, timing assumptions, completeness, accuracy and consensus algorithm, then evaluate the suspicion history satisfies the declared completeness and accuracy properties under the stated failure and timing model. The scope is broad within that domain but bounded by the need for the suspicion history satisfies the declared completeness and accuracy properties under the stated failure and timing model. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.
Clarity¶
The abstraction clarifies a crowded vocabulary by making the suspicion history satisfies the declared completeness and accuracy properties under the stated failure and timing model the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Failure detector can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.
Manages Complexity¶
Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Failure detector. Failure detector compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.
Abstract Reasoning¶
- Identify the carrier. State what the elements, states, objects, or observations are: asynchronous processes, crash failures, monitoring module, suspicion outputs, timing assumptions, completeness, accuracy and consensus algorithm. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the suspicion history satisfies the declared completeness and accuracy properties under the stated failure and timing model independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of distributed computing because they reuse asynchronous processes, crash failures, monitoring module, suspicion outputs, timing assumptions, completeness, accuracy and consensus algorithm, Local observations produce evolving suspicion sets; detector classes specify which real crashes are eventually suspected and which correct processes avoid permanent false suspicion., and type the carrier, state every parameter and convention in the definition, test that the suspicion history satisfies the declared completeness and accuracy properties under the stated failure and timing model, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Failure detector Domain-specific
Parents (1) — more general patterns this builds on
-
Failure detector is a kind of Fault Tolerance Prime
The proposed strict upward parent is
prime:fault_tolerance.
Hierarchy paths (3) — routes to 3 parentless roots
- Failure detector → Fault Tolerance → Robustness
- Failure detector → Fault Tolerance → Reserve → Mobilization → Latent Realizable Capacity
- Failure detector → Fault Tolerance → Reserve → Economy Of Force → Allocation → Scarcity → Constraint
Neighborhood in Abstraction Space¶
Failure detector sits in a moderately populated region (54th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Unclustered & Miscellaneous (1565 abstractions)
Nearest neighbors
- Terminating Reliable Broadcast — 0.91
- Fault detection and isolation — 0.89
- Failure cause — 0.87
- Happened-before — 0.87
- Run chart — 0.87
Computed from structural-signature embeddings · 2026-09-08