An Introduction To Fault Tree Analysisi (FTA)
An Introduction To Fault Tree Analysisi (FTA)
Analysis (FTA)
Dr Jane Marshall
Product Excellence using 6 Sigma
Module
PEUSS 2011/2012
FTA
Page 1
Objectives
Understand purpose of FTA
Understand & apply rules of FTA
Analyse a simple system using FTA
Understand & apply rules of Boolean algebra
PEUSS 2011/2012
FTA
Page 2
PEUSS 2011/2012
FTA
Page 3
PEUSS 2011/2012
FTA
Page 4
PEUSS 2011/2012
FTA
Page 5
Symbols
Basic Event
AND Gate
OR Gate
AB
AUB
PEUSS 2011/2012
FTA
Transfer out
Transfer in
Page 6
A developed Tree ..
A
A
1
2
1
5
4
1 2
9 10
7 8 9
PEUSS 2011/2012
1 2 3
4 5 6
FTA
Source: http://www.ntnu.no/ross/srt/slides/fta.pdf
PEUSS 2011/2012
FTA
Page 8
Source: http://www.ntnu.no/ross/srt/slides/fta.pdf
PEUSS 2011/2012
FTA
Page 9
Example
PEUSS 2011/2012
FTA
Page 10
Example
PEUSS 2011/2012
FTA
Page 11
Methodology (Preliminary
Analysis)
Set System Boundaries
Understand Chosen System
Define Top Events
PEUSS 2011/2012
FTA
Page 12
Methodology (Rules)
1.
2.
3.
4.
5.
6.
PEUSS 2011/2012
FTA
Page 13
Methodology (Rules - 1)
immediate, necessary and sufficient
cause
Immediate
FTA
Page 14
PEUSS 2011/2012
FTA
Page 15
PEUSS 2011/2012
FTA
Page 16
Methodology (Rules - 4) no
miracles rule
If the normal functioning of a component
propagates a fault sequence, then it is
assumed that the component functions
normally
PEUSS 2011/2012
FTA
Page 17
PEUSS 2011/2012
FTA
Page 18
PEUSS 2011/2012
FTA
Page 19
Connector A
Switch
Battery
Motor
FTA
Connector B
Page 20
10
top event ..
motor does not run
when switch is pressed
No Power
Supply
Motor
failed
Switch
malfunction
Switch
is
broken
Insufficient
force is
applied
No
connection
Connector
A
detached
Battery
is dead
Connector
B
detached
PEUSS 2011/2012
FTA
Page 21
Qualitative Analysis
(Combination of Gates)
Q
or gate
PEUSS 2011/2012
and gate
FTA
Page 22
11
Qualitative Analysis
(Cut Sets)
PEUSS 2011/2012
FTA
Page 23
Q=(AC)(DB)
AD AB CD BC
PEUSS 2011/2012
FTA
Page 24
12
Qualitative Analysis
(Minimal Cut Sets)
PEUSS 2011/2012
FTA
Page 25
Qualitative Analysis
(Boolean Algebra)
Commutative laws
AB=BA
AB=BA
Associative laws
A (B C) = (A B) C
A (B C) = (A B) C
Distributive laws
A (B C) = A B A C
A (B C) = (A B) (A C)
PEUSS 2011/2012
FTA
Commutative laws
AB=BA
A + B = B +A
Associative laws
A (B C) = (A B) C
A + (B + C) = (A + B) + C
Distributive laws
A (B + C) = A B + A C
A + (B C) = (A + B) (A + C)
Page 26
13
Qualitative Analysis
(Boolean Reduction)
Idempotent laws
Top event
AA=A
A +A = A
Absorption law
A + (A B) = A
B
PEUSS 2011/2012
FTA
Page 27
AB
A B
PEUSS 2011/2012
(AC)(DB)
AC
DB
A C
D B
FTA
DC
D C
Page 28
14
Solution ..
( A B ) (( A C ) ( D B )) ( D C )
(A+B)(AC+DB)DC
AACDC + ADBDC + BACDC + BDBDC
ACD + ABCD + ABCD + BCD
ACD + BCD
Minimal Cut Sets ACD, BCD
PEUSS 2011/2012
FTA
Page 29
PEUSS 2011/2012
FTA
Page 30
15
PEUSS 2011/2012
FTA
Page 31
Software
PEUSS 2011/2012
FTA
Page 32
16
Exercise 1
PEUSS 2011/2012
FTA
Page 33
One
Possible
Solution
PEUSS 2011/2012
FTA
Page 34
17
RBD of an engine
LV
Fuel
pump
Fuel
filter
Fuel system
Jet
Other
components
HV
Ignition system 1
Carburettor
LV
HV
Ignition system 2
PEUSS 2011/2012
FTA
Page 35
PEUSS 2011/2012
FTA
Page 36
18