An Improved Algorithm for Symbolic Reliability Analysis


Journal Article

The purpose of this paper is to describe an efficient Boolean algebraic algorithm to compute the probability of a union of non-disjoint sets as applied to symbolic reliability analysis. Coherent networks and fault-trees with statistically-independent components characterized by their minimal pathsets or cutsets are used as examples for generating the non-disjoint sets. The algorithm uses the concept of multiple variable inversion originally proposed by Grnarov, Kleinrock, Gerla (1979). We first present our algorithm. Next, we illustrate our improvements in the use of multiple variable inversion technique for this problem using two examples. The algorithm is extended to compute the reliability importance of a given component (sensitivity of system reliability to the component reliability). Finally, a computer program implementing the modified algorithm is used to solve and obtain measured time complexities for a large set of network and fault tree models. Reader Aids - Purpose: Present an efficient algorithm Special math needed for explanations: Boolean algebra, Probability. Special math needed to use results: Same Results useful to: Reliability analysts. © 1991 IEEE

Full Text

Duke Authors

Cited Authors

  • Veeraraghavan, M; Trivedi, KS

Published Date

  • January 1, 1991

Published In

Volume / Issue

  • 40 / 3

Start / End Page

  • 347 - 358

Electronic International Standard Serial Number (EISSN)

  • 1558-1721

International Standard Serial Number (ISSN)

  • 0018-9529

Digital Object Identifier (DOI)

  • 10.1109/24.85455

Citation Source

  • Scopus