메뉴 건너뛰기




Volumn R-28, Issue 5, 1979, Pages 353-357

An Efficient Bottom-up Algorithm for Enumerating Minimal Cut Sets of Fault Trees

Author keywords

Algorithm; Fault tree; Minimal cut set

Indexed keywords

RELIABILITY THEORY;

EID: 0018767339     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/TR.1979.5220639     Document Type: Article
Times cited : (10)

References (10)
  • 2
    • 0016539257 scopus 로고
    • On the analysis of fault tree
    • Aug
    • R.G. Bennetts, “On the analysis of fault tree,” IEEE Trans. Reliability, vol R-24, 1975 Aug, pp 175–185.
    • (1975) IEEE Trans. Reliability , vol.R-24 , pp. 175
    • Bennetts, R.G.1
  • 3
    • 84915013956 scopus 로고
    • Using the set equation transformation system in fault tree analysis
    • SIAM Conference Volume
    • R.B. Worrell, “Using the set equation transformation system in fault tree analysis,” Reliability and Fault Tree Analysis, SIAM Conference Volume, pp 165–185, 1975.
    • (1975) Reliability and Fault Tree Analysis , pp. 165-185
    • Worrell, R.B.1
  • 4
    • 0005255668 scopus 로고
    • A new methodology for obtaining cut sets for fault trees
    • Jun
    • 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.
    • (1972) Trans. American Nuclear Society , vol.15 , pp. 262
    • Fussell, J.B.1    Vesely, W.E.2
  • 6
    • 84936901466 scopus 로고    scopus 로고
    • Information for Readers & Authors
    • Supplement: NAPS document No. 03469; 28 pages in this Supplement. Order NAPS document No. 03469, 28 pages. ASIS-NAPS; Microfiche Publication; PO Box 3513, Grand Central Station; New York, NY 10017 USA
    • Supplement: NAPS document No. 03469; 28 pages in this Sup-plement. For current ordering information, see “Information for Readers & Authors” in a current issue. Order NAPS document No. 03469, 28 pages. ASIS-NAPS; Microfiche Publication; PO Box 3513, Grand Central Station; New York, NY 10017 USA.
  • 7
    • 33749554071 scopus 로고
    • Analysis of fault trees by using tree sequences
    • Apr
    • K. Nakashima, Y. Hattori, “Analysis of fault trees by using tree sequences,” Trans. of JECE of Japan, vol E60, 1977 Apr, pp 175–182.
    • (1977) Trans. of JECE of Japan , vol.E60 , pp. 175
    • Nakashima, K.1    Hattori, Y.2
  • 9
    • 0018020091 scopus 로고
    • FATRAM-A core efficient cutset set algorithm
    • Oct
    • D.M. Rasmuson, N.H. Marshall, “FATRAM-A core efficient cutset set algorithm,” IEEE Trans. Reliability, vol R-27, 1978 Oct, pp 250–253.
    • (1978) IEEE Trans. Reliability , vol.R-27 , pp. 250
    • Rasmuson, D.M.1    Marshall, N.H.2
  • 10
    • 0018455029 scopus 로고
    • Approaches to Comparing Cut-set Enumeration Algorithms
    • A. Rosenthal, “Approaches to Comparing Cut-set Enumeration Algorithms,” IEEE Trans. Reliability, vol R-28, 1979, pp 62–65.
    • (1979) IEEE Trans. Reliability , vol.R-28 , pp. 62
    • Rosenthal, A.1


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