SYREL: A Symbolic Reliability Algorithm Based on Path and Cutset Methods

Salim Hariri, C. S. Raghavendra

Research output: Contribution to journalArticlepeer-review

106 Scopus citations


Symbolic terminal reliability algorithms are important for analysis and synthesis of computer networks. In this paper, we present a simple and efficient algorithm, SYREL, to obtain compact terminal reliability expressions between a terminal pair of computers of complex networks. This algorithm incorporates conditional probability, set theory, and Boolean algebra in a distinct approach in which most of the computations performed are directly executable Boolean operations. The conditidnal probability is used to avoid applying at each iteration the most time consuming step in reliability algorithms, which is making a set of events mutually exclusive. The algorithm has been implemented on a VAX 11/750 and can analyze fairly large networks with modest memory and time requirements.

Original languageEnglish (US)
Pages (from-to)1224-1232
Number of pages9
JournalIEEE Transactions on Computers
Issue number10
StatePublished - Oct 1987


  • Conditional probability
  • cutsets
  • path enumeration
  • reliability evaluation tool
  • terminal reliability

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics


Dive into the research topics of 'SYREL: A Symbolic Reliability Algorithm Based on Path and Cutset Methods'. Together they form a unique fingerprint.

Cite this