KEMBAR78
Fault Tree Analysis | PDF | System | Applied Mathematics
0% found this document useful (0 votes)
14 views29 pages

Fault Tree Analysis

Fault Tree Analysis (FTA) is a method used to identify and rank combinations of events that lead to system failure, estimating the system's failure probability. It involves the use of tie sets, which are sets of components whose success is necessary for system success, and employs various gates to model the relationships between events. The analysis is conducted in a top-down manner, focusing on the top event and utilizing Boolean logic to represent basic events as binary outcomes.

Uploaded by

S Bharat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
14 views29 pages

Fault Tree Analysis

Fault Tree Analysis (FTA) is a method used to identify and rank combinations of events that lead to system failure, estimating the system's failure probability. It involves the use of tie sets, which are sets of components whose success is necessary for system success, and employs various gates to model the relationships between events. The analysis is conducted in a top-down manner, focusing on the top event and utilizing Boolean logic to represent basic events as binary outcomes.

Uploaded by

S Bharat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 29

Fault Tree Analysis

Dr.M.D.Jaybhaye
College of Engineering Pune
The Tie Set Method

• A tie set V is a set of components whose success results in


system success , i.e. the presence of all components in any
tie set connects the input to the output in the logic diagram.
• A minimal tie set T is a tie set where the set remaining after
a removal of any of its elements is no longer a tie set. This
means that all components of a minimal tie set must be
succeed to cause system success.
Fault Tree Analysis

• A Fault Tree Analysis identifies and ranks combinations of


events represented on a Fault Tree that cause system failure,
and provides estimates of the system's failure probability.

• The Qualitative analysis of the Fault Tree determines the:


• a) probability of system failure (top event) based on a single
failure (basic event) cause or common cause potential using
minimal cut sets,
• b)combination of component failures (minimal cut sets),
• c) importance ranking of contributors to system failure.
Primary event symbols
• The primary event symbols are typically used as follows:
• Basic event - failure or error in a system component or
element (example: switch stuck in open position)
• Intermediate event – an event resulting from combination
of two or more basic events
• Undeveloped event - an event about which insufficient
information is available, or which is of no consequence
• Conditioning event - conditions that restrict or affect logic
gates (example: mode of operation in effect)
Gates
• The gates work as follows:
• OR gate - the output occurs if any input occurs
• AND gate - the output occurs only if all inputs occur (inputs
are independent)
• Exclusive OR gate - the output occurs if exactly one input
occurs
• Priority AND gate - the output occurs if the inputs occur in a
specific sequence specified by a conditioning event
• Inhibit gate - the output occurs if the input occurs under an
enabling condition specified by a conditioning event
• Transfer symbols are used to connect the inputs and
outputs of related fault trees, such as the fault tree of a
subsystem to its system.
Characteristics of Fault Tree

• It is a “top-down” analysis, where the top event is specified


first.
• Does not necessarily contain all possible failure mod of the
components of the system .Only those failure modes which
contribute to the existence occurrence of the top event are
modelled.
• A fault tree is an expression for Boolean logic .i.e., all basic
events are binary, that is, either true or false.
29

You might also like