Recursive Disjoint Products: A Review of Three Algorithms
- 1 April 1982
- journal article
- review article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. R-31 (1) , 33-35
- https://doi.org/10.1109/TR.1982.5221216
Abstract
Disjoint Products (DP) applied to 2-terminal system reliability recursively partitions the logic polynomial into nonintersecting terms. Each step represents the incremental contribution of one minimal state. Three different DP algorithms for s-coherent systems were published. This paper develops the theory common to all three algorithms, and also shows those respects in which they differ from one another. Proofs are sketched.Keywords
This publication has 9 references indexed in Scilit:
- Recursive Disjoint Products, Inclusion-Exclusion, and Min-Cut ApproximationsIEEE Transactions on Reliability, 1980
- An Algebraic Technique for Reliability EvaluationIEEE Transactions on Reliability, 1980
- An Improved Algorithm for Network ReliabilityIEEE Transactions on Reliability, 1979
- An Efficient Method for Reliability Evaluation of a General NetworkIEEE Transactions on Reliability, 1978
- Calculating the Probability of Boolean Expression Being 1IEEE Transactions on Reliability, 1977
- A New Algorithm for Symbolic System Reliability AnalysisIEEE Transactions on Reliability, 1976
- On the Analysis of Fault TreesIEEE Transactions on Reliability, 1975
- A Fast Algorithm for Reliability EvaluationIEEE Transactions on Reliability, 1975
- A Boolean algebra method for computing the terminal reliability in a communication networkIEEE Transactions on Circuit Theory, 1973