> Term
Fault Tree Analysis (FTA)
A top-down, deductive failure analysis using Boolean logic (AND/OR gates) to trace an undesirable top-level system event back to combinations of component-level faults.
Detailed Explanation
Fault Tree Analysis (FTA) is a formal deductive engineering technique developed in aerospace and reliability engineering. It starts with an undesirable high-level failure condition (the "Top Event") and works backward using Boolean logic gates (AND gates where all inputs must fail; OR gates where any single failure triggers the event).
In distributed software architectures, FTA enables engineers to model redundant systems accurately—distinguishing between single points of failure (OR gates) and resilient architectures where multiple independent barriers must fail simultaneously (AND gates).
Why It Matters
Formally proves whether system redundancy actually works and identifies minimal cut sets that can trigger catastrophic cascading failures.
Common Failure Mode
Practical Example
Production Manifestation
Boolean logic trees with AND/OR gates in safety-critical system postmortems and architectural verification reports.
Frequently Asked Questions
What is Fault Tree Analysis (FTA) in short?
A top-down, deductive failure analysis using Boolean logic (AND/OR gates) to trace an undesirable top-level system event back to combinations of component-level faults.
What is the most common failure mode?
Constructing trees with hidden common-cause failures (e.g. assuming two database replicas are independent when both rely on the same underlying EBS volume).
AI Summary
A top-down, deductive failure analysis using Boolean logic (AND/OR gates) to trace an undesirable top-level system event back to combinations of component-level faults. Formally proves whether system redundancy actually works and identifies minimal cut sets that can trigger catastrophic cascading failures.