Finding minimal cut sets in a fault tree

✍ Scribed by Jørn Vatn

• Publisher: Elsevier Science
• Year: 1992
• Tongue: English
• Weight: 234 KB
• Volume: 36
• Category: Article
• ISSN: 0951-8320
• DOI: 10.1016/0951-8320(92)90152-b

✦ Synopsis

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 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 sets. This procedure is continued until all minimal cut sets are identified. The procedure is very fast. Compared to the standard MOCUS program the computer time is reduced by at least a factor of ten.