ISE548 Chap.8 Fault Trees and Basic Event Logic
Fault Trees and Basic Event Logic
Work backward from a top event
Fault tree analysis connects one defined bad outcome to combinations of basic events through AND and OR gates. This chapter translates words into logic, tests independence, handles overlap and compares causal branches. Minimal cut sets reveal single points of failure and redundant routes.
A source arithmetic defect is used as a checking lesson: totals must be rebuilt from the printed branch values.
The top event needs an operating boundary and time basis. Each gate is first written as a sentence: every input is required for AND, while any input is sufficient for OR.
Repeated or shared causes are identified before numerical work so the same event is not treated as independent simply because it appears on two branches.
What this chapter covers
- 01
Top-event boundaries
- 02
AND gate multiplication
- 03
OR gate union rules
- 04
Independence and common cause
- 05
Minimal cut sets
- 06
Dominant branches and controls
Worked example · free
Analyse pump overheating
- 3Write both gate expressions.
- 3Calculate each branch.
- 3Add and diagnose the dominant route.
Key terms
- Top Event
- The precisely bounded undesired outcome placed at the head of a fault tree.
- AND Gate
- A logic gate requiring every input event for the output event to occur.
- OR Gate
- A logic gate allowing any listed input event to produce the output event.
- Minimal Cut Set
- A smallest sufficient combination of basic events that can produce the top event.
Fault Trees and Basic Event Logic FAQ
When can AND-gate probabilities be multiplied?
Multiplication is valid for independent events under one time basis. Shared power, environment, maintenance or software can create common cause, so independence must be examined rather than assumed from separate boxes.
How should overlap be handled at an OR gate?
For events that can occur together, add their probabilities and subtract the intersection to avoid double counting. Direct addition is appropriate only when the inputs are mutually exclusive or a justified rare-event approximation is stated.
What is the practical value of a minimal cut set?
It exposes the smallest combinations capable of creating the top event, including single points of failure and shared causes. Controls can then be attached to a specific set instead of being recommended vaguely.
How should an OR gate with overlapping events be calculated?
Add the two event probabilities and subtract their intersection so joint occurrence is not counted twice. The simple sum is valid only when inputs are mutually exclusive, while a rare-event approximation should be labelled as an approximation. Explain what overlap means operationally and preserve the same time basis for every term before calculating the gate.
Why is independence a claim rather than a default?
Multiplying inputs at an AND gate assumes the events do not share a cause that changes their joint occurrence. Components can share power, calibration, environment, software or maintenance. Search for those links and add a common-cause event or conditional model when needed. Apparent redundancy can disappear when the same condition defeats both barriers.
How do I find the dominant branch without ignoring severe tails?
Calculate or compare each minimal cut set under consistent assumptions and identify the largest contributor. Use that comparison to focus action, then separately review high-consequence paths, common causes and controls that influence several sets. Dominance is a prioritisation aid, not permission to delete smaller routes. Record the uncertainty if input quality cannot support a precise ranking.
What should change after a barrier is implemented?
Redraw the affected branch and rebuild the cut sets. The action may remove one basic event, reduce its probability, weaken several routes or introduce a new shared dependency. Recalculate from the revised structure rather than subtracting a guessed percentage from the top event. Preserve the baseline tree so reviewers can see what changed and which verification evidence supports it.
How should a fault-tree result be checked?
Translate each gate back into a sentence, verify the top-event boundary and confirm that every probability uses the same period or demand basis. Recalculate intermediate branches before the final total, inspect overlap at OR gates and challenge independence at AND gates. Finally compare cut sets with the physical system. A correct decimal cannot rescue a tree whose logic or boundary is wrong.
Exam move
Translate five verbal statements into AND or OR gates before using numbers. For each tree, list minimal cut sets and challenge one independence assumption. Recalculate totals from intermediate branch values, then recommend the barrier that weakens the dominant set without creating a new common cause.
Working through Fault Trees and Basic Event Logic in ISE548? Sia is AskSia’s AI Management tutor — ask any ISE548 Fault Trees and Basic Event Logic question and get a clear, step-by-step explanation grounded in how ISE548 is taught and assessed. Read this chapter free, then take your hardest questions to Sia.