Fault-Tree Analysis Using a Binary Decision Tree
Author:
- 1 December 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. R-34 (5) , 453-457
Abstract
A new algorithm for the production of a short disjoint-products form of a fault-tree output function is presented and discussed. This algorithm consists of a sequential binary decision process to find first big, then smaller sets of elementary system-failure states which correspond to disjoint-product terms. The identification of bad and good system states can be eased by a simple ternary (3-state) decision for which an auxiliary procedure is presented. The main advantages of this algorithm appear to be its efficiency, simplicity, and usefulness as an alternative (in the sense of multiversion programming for software fault tolerance) for the Shannon decomposition algorithm.Keywords
This publication has 7 references indexed in Scilit:
- Disjoint Boolean Products via Shannon's ExpansionIEEE Transactions on Reliability, 1984
- Addendum to: Computing Failure Frequency via Mixed Products of Availabilities and UnavailabilitiesIEEE Transactions on Reliability, 1983
- An Improved Algorithm for Network ReliabilityIEEE Transactions on Reliability, 1979
- Binary Decision DiagramsIEEE Transactions on Computers, 1978
- New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex NetworksIEEE Transactions on Reliability, 1978
- Design of Digital Computers1975
- A Computerized Algorithm for Determining the Reliability of Redundant ConfigurationsIEEE Transactions on Reliability, 1971