An algorithm to find minimal cuts of coherent fault-trees withevent-classes, using a decision tree

摘要

A new algorithm, the Carrasco-Sune minimal cuts (CS-MC) algorithmnfor computing the minimal cuts of s-coherent fault trees is presented.nInput events of the fault tree are assumed classified into classes,nwhere events of the same class are indistinguishable. This allowsncapturing some symmetries which some systems exhibit. CS-MC uses andecision tree. The search implemented by the decision tree is guided bynheuristics which try to make the CS-MC algorithm as efficient asnpossible. In addition, an irrelevance test on the inputs of the faultntree is used to prune the search. The performance of CS-MC isnillustrated and compared with the basic top-down and bottom-upnalgorithms using a set of fault trees, some of which are very difficult.nThe CS-MC performs very well even in the difficult examples, and thenmemory requirements of CS-MC are small