2. Construct a 2^n truth table ,where n is number of
components in system.
Each row is then examined and rows resulting in a
system success (functioning properly) are indicated.
A reduction table is then constructed by listing all
success rows in a column 1.
By a comparative process, products terms are formed
for those terms in column 1 which differ by a letter
inverse.
3. Once a term is used in comparison , it is eliminated
from all further comparisons ensuring that all
remaining terms are still mutually exclusive.
This procedure is repeated until no further
comparisons are possible.
The reliability of the system is the union of all terms
that can not be further compared.
4.
5.
6.
7.
8. The probability of system is obtained by the union of
all the states that can not be further combined.
R = P(AB’CD’E + AB’CD + ABC
+AC’E+A’CD)
R = p^3 (1-p^2) + p^3 (1-p) + p^3 + p^2 (1-p)
+p^2(1-p)
R = 2p^2 + p^3 – 3p^4 + p^5
