Algorithm for finding minimal cut sets in a fault tree

This paper presents several algorithms that have been used in a computer code for fault-tree analysing by the minimal cut sets method. The main algorithm is the more efficient version of the new CARA algorithm, which finds minimal cut sets with an auxiliary dynamical structure. The presented algorithm for finding the minimal cut sets enables one to do so by defined requirements — according to the order of minimal cut sets, or to the number of minimal cut sets, or both. This algorithm is irom three to six times faster when compared with the primary version of the CARA algorithm.