Network Reliability Evaluation Using Probability Expressions

W. H. Debany, Pramod Kumar Varshney, C. R P Hartmann

Research output: Contribution to journalArticle

22 Scopus citations


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 languageEnglish (US)
Pages (from-to)161-166
Number of pages6
JournalIEEE Transactions on Reliability
Issue number2
StatePublished - 1986



  • Boolean expression
  • Graph
  • Network reliability
  • P-exp
  • Path enumeration
  • Probability expression
  • reliability
  • Terminal-pair reliability

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Safety, Risk, Reliability and Quality
  • Computer Graphics and Computer-Aided Design
  • Hardware and Architecture
  • Software

Cite this