At this point the packaged code has identified the minimal cut sets, but.

Jan 01, This paper presents a new method for identification of minimal cut sets in a fault tree. The (non-minimal) cut sets are found by a modification of the well-known MOCUS algorithm. These cut sets are stored in a virtual tree structure which requires far less core space than the MOCUS cut set matrix.

The minimal cut sets are found by traversing this virtual tree a number of times. In the first cycle, all Cited by: The minimal cut sets are found by traversing this virtual tree a number of times. In the first cycle, all cut sets of order one are identified. In the next cycle, all cut sets of order two are identified and compared with the cut sets of order one to exclude non-minimal stes. This procedure is continued until all minimal cut sets are stumpcutting.bar by: However, the one including all components is not a minimal cut set because, if 3 or 4 is removed, the remaining events are also a cut set.

Therefore, the minimal cut sets for this configuration are {1, 2,3} or {1, 2, 4}. This may be more evident by examining the RBD equivalent of Figure 2, as shown in Figure 2. Figure 2: RBD of the fault tree shown in Figure 1. Using the Show Cut Sets command available in the Tools menu, the minimal cut sets. The result of minimal cut set analysis is a new fault tree, logically equivalent to the original, consisting of an OR gate beneath the top event, whose inputs are the minimal cut sets.

Each minimal cut set is an AND gate con-taining a set of basic inputs necessary and sufficient to cause the top event. An efficient algebraic algorithm for finding the minimal cut sets for a large fault tree was defined and a wifes trimmed bush procedure which implements the algorithm was added to the Set Equation Transformation System (SETS). The algorithm includes the identification and separate processing of independent subtrees, the coalescing of consecutive gates of the.

The result of minimal cut set analysis is a new fault tree, logically equivalent to the original, consisting of an OR gate beneath the top event, whose inputs are the minimal cut sets.

Each minimal cut set is an AND gate con-taining a set of basic inputs necessary and sufficient to cause the top event.