A Method for Computing Complex System Reliability
- 1 November 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. R-21 (4) , 215-219
- https://doi.org/10.1109/tr.1972.5215997
Abstract
The computation of reliability becomes quite tedious when one has to deal with a non series-parallel system. In this paper a proposed method is developed by taking the system as a probabilistic graph in which a component of the system is represented by a branch. The proposed method is composed of three phases: Phase 1 involves the reduction of all series, parallel, and series-parallel components to an irreducible non series-parallel system. In Phase 2 the algorithm enumerates all possible paths from the source to the sink of the graph. Phase 3 then computes the system reliability based on the path information obtained in Phase 2. An example of the use of the method to compute system reliability is given.Keywords
This publication has 7 references indexed in Scilit:
- A Computer Program for Approximating System ReliabilityIEEE Transactions on Reliability, 1970
- An Algorithm to Determine the Reliability of a Complex SystemIEEE Transactions on Reliability, 1969
- Shortest Paths in Probabilistic GraphsOperations Research, 1969
- A Generalized Limit Theorem for ReliabilityIEEE Transactions on Reliability, 1969
- Coherent Structures of Non-Identical ComponentsTechnometrics, 1963
- A Survey of Techniques for Analysis and Prediction of Equipment ReliabilityIRE Transactions on Reliability and Quality Control, 1962
- The Failure Law of Complex EquipmentJournal of the Society for Industrial and Applied Mathematics, 1960