메뉴 건너뛰기




Volumn R-24, Issue 3, 1975, Pages 175-185

On the Analysis of Fault Trees

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TREES;

EID: 0016539257     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/TR.1975.5215143     Document Type: Article
Times cited : (85)

References (9)
  • 2
    • 84939029448 scopus 로고
    • Computer aided generation of test sequences for logical systems
    • Ph.D. dissertation, University of Southhampton
    • R.G. Bennetts “Computer aided generation of test sequences for logical systems,” Ph.D. dissertation, University of Southhampton, 1972. (Not readily available).
    • (1972)
    • Bennetts, R.G.1
  • 3
    • 77957186383 scopus 로고
    • A realistic approach to detection test set generation for combinational logic circuits
    • Aug.
    • R.G. Bennetts “A realistic approach to detection test set generation for combinational logic circuits,” BCS Computer Journal, Vol. 15, pp. 238-246, Aug. 1972.
    • (1972) BCS Computer Journal , vol.15 , pp. 238-246
    • Bennetts, R.G.1
  • 5
    • 0043010957 scopus 로고
    • Probability maps
    • Sept.
    • R.B. Hurley “Probability maps,” IEEE Trans. Reliability, Vol. R-12, pp. 39-44, Sept. 1963.
    • (1963) IEEE Trans. Reliability , vol.R-12 , pp. 39-44
    • Hurley, R.B.1
  • 6
    • 84941449715 scopus 로고
    • Fault-tree analysis
    • Oct.
    • E. Phibbs and S.H. Kuwamoto “Fault-tree analysis,” IEEE Trans. Reliability, Vol. R-23, p. 226, Oct. 1974. (Correspondence).
    • (1974) IEEE Trans. Reliability , vol.R-23 , pp. 226
    • Phibbs, E.1    Kuwamoto, S.H.2
  • 7
    • 84915013959 scopus 로고
    • An efficient map method for processing multistate logic trees
    • May
    • E. Phibbs and S.H. Kuwamoto “An efficient map method for processing multistate logic trees,” IEEE Trans. Reliability, Vol. R-21, pp. 93-98, May 1972.
    • (1972) IEEE Trans. Reliability , vol.R-21 , pp. 93-98
    • Phibbs, E.1    Kuwamoto, S.H.2
  • 8
    • 0015626643 scopus 로고
    • A Boolean algebra method for computing the terminal reliability in a communication channel
    • May
    • L. Fratta and U.G. Montanari “A Boolean algebra method for computing the terminal reliability in a communication channel,” IEEE Trans. Circuit Theory, Vol. CT-20, pp. 203-211, May 1973.
    • (1973) IEEE Trans. Circuit Theory , vol.CT-20 , pp. 203-211
    • Fratta, L.1    Montanari, U.G.2
  • 9
    • 0014432215 scopus 로고
    • Heuristic switching expression simplification
    • Dr. R.G. Bennetts//Department of Electronics//The University// Southampton S09 5NH ENGLAND
    • M.A. Breuer “Heuristic switching expression simplification,” Proc. 1968 ACM National Conference, pp. 241-250, 1968. Dr. R.G. Bennetts//Department of Electronics//The University// Southampton S09 5NH ENGLAND
    • (1968) ACM National Conference , pp. 241-250
    • Breuer, M.A.1


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