IEEE Transactions on Reliability · 1979 · 20 citations · 6 references
ComputingComputer EngineeringComputer ScienceAlgorithmsFault-tolerant ComputingFault-tolerant SystemsBoolean OperationsFault Tree AnalysisBottom-up ImplementationCut Set EnumerationFault Tree ConstructionFault Tree ReductionMinimal Cut SetsSum Of Products Form
The paper improves the conventional bottom-up algorithm for enumerating minimal cut sets of fault tree. It is proved that, when the logical product of two reduced sum-of-product forms is expanded by the distribution rule, one need only check if each resulting term is absorbed by some terms of two original sum-of-product forms. The algorithm for executing this process is presented and illustrated by an example. The entire computer program is given in a supplement and the computational results for several examples are presented to demonstrate the efficiency of the algorithm.
6
On the Analysis of Fault Trees
R.G. Bennetts · IEEE Transactions on Reliability · 1975 · 106 citations
Efficient Construction of Minimal Cut Sets from Fault Trees
S. Garribba, P. Mussio, F. Naldi et al. · IEEE Transactions on Reliability · 1977 · 34 citations
Fault Tree Analysis Using Bit Manipulation
D. Wheeler, Jason S. Hsuan, Ralph R. Duersch et al. · IEEE Transactions on Reliability · 1977 · 18 citations