메뉴 건너뛰기




Volumn R-31, Issue 1, 1982, Pages 33-35

Recursive Disjoint Products: A Review of Three Algorithms

Author keywords

Approximations; Coherent system; Disjoint products; Exact methods; Fault trees; Minimal cut; Minimal path; Recursion; System reliability

Indexed keywords

RELIABILITY THEORY;

EID: 0020116391     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/TR.1982.5221216     Document Type: Article
Times cited : (38)

References (10)
  • 1
    • 0018455846 scopus 로고
    • An improved method for network reliability
    • Apr
    • J.A. Abraham, “An improved method for network reliability”, IEEE Trans. Reliability, vol R-28, 1979 Apr, pp 58–61.
    • (1979) IEEE Trans. Reliability , vol.R-28 , pp. 58-61
    • Abraham, J.A.1
  • 2
  • 4
    • 0015626643 scopus 로고
    • A Boolean algebra method for computing the terminal reliability in a communication network
    • May
    • L. Fratta, U.G. Montanari, “A Boolean algebra method for computing the terminal reliability in a communication network”, IEEE Trans. Circuit Theory, vol CT-20, 1973 May, pp 203–211.
    • (1973) IEEE Trans. Circuit Theory , vol.CT-20 , pp. 203-211
    • Fratta, L.1    Montanari, U.G.2
  • 5
    • 0019241581 scopus 로고
    • Recursive disjoint products, inclusion-exclusion and min-cut approximations
    • Dec
    • M.O. Locks, “Recursive disjoint products, inclusion-exclusion and min-cut approximations”, IEEE Trans. Reliability, vol R-29, 1980 Dec, pp 368–371.
    • (1980) IEEE Trans. Reliability , vol.R-29 , pp. 368-371
    • Locks, M.O.1
  • 6
    • 0019070318 scopus 로고
    • An algebraic technique for reliability evaluation
    • Oct
    • R.K. Tiwari, M. Verma, “An algebraic technique for reliability evaluation”, IEEE Trans. Reliability, vol R-29, No. 4, 1980 Oct, pp 311–313.
    • (1980) IEEE Trans. Reliability , vol.R-29 , Issue.4 , pp. 311-313
    • Tiwari, R.K.1    Verma, M.2
  • 7
    • 0016539257 scopus 로고
    • On the analysis of fault trees
    • Aug
    • R.G. Bennetts, “On the analysis of fault trees”, IEEE Trans. Reliability, vol R-24, 1975 Aug, pp 175–185.
    • (1975) IEEE Trans. Reliability , vol.R-24 , pp. 175-185
    • Bennetts, R.G.1
  • 8
    • 0016944224 scopus 로고
    • A new algorithm for symbolic system reliability analysis
    • Apr
    • P.M. Lin, B.J. Leon, T.C. Huang, “A new algorithm for symbolic system reliability analysis”, IEEE Trans. Reliability, vol R-25, 1976 Apr, pp 2–15.
    • (1976) IEEE Trans. Reliability , vol.R-25 , pp. 2-15
    • Lin, P.M.1    Leon, B.J.2    Huang, T.C.3
  • 9
    • 0017478348 scopus 로고
    • Calculating the probability of Boolean expression being 1
    • R.G. Bennetts, D.B. Brown, “Referee's Comments”; W.G. Schneeweiss, “Author's Reply”
    • W.G. Schneeweiss, “Calculating the probability of Boolean expression being 1”, R.G. Bennetts, D.B. Brown, “Referee's Comments”; W.G. Schneeweiss, “Author's Reply”, IEEE Trans. Reliability, vol R-26, 1977 Apr, pp 16–22.
    • (1977) IEEE Trans. Reliability , vol.R-26 , pp. 16-22
    • Schneeweiss, W.G.1
  • 10
    • 0017999081 scopus 로고
    • An efficient method for reliability evaluation of a general network
    • Aug
    • S. Rai, K.K. Aggarwal, “An efficient method for reliability evaluation of a general network”, IEEE Trans. Reliability, vol R-27, No. 3, 1978 Aug, pp 206–211.
    • (1978) IEEE Trans. Reliability , vol.R-27 , Issue.3 , pp. 206-211
    • Rai, S.1    Aggarwal, K.K.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.