An improved minimal cut set algorithm

Abstract

Presents a new qualitative fault tree evaluation algorithm based on bit manipulation techniques for the identification of the largest independent sub‐trees and the subsequent determination of all minimal cut sets of large and complex fault trees. The methodology developed is validated by direct application to a complex fault tree taken from the literature. Results obtained are compared with those available in the literature. Shows that the use of the algorithm (FTABMT) developed results in significant savings in both computer time and storage requirements.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 9 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.