A novel approach to determine minimal tie-sets of complex network

IEEE Transactions on Reliability

Volumn 53, Issue 1, 2004, Pages 61-70

  Fotuhi Firuzabad, M ^a   Billinton, R ^b   Munian, T S ^c   Vinayagam, B ^c  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

^b UNIVERSITY OF SASKATCHEWAN   (Canada)

^c UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Connection matrix; Minimal cut sets; Minimal paths (tie sets); Path tracing algorithm

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; ELECTRIC NETWORK TOPOLOGY; RAY TRACING; RELIABILITY THEORY; SYSTEMS ANALYSIS;

CONNECTION MATRIX; MINIMAL CUT-SETS; MINIMAL PATHS; PATH TRACING ALGORITHMS; RELIABILITY ANALYSIS;

ELECTRIC NETWORK ANALYSIS;

EID: 1942436329     PISSN: 00189529     EISSN: None     Source Type: Journal    
DOI: 10.1109/TR.2004.824834     Document Type: Article

References (17)

1. H. Kumamoto and E. J. Henly, Probabilistic Risk Assessment and Management for Engineers and Scientists: IEEE Press, 1996.
2. L. M. Shooman, Probabilistic Reliability: An Engineering Approach. New York: McGraw-Hill, 1968.
3. C. Singh, "On the behavior of failure bounds," IEEE Transactions on Reliability, vol. R-26, pp. 63-66, April 1977.
4. C. Singh and R. Billinton, System Reliability Modeling and Evaluation. London, England: Hutchinson Educational, 1977.
5. R. Billinton and R. Allan, Reliability Evaluation of Engineering Systems: Concepts and Techniques: Plenum Press, 1994.
6. R. Bilinton and R. N. Allan, Reliability Evaluation of Power Systems: Plenum Press, 1996.
7. G. B. Jasmon, "Cutset analysis of networks using basic minimal paths and network decomposition," IEEE Transactions on Reliability, vol. R-34, pp. 303-307, October 1985.
8. G. B. Jasmon and O. S. Kal, "A new technique in minimal path and cut-set evaluation," IEEE Transactions on Reliability, vol. R-34, pp. 136-143, June 1985.
9. M. A. Samad, "An efficient method for terminal and multi-terminal path set enumeration," Journal of Microelectronics and Reliability, vol. 27, pp. 443-446, 1978.
10. J. M. Nahman, "Minimal paths and cuts of networks exposed to common-cause failures," IEEE Transactions on Reliability, vol. R-41, pp. 76-80, March 1992.
11. ____, "Enumeration of minimal paths of modified networks," Journal of Microelectronics and Reliability, vol. 34, no. 3, pp. 475-484, 1994.
12. A. C. Nelson, J. R. Batts, and R. L. Beadles, "A computer program for approximating system reliability," IEEE Transactions on Reliability, vol. R-19, pp. 61-65, 1970.
13. J. A. Carrasco and V. Sune, "An algorithm to find minimal cuts of coherent fault-trees with event-classes using a decision tree," IEEE Transactions on Reliability, vol. 48, pp. 31-41, March 1999.
14. S. Garriba, P. Mussio, F. Naldi, G. Rena, and G. Volta, "Efficient construction of minimal cutsets from fault trees," IEEE Transactions on Reliability, vol. R-26, pp. 88-93, 1977.
15. A. Rosenthal, "A computer scientist looks at reliability computations," IEEE Transactions on Reliability, vol. R-29, pp. 136-138, June 1980.
16. J. Vatn, "Finding minimal cut-sets in a fault tree," Journal of Reliability Engineering and System Safety, vol. 36, pp. 59-62, 1992.
17. R. N. Allan, I. L. Rondiris, and D. M. Fryer, "An efficient computational technique for evaluating the cut/tie sets and common-cause failures of complex systems," IEEE Transactions on Reliability, vol. R-30, pp. 101-109, 1981.