Fault Tree Analysis Using Bit Manipulation

Abstract

This paper describes an efficient technique for computerized fault-tree analysis. The technique is based upon binary coding of events and bit manipulation for tree reduction, reducing both computation time and computer storage requirements. The operations include generation of minimal cut sets for trees containing arbitrary AND and OR logic, and determination of top event existence probability for s-independent minimal cut sets composed of s-independent basic events. By the use of an upward algorithm for tree reduction, information is available at each logic gate. The effectiveness in producing minimal cut sets and top event probability has been demonstrated through analysis of fault trees of various sizes. The current implementation accommodates trees containing AND and OR gates, including all logical redundancies.

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 — 18 citations exist upstream.

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