From Fault-Tree To Fault-Identification

A practical way is given of identifying actual faults, by using a fault tree's complete system of minimal cutsets. For instance, for a fault tree where 20 cutsets are considered with 30 possible primal events, any of them can be found in at most three steps by the proposed FID-algorithm.