메뉴 건너뛰기




Volumn 48, Issue 1, 1999, Pages 31-41

An algorithm to find minimal cuts of coherent fault-trees with event-classes, using a decision tree

Author keywords

Decision tree; Fault tree; Minimal cuts

Indexed keywords

ALGORITHMS; DECISION THEORY; FAULT TREE ANALYSIS; HEURISTIC METHODS; TREES (MATHEMATICS);

EID: 0032623496     PISSN: 00189529     EISSN: None     Source Type: Journal    
DOI: 10.1109/24.765925     Document Type: Article
Times cited : (26)

References (26)
  • 2
    • 0017007915 scopus 로고    scopus 로고
    • "An efficient algorithm for reducing the complexity of computation in fault tree analysis"
    • vol NS- 23, 1976 Oct, pp 1442 - 1446.
    • N.N. Bengiamin, B.A. Bowen, K.F. Schenk, "An efficient algorithm for reducing the complexity of computation in fault tree analysis", IEEE Trans. Nuclear Science, vol NS-23, 1976 Oct, pp 1442 - 1446.
    • IEEE Trans. Nuclear Science
    • Bengiamin, N.N.1    Bowen, B.A.2    Schenk, K.F.3
  • 3
    • 0016539257 scopus 로고    scopus 로고
    • "On the analysis of fault trees"
    • vol R- 24, 1975 Aug, pp 175 - 185.
    • R.G. Bennets, "On the analysis of fault trees", IEEE Trans. Reliability, vol R-24, 1975 Aug, pp 175 - 185.
    • IEEE Trans. Reliability
    • Bennets, R.G.1
  • 4
    • 0026913667 scopus 로고    scopus 로고
    • "Symbolic Boolean manipulation with ordered binary decision diagrams"
    • vol 24, 1992, pp 293 - 318.
    • R. Bryant, "Symbolic Boolean manipulation with ordered binary decision diagrams", ACM Computing Surveys, vol 24, 1992, pp 293 - 318.
    • ACM Computing Surveys
    • Bryant, R.1
  • 5
    • 84866825029 scopus 로고    scopus 로고
    • "Improving availability bounds using the failure distance concept"
    • vol 5, 1995, pp 479 - 497; Springer-Verlag.
    • J.A. Carrasco, "Improving availability bounds using the failure distance concept", Dependable Computing and Fault-Tolerant Systems, vol 5, 1995, pp 479 - 497; Springer-Verlag.
    • Dependable Computing and Fault-Tolerant Systems
    • Carrasco, J.A.1
  • 6
    • 0030147044 scopus 로고    scopus 로고
    • "Efficient exploration of availability models guided by failure distances"
    • vol 24, 1996 no. 1, May, pp 242 - 251.
    • J.A. Carrasco, J. Escribe, A. Calderön, "Efficient exploration of availability models guided by failure distances", A CM Performance Evaluation Review, vol 24, 1996 no. 1, May, pp 242 - 251.
    • A CM Performance Evaluation Review
    • Carrasco, J.A.1    Escribe, J.2    Calderön, A.3
  • 7
    • 2342545253 scopus 로고    scopus 로고
    • "Modularization of fault trees: A method to reduce the cost of analysis"
    • 1975, pp 101 - 126; S1AM.
    • P. Chatterjee, "Modularization of fault trees: A method to reduce the cost of analysis", Reliability and Fault Tree Analysis, 1975, pp 101 - 126; S1AM.
    • Reliability and Fault Tree Analysis
    • Chatterjee, P.1
  • 8
    • 0028388503 scopus 로고    scopus 로고
    • "MetaPrime: An interactive fault-tree analyzer"
    • vol 43, 1994 Mar, pp 121 - 127.
    • O. Coudert, J. C. Madre, "MetaPrime: An interactive fault-tree analyzer", IEEE Trans. Reliability, vol 43, 1994 Mar, pp 121 - 127.
    • IEEE Trans. Reliability
    • Coudert, O.1    Madre, J.C.2
  • 9
    • 0030245278 scopus 로고    scopus 로고
    • "A linear-time algorithm to find modules of fault trees"
    • vol 45, 1996 Sep, pp 422 - 425.
    • Y. Dutuit, A. Rauzy, "A linear-time algorithm to find modules of fault trees", IEEE Trans. Reliability, vol 45, 1996 Sep, pp 422 - 425.
    • IEEE Trans. Reliability
    • Dutuit, Y.1    Rauzy, A.2
  • 10
    • 0020923381 scopus 로고    scopus 로고
    • "On the acceleration of test generation algorithms"
    • vol C- 32, 1983 Dec, pp 1137- 1144.
    • H. Fujiwara, T. Shimano, "On the acceleration of test generation algorithms", IEEE Trans. Computers, vol C-32, 1983 Dec, pp 1137- 1144.
    • IEEE Trans. Computers
    • Fujiwara, H.1    Shimano, T.2
  • 11
    • 0005255668 scopus 로고    scopus 로고
    • "A new methodology for obtaining cut sets for fault trees"
    • vol 15, 1972 Jun, pp 262 - 263.
    • J.B. Fussell. W. E. Vesely, "A new methodology for obtaining cut sets for fault trees", Trans. American Nuclear Society, vol 15, 1972 Jun, pp 262 - 263.
    • Trans. American Nuclear Society
    • Fussell, J.B.1    Vesely, W.E.2
  • 12
    • 0019543877 scopus 로고    scopus 로고
    • "An implicit enumeration algorithm to generate tests for combinational logic circuits"
    • vol C- 30, 1981 Mar, pp 215 - 222.
    • P. Goel, "An implicit enumeration algorithm to generate tests for combinational logic circuits", IEEE Trans. Computers, vol C-30, 1981 Mar, pp 215 - 222.
    • IEEE Trans. Computers
    • Goel, P.1
  • 13
    • 0018524018 scopus 로고    scopus 로고
    • "Controllability/observability analysis of digital circuits"
    • vol CAS- 26, 1979 Sep, pp 685 - 693.
    • L.H. Goldstein, "Controllability/observability analysis of digital circuits", IEEE Trans. Circuits and Systems, vol CAS-26, 1979 Sep, pp 685 - 693.
    • IEEE Trans. Circuits and Systems
    • Goldstein, L.H.1
  • 14
    • 0029379220 scopus 로고    scopus 로고
    • "FAMOCUTN & CUTQN: Programs for fast analysis of large fault trees with replicated & negated gates"
    • vol 44, 1995 Sep, pp 368 - 376.
    • W. Hennings, N. Kuznetsov, "FAMOCUTN & CUTQN: Programs for fast analysis of large fault trees with replicated & negated gates", IEEE Trans. Reliability, vol 44, 1995 Sep, pp 368 - 376.
    • IEEE Trans. Reliability
    • Hennings, W.1    Kuznetsov, N.2
  • 16
    • 0022868793 scopus 로고    scopus 로고
    • "An algorithm for reducing cut sets in fault-tree analysis"
    • vol R- 35, 1986 Dec, pp 559 - 561.
    • N. Limnios, R. Ziani, "An algorithm for reducing cut sets in fault-tree analysis", IEEE Trans. Reliability, vol R-35, 1986 Dec, pp 559 - 561.
    • IEEE Trans. Reliability
    • Limnios, N.1    Ziani, R.2
  • 17
    • 0018767339 scopus 로고    scopus 로고
    • "An efficient bottom-up algorithm for enumerating minimal cut sets of fault trees"
    • vol R- 28, 1979 Dec, pp 353 -357.
    • K. Nakashima, Y. Hattori, "An efficient bottom-up algorithm for enumerating minimal cut sets of fault trees", IEEE Trans. Reliability, vol R-28, 1979 Dec, pp 353 -357.
    • IEEE Trans. Reliability
    • Nakashima, K.1    Hattori, Y.2
  • 18
    • 84866811293 scopus 로고    scopus 로고
    • "A new algorithm for fault trees prime implicant computations"
    • Crete (Greece), 1996 Jun, pp 1085 - 1090.
    • K. Odeh, N. Limnios, "A new algorithm for fault trees prime implicant computations", ESREL'96, Crete (Greece), 1996 Jun, pp 1085 - 1090.
    • ESREL'96
    • Odeh, K.1    Limnios, N.2
  • 19
    • 0018020091 scopus 로고    scopus 로고
    • "FATRAM - A core efficient cut-set algorithm"
    • vol R-27, 1978 Oct, pp 250 - 253.
    • D.M. Rasmuson, N.H. Marshall, "FATRAM - A core efficient cut-set algorithm", IEEE Trans. Reliability, vol R-27, 1978 Oct, pp 250 - 253.
    • IEEE Trans. Reliability
    • Rasmuson, D.M.1    Marshall, N.H.2
  • 20
    • 0027289814 scopus 로고    scopus 로고
    • "New algorithms for fault trees analysis"
    • vol 40, 1993, pp 203 - 211.
    • A. Rauzy, "New algorithms for fault trees analysis", Reliability Engineering and System Safety, vol 40, 1993, pp 203 - 211.
    • Reliability Engineering and System Safety
    • Rauzy, A.1
  • 21
    • 0000658735 scopus 로고    scopus 로고
    • "A computer scientist looks at reliability computations"
    • 1975, pp 133 - 152; SIAM.
    • A. Rosenthal, "A computer scientist looks at reliability computations", Reliability and Fault Tree Analysis, 1975, pp 133 - 152; SIAM.
    • Reliability and Fault Tree Analysis
    • Rosenthal, A.1
  • 22
    • 0019024595 scopus 로고    scopus 로고
    • "Decomposition methods for fault tree analysis"
    • vol R- 29, 1980 Jun, pp 136 -138.
    • A. Rosenthal, "Decomposition methods for fault tree analysis", IEEE Trans. Reliability, vol R-29, 1980 Jun, pp 136 -138.
    • IEEE Trans. Reliability
    • Rosenthal, A.1
  • 23
    • 0015018662 scopus 로고    scopus 로고
    • "ELRAFT: A computer program for the efficient logic reduction analysis of fault trees"
    • vol NS- 18, 1971 Feb, pp 481 -487.
    • S. N. Semanders, "ELRAFT: A computer program for the efficient logic reduction analysis of fault trees", IEEE Trans. Nuclear Science, vol NS-18, 1971 Feb, pp 481 -487.
    • IEEE Trans. Nuclear Science
    • Semanders, S.N.1
  • 26
    • 0022137430 scopus 로고    scopus 로고
    • "Modularizing and minimizing fault trees"
    • vol R- 34, 1985 Oct, pp 320 - 322.
    • J.M. Wilson, "Modularizing and minimizing fault trees", IEEE Trans. Reliability, vol R-34, 1985 Oct, pp 320 - 322.
    • IEEE Trans. Reliability
    • Wilson, J.M.1


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