A Heuristic Algorithm for System Failure Frequency
- 1 October 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. R-30 (4) , 357-361
- https://doi.org/10.1109/TR.1981.5221113
Abstract
For reliability analysis, the choice between tie-sets and cut-sets is not a matter of convenience but depends on assessment of computational effort. The system configuration alone determines the preference of the approach. The present paper offers a faster algorithm for evaluating system failure frequency using both approaches. An expression for system failure frequency between two specified nodes is derived using either tie-sets or cut-sets. The expression is in terms of failure frequency, availability, and unavailability of the system elements. A heuristic algorithm to obtain the expression can be programmed for a computer. The algorithm is illustrated through an example. The manner in which Abraham's algorithm can be used to determine system probability of failure using cut-sets is suggested. The algorithms are also useful for evaluating sensitivity coefficients.Keywords
This publication has 8 references indexed in Scilit:
- 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
- Tie set approach to determine the frequency of system failureMicroelectronics Reliability, 1975
- A Fast Algorithm for Reliability EvaluationIEEE Transactions on Reliability, 1975
- A New Method to Determine the Failure Frequency of a Complex SystemIEEE Transactions on Reliability, 1974
- A Boolean algebra method for computing the terminal reliability in a communication networkIEEE Transactions on Circuit Theory, 1973
- Network Approaches to Finding the Reliability of Repairable SystemsIEEE Transactions on Reliability, 1970