A survey of efficient reliability computation using disjoint products approach


Journal Article

Several algorithms have been developed to solve the reliability problem for nonseries‐parallel networks using the sum of disjoint products (SDP) approach. This paper provides a general framework for most of these techniques. It reviews methods that help improve computer time and memory requirements in reliability computation. These parameters are generally used to compare SDP algorithms. We also overview three multiple variable inversion algorithms that result in sum of disjoint products expressions with fewer terms than that of algorithms that use only a single‐variable inversion. One common network is solved for two‐terminal network reliability using each of these algorithms. Finally, we have provided a comparison among these techniques. Copyright © 1995 Wiley Periodicals, Inc., A Wiley Company

Full Text

Duke Authors

Cited Authors

  • Rai, S; Veeraraghavan, M; Trivedi, KS

Published Date

  • January 1, 1995

Published In

Volume / Issue

  • 25 / 3

Start / End Page

  • 147 - 163

Electronic International Standard Serial Number (EISSN)

  • 1097-0037

International Standard Serial Number (ISSN)

  • 0028-3045

Digital Object Identifier (DOI)

  • 10.1002/net.3230250308

Citation Source

  • Scopus