A survey of efficient reliability computation using disjoint products approach

Networks

Volumn 25, Issue 3, 1995, Pages 147-163

  Rai, Suresh ^a   Veeraraghavan, Malathi ^b   Trivedi, Kishor S ^c  

^a LOUISIANA STATE UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c DUKE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85025253957     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.3230250308     Document Type: Article

References (37)

1. An improved algorithm for network reliability
2. A simple technique for computing network reliability
3. Disjoint products and efficient computation of reliability
4. An improved abraham‐method for generating disjoint sums
5. On the analysis of fault trees
6. Some alternate characterizations of reliability domination
7. Using the decomposition‐tree of a network in reliability computation
8. SYREL: A symbolic reliability algorithm based on path cutset methods
9. Smaller sums of disjoint products by subproduct inversion
10. A new algorithm for symbolic systematic reliability analysis
11. An efficient method for reliability evaluation of a general network
12. A unified formula for the analysis of some network reliability problems
13. New topological formula and rapid algorithm for reliability analysis of complex networks
14. A linear‐time algorithm for computing K‐terminal reliability in series‐parallel networks
15. CAREL: Computer aided reliability evaluator for distributed computing networks
16. Experimental results on preprocessing of paths/cuts terms in sum of disjoint products technique
17. A unified approach to path problems
18. On the analysis of fault trees
19. An improved algorithm for the symbolic reliability analysis of networks
20. An improved minimizing algorithm for sum of disjoint products
21. Factoring algorithms for computing k‐terminal network reliability