Click if you do not see the graphics..
Cut set(s) with 1 component (Total: 2)
{Mo}
{MP}
Cut set(s) with 2 components (Total: 4)
{P1,P2}
{P1,F2}
{F1,P2}
{F1,F2}
Unavailability [Qo(t)]
t Qo(t)
0 0.0000e+000
20 1.5035e-003
40 2.2988e-003
60 2.7297e-003
80 2.9748e-003
100 3.1204e-003
120 3.2096e-003
140 3.2656e-003
160 3.3013e-003
180 3.3242e-003
200 3.3391e-003
Download CARA FaultTree file (Right click the link, and save)
Using the MOCUS algorithm, we obtain:
TOP
-------------------------
MP
G0
-------------------------
MP
G1,G2
-------------------------
MP
P1,G2
Mo,G2
F1,G2
-------------------------
MP
P1,P2
P1,Mo
P1,F2
Mo,P2
Mo,Mo
Mo,F2
F1,P2
F1,Mo
F1,F2
Since Mo,Mo could be replaced by Mo, we se that P1,Mo, Mo,P2, Mo,F2 and F1,Mo are not minimal, that is, we remain with the following minimal cut sets:
MP
P1,P2
P1,F2
Mo
F1,P2
F1,F2
which are identical with the results from CARA