Lecture Notes 5
Lecture Notes 5
Lecture Notes 5
The symbols used in fault trees for representing events and their relations have been more or
less standardized. The symbols can be classified into three types, viz., event symbols (Table
3.3), gate symbols (Table 3.4), and transfer symbols (Table 3.5).
Evaluation of Fault Tree
The evaluation of fault tree includes both qualitative evaluation and quantitative evaluation.
The top events as a function of the minimal cut set are determined with the help of Boolean
algebra. Later, by applying probability over the Boolean expression and substituting the
respective basic event probability values, the quantification is carried out. There is one-to-one
correspondence between the fault tree gates representation and Boolean operations. Boolean
algebra is explained in Chapter 2.
In the development of any fault tree, the OR gate and the AND gate are often present. Both are
explained here to obtain basic probability expressions.
AND Gate
This gate allows the output event to occur only if the all-input events occur, representing
the intersection of the input events. The AND gate is equivalent to the Boolean symbol “⋅”.
For example, an AND gate with two input events A and B and output event T can be represented
by its equivalent Boolean expression, T = A B. (Symbol will be omitted subsequently.)
A realistic example is power supply failure to a personal computer due to the occurrence of
two events: failure of main supply and UPS failure (Figure 3.39).
OR Gate
This gate allows the output event to occur if any one or more input event occur, representing
the union of input events. The OR gate is equivalent to the Boolean symbol “+”.
For example, an OR gate with two input events A and B and the output event T can be
represented by its equivalent Boolean expression, T = A + B.
A practical example for the OR gate is where a diesel generator (DG) did not start on demand
due to actuation failure or a DG was already in a failed condition prior to demand on both
(Figure 3.40).
The probability formula for the top event T is given by
Prior to obtaining the quantitative reliability parameter results for the fault tree, repetition of
basic events and redundancies must be eliminated.
If the calculations are carried out directly on the fault tree without simplifying, the quantitative
values will be incorrect. This is achieved by obtaining minimal cut sets using Boolean algebra
rules algorithms developed for them.
There are many methods available in the literature, for example, Vesely, Fussell, Kumamoto,
Rasmuson. However, methods based on top-down or bottom-up successive substitution method
and Monte Carlo simulation are most often used. The latter is a numerical computer-based
approach. The top-down successive substitution method can be done by simple hand
calculations also. In this method, the equivalent Boolean representation of each gate in the fault
tree is obtained such that only basic events remain. Various Boolean algebra rules are used to
reduce the Boolean expression to its most compact form. The substitution process can proceed
from the top of the tree to the bottom or vice versa. The distribution law, laws of idempotence,
and the law of absorption are extensively used in these calculations. The final expression thus
obtained has minimal cut sets which are in the form of run of products, and can be written in
the general form
Any fault tree will consist of a finite number of minimal cut sets that are unique for that top
event. If there are single-order cut sets, then those single failures will lead to the occurrence of
the top event.