메뉴 건너뛰기




Volumn 70, Issue 1, 2000, Pages 59-70

Simple component-connection method for building binary decision diagrams encoding a fault tree

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; DECISION TABLES; ENCODING (SYMBOLS);

EID: 0034287976     PISSN: 09518320     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0951-8320(00)00048-X     Document Type: Article
Times cited : (21)

References (15)
  • 2
    • 0031276402 scopus 로고    scopus 로고
    • Exact and truncated computations of prime implicants of coherent and non-coherent fault trees within Aralia
    • Rauzy A, Dutuit Y. Exact and truncated computations of prime implicants of coherent and non-coherent fault trees within Aralia. Reliability Engineering and System Safety 1997;58:127-44.
    • (1997) Reliability Engineering and System Safety , vol.58 , pp. 127-144
    • Rauzy, A.1    Dutuit, Y.2
  • 5
    • 0029755826 scopus 로고    scopus 로고
    • An ordering heuristic for building binary decision diagrams from fault-trees
    • Las Vegas, Nevada, 22-25 January 1996
    • Bouissou M. An ordering heuristic for building binary decision diagrams from fault-trees. Proceedings of the Annual Reliability and Maintainability Symposium, 1996, Las Vegas, Nevada, 22-25 January 1996. p. 208-14.
    • (1996) Proceedings of the Annual Reliability and Maintainability Symposium , pp. 208-214
    • Bouissou, M.1
  • 8
    • 84903828974 scopus 로고
    • Representation of switch circuits by binary-decision programs
    • Lee CY. Representation of switch circuits by binary-decision programs. Bell System Technology Journal 1959;38(4):985-99.
    • (1959) Bell System Technology Journal , vol.38 , Issue.4 , pp. 985-999
    • Lee, C.Y.1
  • 10
    • 0022769976 scopus 로고
    • Graph-based algorithms for Boolean function manipulation
    • Bryant RE. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers 1986;C-35(8):677-91.
    • (1986) IEEE Transactions on Computers , vol.C-35 , Issue.8 , pp. 677-691
    • Bryant, R.E.1
  • 11
    • 0026913667 scopus 로고
    • Symbolic Boolean manipulation with ordered binary decision diagrams
    • Bryant RE. Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys 1992;24(3):293-318.
    • (1992) ACM Computing Surveys , vol.24 , Issue.3 , pp. 293-318
    • Bryant, R.E.1
  • 12
    • 0004006612 scopus 로고
    • Redwood City, California: Benjamin/Cummings
    • Katz RH. Contemporary logic design. Redwood City, California: Benjamin/Cummings, 1994.
    • (1994) Contemporary Logic Design
    • Katz, R.H.1
  • 14
    • 0021787757 scopus 로고
    • An improved top-down algorithm combined with modularization as a highly efficient method for fault tree analysis
    • Camarinopoulos L, Yllera J. An improved top-down algorithm combined with modularization as a highly efficient method for fault tree analysis. Reliability Engineering 1985;11:93-108.
    • (1985) Reliability Engineering , vol.11 , pp. 93-108
    • Camarinopoulos, L.1    Yllera, J.2


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