Abstract A general and simple technique for the evaluation of symbolic reliability expression in the case of practical systems such as a communication system having fixed channel capacities of its various communicating links, a computer communication network allowing a fixed amount of data exchange amongst different terminals of various computer centres and a power distribution system having limited power ratings of its various power lines, is presented. A system is considered reliable only if it successfully transmits at least the required system capacity from the transmitter to the receiver station. In this method, the various branch sets are obtained which completely disrupt the communication path, i.e. ensure system failure. It is observed that these branch sets are not necessarily the cutsets in the usual graph theoretic sense. The unreliability expression is then determined by adopting an existing method for making various terms disjoint. Two typical examples are solved by this method. It is observed that the method is computationally fast and efficient.
[1]
Narsingh Deo,et al.
Graph Theory with Applications to Engineering and Computer Science
,
1975,
Networks.
[2]
K. K. Aggarwal,et al.
Reliability evaluation A comparative study of different techniques
,
1975
.
[3]
K. K. Aggarwal,et al.
A Simple Method for Reliability Evaluation of a Communication System
,
1975,
IEEE Trans. Commun..
[4]
B. J. Leon,et al.
A New Algorithm for Symbolic System Reliability Analysis
,
1976,
IEEE Transactions on Reliability.
[5]
Paul A. Jensen,et al.
An Algorithm to Determine the Reliability of a Complex System
,
1969
.
[6]
K.B. Misra,et al.
A Fast Algorithm for Reliability Evaluation
,
1975,
IEEE Transactions on Reliability.
[7]
S.H. Lee,et al.
Reliability Evaluation of a Flow Network
,
1980,
IEEE Transactions on Reliability.
[8]
R. Bennetts.
On the Analysis of Fault Trees
,
1975,
IEEE Transactions on Reliability.