An improved sum-of-disjoint-products technique for the symbolic network reliability analysis with known minimal paths

Reliability Engineering and System Safety

Volumn 92, Issue 2, 2007, Pages 260-268

  Yeh, Wei Chang ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Algorithm; Minimal path (MP); Network reliability; Sum of disjoint products technique (SDP); The absorption law

Indexed keywords

ALGORITHMS; OPERATIONS RESEARCH; RANDOM PROCESSES;

ABSORPTION LAW; MINIMAL PATH (MP); NETWORK RELIABILITY; SUM-OF-DISJOINT PRODUCTS TECHNIQUE (SDP);

RELIABILITY THEORY;

EID: 33750284661     PISSN: 09518320     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ress.2005.12.006     Document Type: Article

References (33)

1. Aven T. Availability evaluation of oil/gas production and transportation systems. Reliab Eng 18 (1987) 35-44
2. Aven T. Some considerations on reliability theory and its applications. Reliab Eng Syst Saf 21 (1988) 215-223
3. Roberts FS, Hwang FK, Monma C. Reliability of computer and communication networks. DIMACS series in discrete mathematics and theoretical computer science, vol. 5. New York: AMS/ACM publisher; 1991.
4. Ke W.J., and Wang S.D. Reliability evaluation for distributed computing networks with imperfect nodes. IEEE Trans Reliab 46 (1997) 342-349
5. Nahman J.M. MPs and cuts or networks exposed to common-cause failures. IEEE Trans Reliab R-41 (1992) 76-80, 84
6. Malinowski J., and Preuss W. Reliability evaluation for tree-structured systems with multistate components. Microelectron Reliab 36 (1996) 9-17
7. Shen Y. A new simple algorithm for enumerating all minimal paths and cuts of a graph. Microelectron Reliab 35 6 (1995) 973-976
8. Yeh W.C. A revised layered-network algorithm to search for all d-Minpaths of a limited-flow acyclic network. IEEE Trans Reliab 47 (1998) 436-442
9. Lin Y.K. Study on the multicommodity reliability of a capacitated-flow network. Comput Math Appl 42 (2001) 255-264
10. Lin Y.K. A simple algorithm for reliability evaluation of a stochastic-flow network with node failure. Comput Oper Res 28 (2001) 1277-1285
11. Lin Y.K. Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcs. Reliab Eng Syst Saf 75 (2002) 41-46
12. Yeh W.C. Search for All d-Mincuts of a Limited-Flow Network. Comput Oper Res 29 13 (2002/6) 1843-1858
13. Yeh W.C. Search for minimal paths in modified networks. Reliab Eng Syst Saf 75 3 (2002/3) 389-395
14. Tan Z. Minimal cut sets of s-t networks with k-out-of-n nodes. Reliab Eng Syst Saf 82 1 (2003/10) 49-54
15. Yeh W.C. A MCS-RSM approach for the network reliability to minimize the total cost. Int J Adv Manuf Technol 22 9-10 (2003/11) 681-688
16. Yeh W.C. A simple algorithm for evaluating the k-out-of-n network reliability. Reliab Eng Syst Saf 83 1 (2004/1) 93-101
17. Yeh W.C. Multistate network reliability evaluation under maintenance cost constraint. Int J Prod Econom 88 1 (2004/3) 73-83
18. Yeh W.C. A new approach to evaluate the reliability of multistate networks under the cost constraint. Omega: Int J Manage Sci 33 3 (2005/6) 203-209
19. Colbourn C.J. The combinatorics of network reliability (1987), Oxford University Press, New York
20. Abraham J.A. An improved algorithm for network reliability. IEEE Trans Reliab 28 (1979) 58-61
21. Heidtmann K. Statistical comparison of two sum-of-disjoint product Algorithms for reliability and safety evaluation. In: Proceedings of the 21st international conference SAFECOMP 2002, Lecture notes in computer science, vol. 2434, Berlin: Springer, 2002, p. 70-81.
22. Bryant R.E. Graph-based algorithms for Boolean function manipulation. IEEE Trans Comput C-35 (1986) 677-691
23. Rai S., Veeraraghavan M., and Trivedi K.S. A survey of efficient reliability computation using disjoint products approach. Networks 25 (1995) 147-163
24. Soh S., and Rai S. Experimental results on preprocessing of path/cut terms in sum of disjoint products technique. IEEE Trans Reliab 42 1 (1993) 24-33
25. Soh S., and Rai S. CAREL: Computer aided reliability evaluator for distributed computing networks. IEEE Trans Parallel Distrib Syst 2 (1991) 199-213
26. Veeraraghavan M., and Trivedi K.S. An improved algorithm for symbolic reliability analysis. IEEE Trans Reliab 40 3 (1991) 347-358
27. Chatelet E., Dutuit Y., Rauzy A., and Bouhoufani T. An optimized procedure to generate sums of disjoint products. Reliab Eng Syst Saf 65 3 (1999) 289-294
28. Allan R.N., Rondiris I.L., and Fryer D.M. An efficient computational technique for evaluating the cut/tie and common cause failures of complex systems. IEEE Trans Reliab R-30 (1981) 101-109
29. Rauzy A., Chatelet E., Dutuit Y., and Berenguer C. A practical comparison of methods to assess sum-of-products. Reliab Eng Syst Saf 79 1 (2003) 33-42
30. Wilson J.M. An improved minimizing algorithm for sum of disjoint products. IEEE Trans Reliab 39 1 (1990) 42-45
31. Zhao L.C., and Xu J.C. An efficient minimizing algorithm for sum of disjoint products. Microelectron Reliab 35 (1995) 1157-1162
32. Malinowski J. Non-binary decomposition trees-a method of reliability computation for systems with known minimal paths/cuts. Reliab Eng Syst Saf 84 (2004) 113-124
33. Fong C.C., and Buzacott J.A. An algorithm for symbolic reliability computation with path-sets or cut-sets. IEEE Trans Reliab 36 (1987) 34-37