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.
Original language | English (US) |
---|---|
Pages (from-to) | 161-166 |
Number of pages | 6 |
Journal | IEEE Transactions on Reliability |
Volume | 35 |
Issue number | 2 |
DOIs | |
State | Published - Jun 1986 |
Keywords
- Boolean expression
- Graph
- Network reliability
- P-exp
- Path enumeration
- Probability expression
- Terminal-pair reliability
- reliability
ASJC Scopus subject areas
- Safety, Risk, Reliability and Quality
- Electrical and Electronic Engineering