Professional Documents
Culture Documents
An Introduction To Fault Tree Analysis (FTA) : Objectives
An Introduction To Fault Tree Analysis (FTA) : Objectives
Analysis (FTA)
Dr Jane Marshall
Product Excellence using 6 Sigma
Module
Objectives
– Understand purpose of FTA
– Understand & apply rules of FTA
– Analyse a simple system using FTA
– Understand & apply rules of Boolean algebra
1
Relationship between FMEA
& FTA
Product Failure
Part Failure
2
Fault tree analysis (FTA)
• Key elements:
– Gates represent the outcome
– Events represent input to the gates
• FTA is used to:
– investigate potential faults;
– its modes and causes;
– and to quantify their contribution to system unreliability in the
course of product design .
Symbols
Basic Event
A B A B
A∩B AUB
3
Example Fault Tree
A developed Tree … .. Top event
•A
•A
1 2 2 3 4 5 5 6 7 8
1 3 4 6
1 2
9 10 7 8 9
Source: http://www.ntnu.no/ross/srt/slides/fta.pdf
4
Example: redundant fire pumps
Source: http://www.ntnu.no/ross/srt/slides/fta.pdf
Example
5
Example
Methodology (Preliminary
Analysis)
6
Methodology (Rules)
Methodology (Rules - 1) –
immediate, necessary and sufficient
cause
Immediate
7
Methodology (Rules - 2) – The
clear statement rule
8
Methodology (Rules - 4) – no
miracles rule
9
Methodology (Rules - 6) no gate
to gate rule
Connector A
Switch
Battery Motor
….. Motor does not
Connector B
run when switch is
pressed
10
Fault Tree Example
Motor does not
run
Switch No
malfunction connection Battery
is dead
Qualitative Analysis
(Combination of Gates)
Q
11
Qualitative Analysis
(Cut Sets)
Q=(AD ) (AB) ( C D ) (C B)
Q= (A•D ) +(A• B) +( C • D )+( C • B)
… which is a listing of Groupings ...each of
which is a Cut Set A C D B
AD AB CD BC
12
Qualitative Analysis
(Minimal Cut Sets)
Qualitative Analysis
(Boolean Algebra)
Commutative laws Commutative laws
AB=BA A•B=B•A
AB=BA A + B = B +A
Associative laws Associative laws
A (B C) = (A B) C A • (B • C) = (A • B) • C
A (B C) = (A B) C A + (B + C) = (A + B) + C
Distributive laws Distributive laws
A (B C) = A B A C A • (B + C) = A • B + A • C
A (B C) = (A B) (A C) A + (B • C) = (A + B) • (A + C)
13
Qualitative Analysis
(Boolean Reduction)
Idempotent laws Top event
A•A=A
A +A = A
A
Absorption law
A + (A • B) = A
B A
A B AC DB D C
A C D B
14
Solution …..
( A B ) (( A C ) ( D B )) ( D C )
(A+B)•(A•C+D•B)•D•C
AACDC + ADBDC + BACDC + BDBDC
ACD + ABCD + ABCD + BCD
ACD + BCD
Minimal Cut Sets …… ACD, BCD
Hint .....
AND Gates at the top of the Fault Tree increase the number of
components in a Cut Set
OR Gates increase the number of Cut Sets, but often lead to single
component Sets
15
Benefits and limitations
• Prepared in early stages of a design and further developed in
detail concurrently with design development.
• Identifies and records systematically the logical fault paths from a
specific effect, to the prime causes
• Allows easy conversion to probability measures
• But may lead to very large trees if the analysis is extended in
depth.
• Depends on skill of analyst
• Difficult to apply to systems with partial success
• Can be costly in time & effort
Software
• Software packages available for reliability tools
• Relex
• Relia soft
• others
16
Exercise 1
One
Possible
Solution
17
RBD of an engine
LV HV
Ignition system 1
Fuel Fuel Other
pump filter Jet components
LV HV
Ignition system 2
PEUSS 2011/2012 FTA Page 35
18