Network Reliability Evaluation Using Probability Expressions

1 June 1986

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability

Vol. 35 (2) , 161-166
https://doi.org/10.1109/tr.1986.4335392

Abstract

The terminal-pair reliability of a graph (network) is evaluated by means of probability expressions. These expressions result from a transformation of Boolean expressions from the Boolean domain into the probabilistic domain. Basic operations on probability expressions are shown, and a data representation is given for automation of the procedure. The performance of this procedure is compared with other published results. Two new measures, PRI and POST, give relationships between a network's terminal-pair reliability and individual element reliabilities, and derive an element ordering for network diagnosis. These measures can be computed easily using probability expressions.

Keywords

This publication has 11 references indexed in Scilit:

Analysis of Reliability Block Diagrams by Boolean Techniques
IEEE Transactions on Reliability, 1982
Probabilistic Aspects of Boolean Switching Functions via a New Transform
Journal of the ACM, 1981
An Improved Algorithm for Network Reliability
IEEE Transactions on Reliability, 1979
A Recursive Method Based on Case Analysis for Computing Network Terminal Reliability
IEEE Transactions on Communications, 1978
Calculating the Probability of Boolean Expression Being 1
IEEE Transactions on Reliability, 1977
A New Algorithm for Symbolic System Reliability Analysis
IEEE Transactions on Reliability, 1976
On the Analysis of Fault Trees
IEEE Transactions on Reliability, 1975
Probabilistic Treatment of General Combinational Networks
IEEE Transactions on Computers, 1975
Analysis of Logic Circuits with Faults Using Input Signal Probabilities
IEEE Transactions on Computers, 1975
A Boolean algebra method for computing the terminal reliability in a communication network
IEEE Transactions on Circuit Theory, 1973