IEEE Transactions on Reliability · 1977 · 18 citations · 7 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureFault-tolerant ComputingFault-tolerant SystemsBoolean OperationsCircuit ComplexityDigital Logic DesignFault DetectionFault Tree AnalysisAnd GateBasic Event AnalysisFault Tree ConstructionFault Tree ReductionMinimal Cut SetsOr GateTop Event AnalysisTree Reduction
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.
7
A time-dependent methodology for fault tree evaluation
W.E. Vesely · Nuclear Engineering and Design · 1970 · 283 citations
On the Analysis of Fault Trees
R.G. Bennetts · IEEE Transactions on Reliability · 1975 · 106 citations