메뉴 건너뛰기




Volumn R-27, Issue 3, 1978, Pages 206-211

An Efficient Method for Reliability Evaluation of a General Network

Author keywords

Exclusive operator; Path enumeration; Symbolic reliability evaluation; System success determinant

Indexed keywords

ELECTRIC NETWORKS;

EID: 0017999081     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/TR.1978.5220325     Document Type: Article
Times cited : (87)

References (12)
  • 3
    • 0015346480 scopus 로고
    • Computer-aided reliability analysis of complicated networks
    • May
    • E. V. Krishnamurthy, G. Komissar, “Computer-aided reliability analysis of complicated networks”, IEEE Trans. Reliability, vol R-21, 1972 May, pp 86–89.
    • (1972) IEEE Trans. Reliability , vol.R-21 , pp. 86-89
    • Krishnamurthy, E.V.1    Komissar, G.2
  • 4
    • 0015432851 scopus 로고
    • A method for computing complex system reliability
    • Nov
    • Y. H. Kim, K. E. Case, P. M. Ghare, “A method for computing complex system reliability”, IEEE Trans. Reliability, vol R-21, 1972 Nov, pp 215–219.
    • (1972) IEEE Trans. Reliability , vol.R-21 , pp. 215-219
    • Kim, Y.H.1    Case, K.E.2    Ghare, P.M.3
  • 6
    • 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
  • 7
    • 0015626643 scopus 로고
    • A Boolean algebra method for computing the terminal reliability in a communication network
    • May
    • L. Fratta, U. G. Montanri, “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    Montanri, U.G.2
  • 8
    • 0016495435 scopus 로고
    • A fast algorithm for reliability evaluation
    • Apr
    • K. K. Aggarwal, et al., “A fast algorithm for reliability evaluation”, IEEE Trans. Reliability, vol R-24, 1975 Apr, pp 83–85.
    • (1975) IEEE Trans. Reliability , vol.R-24 , pp. 83-85
    • Aggarwal, K.K.1
  • 9
    • 0015161219 scopus 로고
    • An efficient algorithm for generating complete test sets for combinational logic circuits
    • Nov
    • S. S. Yau, Y. S. Tang, “An efficient algorithm for generating complete test sets for combinational logic circuits”, IEEE Trans. Computers, vol C-20, 1971 Nov, pp 1245–1251.
    • (1971) IEEE Trans. Computers , vol.C-20 , pp. 1245-1251
    • Yau, S.S.1    Tang, Y.S.2
  • 10
    • 0016944224 scopus 로고
    • A new algorithm for symbolic system reliability evaluation
    • Apr
    • P. M. Lin, B. J. Leon, T. C. Huang, “A new algorithm for symbolic system reliability evaluation”, 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
  • 11
    • 84942008263 scopus 로고
    • A simple method for reliability evaluation of a communication system
    • May
    • K. K. Aggarwal, J. S. Gupta, K. B. Misra, “A simple method for reliability evaluation of a communication system”, IEEE Trans. Communications, vol COM-23, 1975 May, pp 563–566.
    • (1975) IEEE Trans. Communications , vol.COM-23 , pp. 563-566
    • Aggarwal, K.K.1    Gupta, J.S.2    Misra, K.B.3
  • 12
    • 84938446419 scopus 로고
    • A new approach to computing the terminal reliability in large complex networks
    • Dec
    • T. Tsuboi, K. Aihara, “A new approach to computing the terminal reliability in large complex networks”, Trans. IECE, vol 58-A, 1975 Dec, pp 783-790.
    • (1975) Trans. IECE , vol.58-A , pp. 783-790
    • Tsuboi, T.1    Aihara, K.2


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