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.
[1]
Ralph A. Evans.
A Generalized Limit Theorem for Reliability
,
1969
.
[2]
Paul A. Jensen,et al.
An Algorithm to Determine the Reliability of a Complex System
,
1969
.
[3]
A. C. Nelson,et al.
A Computer Program for Approximating System Reliability
,
1970
.
[4]
H. Frank,et al.
Shortest Paths in Probabilistic Graphs
,
1969,
Oper. Res..
[5]
R. Drenick.
THE FAILURE LAW OF COMPLEX EQUIPMENT
,
1960
.
[6]
J. D. Esary,et al.
Coherent Structures of Non-Identical Components
,
1963
.
[7]
R. M. Jacobs,et al.
A Survey of Techniques for Analysis and Prediction of Equipment Reliability
,
1962
.