메뉴 건너뛰기




Volumn 58, Issue 2, 1997, Pages 89-96

New approaches to evaluating fault trees

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; DECISION THEORY; DIGITAL COMPUTERS; PROBABILITY;

EID: 0031268797     PISSN: 09518320     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0951-8320(96)00036-1     Document Type: Article
Times cited : (76)

References (14)
  • 2
    • 0015018662 scopus 로고
    • 'ELRAFT,' a computer program for the efficient logic reduction analysis of fault trees
    • Semanderes, S.N. 'ELRAFT,' a computer program for the efficient logic reduction analysis of fault trees,. IEEE Trans. Nuclear Science, NS-18 (1971) 481-487.
    • (1971) IEEE Trans. Nuclear Science , vol.NS-18 , pp. 481-487
    • Semanderes, S.N.1
  • 3
    • 0005255668 scopus 로고
    • A new methodology for obtaining cut sets for fault trees
    • Fussell, J.B. & Vesley, W.E., A new methodology for obtaining cut sets for fault trees. Trans. Am. Nucl. Soc., 15 (1972) 262-263.
    • (1972) Trans. Am. Nucl. Soc. , vol.15 , pp. 262-263
    • Fussell, J.B.1    Vesley, W.E.2
  • 4
    • 0016539257 scopus 로고
    • On the analysis of fault trees
    • Bennetts, R.G., On the analysis of fault trees. IEEE Trans. Reliab., R-24 (1975) 175-185.
    • (1975) IEEE Trans. Reliab. , vol.R-24 , pp. 175-185
    • Bennetts, R.G.1
  • 5
    • 0017007915 scopus 로고
    • An efficient algorithm for reducing the complexity of computation in fault tree analysis
    • Bengiamin, N.N., Bowen, B.A. & Schenk, K.F., An efficient algorithm for reducing the complexity of computation in fault tree analysis. IEEE Trans. Nucl. Sci., NS-23 (1976) 1442-1446.
    • (1976) IEEE Trans. Nucl. Sci. , vol.NS-23 , pp. 1442-1446
    • Bengiamin, N.N.1    Bowen, B.A.2    Schenk, K.F.3
  • 6
    • 0027289814 scopus 로고
    • New algorithms for fault tree analysis
    • Rauzy, A., New algorithms for fault tree analysis. Reliab. Engng System Safety, 40 (1993) 203-211.
    • (1993) Reliab. Engng System Safety , vol.40 , pp. 203-211
    • Rauzy, A.1
  • 7
    • 0022868793 scopus 로고
    • An algorithm for reducing the minimal cut sets in fault tree analysis
    • Liminios, N. & Ziani, R., An algorithm for reducing the minimal cut sets in fault tree analysis. IEEE Trans. Reliab., R-35 (1986) 559-561.
    • (1986) IEEE Trans. Reliab. , vol.R-35 , pp. 559-561
    • Liminios, N.1    Ziani, R.2
  • 8
    • 0018020091 scopus 로고
    • FATRAM - A core efficient cut-set algorithm
    • Rasmuson, D.M. & Marshall, N.H., FATRAM - a core efficient cut-set algorithm. IEEE Trans. Reliab., R-27 (1978) 250-253.
    • (1978) IEEE Trans. Reliab. , vol.R-27 , pp. 250-253
    • Rasmuson, D.M.1    Marshall, N.H.2
  • 9
    • 0017983865 scopus 로고
    • Binary decision diagrams
    • Akers, S.B., Binary decision diagrams. IEEE Trans. Computers, C-27 (1978) 509-516.
    • (1978) IEEE Trans. Computers , vol.C-27 , pp. 509-516
    • Akers, S.B.1
  • 10
    • 0022769976 scopus 로고
    • Graph-based algorithms for Boolean function manipulation
    • Bryant, R.E., Graph-based algorithms for Boolean function manipulation. IEEE Trans. Computers, C-35 (1986) 677-691.
    • (1986) IEEE Trans. Computers , vol.C-35 , pp. 677-691
    • Bryant, R.E.1
  • 12
    • 0028388503 scopus 로고
    • MetaPrime: An interative fault-tree analyser
    • Coudert, O. & Madre, J., MetaPrime: an interative fault-tree analyser. IEEE Trans. Reliab., R-43 (1994) 121-127.
    • (1994) IEEE Trans. Reliab. , vol.R-43 , pp. 121-127
    • Coudert, O.1    Madre, J.2
  • 13
    • 0029734436 scopus 로고    scopus 로고
    • Fault tree analysis and binary decision diagrams
    • Las Vegas, Nevada, 22-25 January
    • Sinnamon, R.M. & Andrews, J.D., Fault tree analysis and binary decision diagrams. In Proceedings of RAMS'96 Conference, Las Vegas, Nevada, 22-25 January 1996, pp. 215-222.
    • (1996) Proceedings of RAMS'96 Conference , pp. 215-222
    • Sinnamon, R.M.1    Andrews, J.D.2
  • 14
    • 0029755826 scopus 로고    scopus 로고
    • An ordering heuristic for building binary decision diagrams from fault-trees
    • Las Vegas, Nevada, 22-25 January
    • Bouissou, M., An ordering heuristic for building binary decision diagrams from fault-trees. In Proceedings of RAMS'96 Conference, Las Vegas, Nevada, 22-25 January 1996, pp. 208-215.
    • (1996) Proceedings of RAMS'96 Conference , pp. 208-215
    • Bouissou, M.1


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