An Improved Algorithm for Network Reliability

IEEE Transactions on Reliability

Volumn R-28, Issue 1, 1979, Pages 58-61

  Abraham, J A ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Boolean expressions; Disjoint products; Reliability algorithm; Terminalpair reliability

Indexed keywords

COMPUTER PROGRAMMING - SUBROUTINES; PROBABILITY; RELIABILITY;

ELECTRIC NETWORKS;

EID: 0018455846     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/TR.1979.5220476     Document Type: Article

References (8)

1. L. Fratta, U.G. Montanari, “A Boolean algebra method for computing the terminal reliability in a communication network”, IEEE Trans. Circuit Theory, vol C-20, 1973 May, pp 203-211.
2. K.K. Aggarwal, K.B. Misra, J.S. Gupta, “A fast algorithm for reliability evaluation”, IEEE Trans. Reliability, vol R-24, 1975 Apr, pp 83–85.
3. R.G. Bennetts, “On the analysis of fault trees”, IEEE Trans. Reliability, vol R-24, 1975 Aug, pp 175–185.
4. P.M. Lin, B.J. Leon, T.C. Huang, “A new algorithm for symbolic reliability analysis”, IEEE Trans. Reliability, vol R-25, 1976 Apr, pp 2–15.
5. W.G. Schneeweiss, “Calculating the probability of Boolean expression being 1”, IEEE Trans. Reliability, vol R-26, 1977 Apr, pp 16–22.
6. K.K. Aggarwal, J.S. Gupta and K.B. Misra, “A simple method for reliability evaluation of a communication system”, IEEE Trans. Communications, vol COM-23, 1975 May, pp 563–566.
7. K.K. Aggarwal, R.G. Bennetts, “Comment and reply on ‘On the analysis of fault trees’ [3], IEEE Trans. Reliability, vol R-25, 1976 June, pp 126–127.
8. Supplement: NAPS document No. 03303-B, 5 pages in this Supwplement. For current ordering information, see “Information for Readers & Authors” in a current issue. Order NAPS document No. 03303, 15 pages. ASIS-NAPS; Microfiche Publications; PO Box 3513, Grand Central Station; New York, NY 10017 USA.