메뉴 건너뛰기




Volumn 53, Issue 3, 2004, Pages 297-305

An intrinsic order criterion to evaluate large, complex fault trees

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; PROBABILITY; THEOREM PROVING;

EID: 4544358673     PISSN: 00189529     EISSN: None     Source Type: Journal    
DOI: 10.1109/TR.2004.833307     Document Type: Article
Times cited : (19)

References (15)
  • 1
    • 0003125244 scopus 로고
    • Fault tree analysis concepts and techniques
    • E. J. Henley and J. W. Lynn, Eds. Leyden, The Netherlands: NATO Advanced Study Institutes Series
    • J. B. Fussell, "Fault tree analysis concepts and techniques," in Generic Techniques in Systems Reliability Assessment, E. J. Henley and J. W. Lynn, Eds. Leyden, The Netherlands: NATO Advanced Study Institutes Series, 1976, pp. 133-162.
    • (1976) Generic Techniques in Systems Reliability Assessment , pp. 133-162
    • Fussell, J.B.1
  • 2
    • 84946648904 scopus 로고
    • Coherent structures of nonidentical components
    • J.D. Esary and F. Proschan, "Coherent structures of nonidentical components," Technometrics, vol. 5, no. 2, pp. 191-209, 1963.
    • (1963) Technometrics , vol.5 , Issue.2 , pp. 191-209
    • Esary, J.D.1    Proschan, F.2
  • 3
    • 0017997552 scopus 로고
    • A modular representation and analysis of fault trees
    • J. Olmos and L. Wolf, "A modular representation and analysis of fault trees," Nuclear Engineering and Design, vol. 48, pp. 531-561, 1978.
    • (1978) Nuclear Engineering and Design , vol.48 , pp. 531-561
    • Olmos, J.1    Wolf, L.2
  • 5
    • 0028388503 scopus 로고
    • Metaprime: An interactive fault-tree analyzer
    • Mar
    • O. Coudert and J. C. Madre, "Metaprime: An interactive fault-tree analyzer," IEEE Trans. Rel., vol. 43, pp. 121-127, Mar. 1994.
    • (1994) IEEE Trans. Rel. , vol.43 , pp. 121-127
    • Coudert, O.1    Madre, J.C.2
  • 7
    • 0024685226 scopus 로고
    • Direct evaluation of fault trees using object-oriented programming techniques
    • June
    • F. A. Patterson-Hine and B. V. Koen, "Direct evaluation of fault trees using object-oriented programming techniques," IEEE Trans. Rel., vol. 38, pp. 186-192, June 1989.
    • (1989) IEEE Trans. Rel. , vol.38 , pp. 186-192
    • Patterson-Hine, F.A.1    Koen, B.V.2
  • 8
    • 0026124389 scopus 로고
    • Direct evaluation algorithms for fault-tree probabilities
    • May
    • L. B. Page and J. E. Perry, "Direct evaluation algorithms for fault-tree probabilities," Computers & Chemical Engineering, vol. 15, no. 3, pp. 157-169, May 1991.
    • (1991) Computers and Chemical Engineering , vol.15 , Issue.3 , pp. 157-169
    • Page, L.B.1    Perry, J.E.2
  • 9
    • 4544231355 scopus 로고
    • A fast recursive algorithm to compute the probability of m-out-of-n events
    • Anaheim, USA
    • G. E. Radke and J. Evanoff, "A fast recursive algorithm to compute the probability of m-out-of-n events," in Proc. Annual Reliability & Maintainability Symp., Anaheim, USA, 1994, pp. 114-117.
    • (1994) Proc. Annual Reliability and Maintainability Symp. , pp. 114-117
    • Radke, G.E.1    Evanoff, J.2
  • 10
    • 0029510083 scopus 로고
    • Calculating exact top-event probabilities using II-Patrec
    • Dec
    • A. S. Heger, J. K. Bhat, D. W. Stack, and D. V. Talbott, "Calculating exact top-event probabilities using II-Patrec," IEEE Trans. Rel., vol. 44, pp. 640-644, Dec. 1995.
    • (1995) IEEE Trans. Rel. , vol.44 , pp. 640-644
    • Heger, A.S.1    Bhat, J.K.2    Stack, D.W.3    Talbott, D.V.4
  • 11
    • 4544314705 scopus 로고
    • A direct approach to obtain tighter bounds for large fault trees with repeated events
    • Anaheim, USA
    • S. Rai, "A direct approach to obtain tighter bounds for large fault trees with repeated events," in Proc. Annual Reliability & Maintainability Symp., Anaheim, USA, 1994, pp. 475-480.
    • (1994) Proc. Annual Reliability and Maintainability Symp. , pp. 475-480
    • Rai, S.1


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