An Improved Algorithm for Symbolic Reliability Analysis

IEEE Transactions on Reliability

Volumn 40, Issue 3, 1991, Pages 347-358

  Veeraraghavan, Malathi ^a   Trivedi, Kishor S ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b DUKE UNIVERSITY   (United States)

Author keywords

Coherent Networks; Fault Tree; Minpath Mincut

Indexed keywords

EID: 0000552404     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/24.85455     Document Type: Article

References (32)

1. A. Gmarov, L. Kleinrock, and M. Gerla, “A new algorithm for network reliability computation”, Proc. Computer Networking Symp., 1979 Dec.
2. M. O. Ball, J. S. Provan, “Disjoint products and efficient computation of reliability”, Operations Research, vol 36, 1988 Oct, pp 703–715.
3. C. J. Colbourn, The Combinatorics of Network Reliability, 1987; Oxford University Press.
4. M. O. Ball, “Complexity of network reliability computations”, Networks, vol 10, 1980, pp 153–165.
5. D. R. Shier, D. E. Whited, “Algebraic methods applied to network reliability problems”, SIAM J. Algebraic and Discrete Methods, vol 8, 1987 Apr, pp 251–262.
6. J. A. Abraham, “An improved algorithm for network reliability”, IEEE Trans. Reliability, vol R-28, 1979 Apr, pp 58–61.
7. S. Rai, A. K. Aggarwal, “An efficient method for reliability evaluation of a general network”, IEEE Trans. Reliability, vol R-27, 1978 Aug, pp 206–211.
8. L. Fratta, U. G. Montanari, “A recursive method based on case analysis for computing network terminal reliability”, IEEE Trans. Communications, vol Com-26, 1978 Aug, pp 1166–1177.
9. K. K. Aggarwal, K. B. Misra, J. S. Gupta, “A fast algorithm for reliability evaluation”, IEEE Trans. Reliability, vol R-24, 1975, pp 83–85.
10. R. Miller, Switching Theory, Volume 1: Combinational Circuits, 1965; John Wiley & Sons.
11. K. D. Heidtmann, “Smaller sums of disjoint products by subproduct inversion”, IEEE Trans. Reliability, vol 38, 1989 Aug, pp 305–311.
12. M. Veeraraghavan, Modeling and Evaluation of Fault-Tolerant Multiple Processor Systems, PhD thesis, 1988 Aug; Department of Electrical Engineering, Duke University.
13. R. Sahner, K. S. Trivedi, “Reliability modeling using SHARPE”, IEEE Transactions on Reliability, vol R-36, 1987 Jun, pp 186–193.
14. R. E. Barlow, F. Proschan, Statistical Theory of Reliability and Lifetesting: Probability Models, 1975; Holt, Rinehart and Winston.
15. R. R. Willie, “Computer-aided fault tree analysis”, 1978; Tech. Rep. ORC 78-14, University of California, Berkeley.
16. M. O. Locks, “A minimizing algorithm for sum of disjoint products”, IEEE Trans. Reliability, vol R-36, 1987 Oct, pp 445–453.
17. F. Beichelt, L. Spross, “Comment on An improved Abraham-method for generating disjoint sums”, IEEE Trans. Reliability, vol 38, 1989 Oct, pp 422–424.
18. J. M. Wilson, “An improved minimizing algorithm for sum of disjoint products”, IEEE Trans. Reliability, vol 39, 1990 Apr, pp 42–45.
19. S. Hariri, C. S. Raghavendra, “SYREL: A symbolic reliability algorithm based on path cutset methods”, IEEE Trans. Computers, vol C-36, 1987 Oct, pp 1224–1232.
20. W. H. Debany, P. K. Varshney, C. R. P. Hartmann, “Network reliability evaluation using probability expressions”, IEEE Trans. Reliability, vol R-35, 1986 Jun, pp 161–165.
21. G. Fishman, “A comparison of four Monte Carlo methods for estimating the probability of s-t connectedness”, IEEE Trans. Reliability, vol R-35, 1986 Jun, pp 145–155.
22. L. Fratta, U. G. Montanari, “Boolean algebra method for computing the terminal reliability in a communications network”, IEEE Trans. Circuit Theory, vol CT-20, 1973 May, pp 203–211.
23. P. M. Lin, B. J. Leon, T. C. Huang, “A new algorithm for symbolic systematic reliability analysis”, IEEE Trans. Reliability, vol R-25, 1976 Apr, pp 2–15.
24. R. G. Bennetts, “On the analysis of fault trees”, IEEE Trans. Reliability, vol R-24, 1975 Aug, pp 194–203.
25. A. Bobbio, A. Premoli, “Fast algorithm for unavailability and sensitivity analysis of series-parallel systems”, IEEE Trans. Reliability, vol R-31, 1982 Oct, pp 359–361.
26. S. J. Bavuso, J. B. Dugan, K. S. Trivedi, E. Rothmann, M. A. Boyd, “Applications of the Hybrid Automated Reliability Predictor”, Technical Paper 2760, 1987 Dec; NASA Langley Research Center.
27. D. M. Rasmuson, N. H. Marshall, “FATRAM-A core efficient cutset algorithm”, IEEE Trans. Reliability, vol R-27, 1978 Oct, pp 250–253.
28. K. Nakashima, Y. Hattori, “An efficient bottom-up algorithm for enumerating minimal cutsets of fault trees”, IEEE Trans. Reliability, vol R-28, 1979 Dec, pp 353–357.
29. S.N. Semanderes, “ELRAFT, a computer program for the efficient logic reduction analysis of fault trees”, IEEE Trans. Nuclear Science, vol NS-18, 1971 Feb, pp 481–487.
30. L. A. Bryant, J. J. Stiffler, “CARE III Phase report user's manual”, Contractor Report 165864, 1982 Sep; NASA Langley Research Center.
31. Trivedi, Dugan, Geist, Smotherman, Rothmann, Boyd, Bavuso, “HARP: The Hybrid Automated Reliability Predictor: Introduction guide for users”, Technical paper, 1986 Sep; Duke University.
32. S. J. Bavuso, J. E. Brunelle, P. L. Petersen, “CARE hands-on demonstration and tutorial”, Technical Memorandum 85811, 1984 May; NASA Langley Research Center.