메뉴 건너뛰기




Volumn 223, Issue 4, 2009, Pages 301-311

Minimal cutsets-based reduction approach for the use of binary decision diagrams on probabilistic safety assessment fault tree models

Author keywords

Binary cecision diagrams; Fault tree analysis; Minimal cutsets; Probabilistic safety assessment; Variable ordering heuristics

Indexed keywords

ASSESSMENT METHODS; COMPUTATION PROCESS; COMPUTATIONAL RESOURCES; CONVERSION PROCEDURES; EVENT TREES; FAULT TREE MODEL; FAULT-TREES; HYBRID ALGORITHMS; MINIMAL CUTSETS; NEW APPROACHES; POTENTIAL SOLUTIONS; PROBABILISTIC SAFETY ASSESSMENT; RELIABILITY MODEL; REWRITING STRATEGIES; STATIC AND DYNAMIC; STRUCTURAL INFORMATION; TOPOLOGICAL INFORMATION; VARIABLE ORDERING; VARIABLE ORDERING HEURISTICS;

EID: 77149157484     PISSN: 1748006X     EISSN: 17480078     Source Type: Journal    
DOI: 10.1243/1748006XJRR259     Document Type: Article
Times cited : (7)

References (27)
  • 2
    • 0034197755 scopus 로고    scopus 로고
    • Event-tree analysis using binary decision diagrams
    • J. D Andrews, S. J Dunnett, Event-tree analysis using binary decision diagrams IEEE Trans. Reliability 49 (2) (2000): 230-239
    • (2000) IEEE Trans. Reliability , vol.49 , Issue.2 , pp. 230-239
    • Andrews, J.D.1    Dunnett, S.J.2
  • 4
    • 0035720977 scopus 로고    scopus 로고
    • Mathematical foundations of minimal cutsets
    • A Rauzy, Mathematical foundations of minimal cutsets IEEE Trans. Reliability 50 (4) (2001): 389-396
    • (2001) IEEE Trans. Reliability , vol.50 , Issue.4 , pp. 389-396
    • Rauzy, A.1
  • 5
    • 0005255668 scopus 로고
    • A new methodology for obtaining cut sets for fault trees
    • J. B Fussel, W. E Vesely, 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
    • Fussel, J.B.1    Vesely, W.E.2
  • 6
    • 0346341075 scopus 로고    scopus 로고
    • A fast BDD algorithm for large coherent fault trees analysis
    • W. S Jung, S. H Han, J Ha, A fast BDD algorithm for large coherent fault trees analysis Reliability Engng System Saf. 83 (2004): 369-374
    • (2004) Reliability Engng System Saf. , vol.83 , pp. 369-374
    • Jung, W.S.1    Han, S.H.2    Ha, J.3
  • 7
    • 0022769976 scopus 로고
    • Graph based algorithms for Boolean function manipulation
    • R. E Bryant, Graph based algorithms for Boolean function manipulation IEEE Trans. Computers 35 (8) (1986): 677-691
    • (1986) IEEE Trans. Computers , vol.35 , Issue.8 , pp. 677-691
    • Bryant, R.E.1
  • 8
    • 0026913667 scopus 로고
    • Symbolic Boolean manipulation with ordered binary decision diagrams
    • R. E Bryant, Symbolic Boolean manipulation with ordered binary decision diagrams ACM Comput. Surv. 24 (1992): 293-318
    • (1992) ACM Comput. Surv. , vol.24 , pp. 293-318
    • Bryant, R.E.1
  • 10
    • 2842542733 scopus 로고    scopus 로고
    • A brief introduction to binary decision diagrams
    • A Rauzy, A brief introduction to binary decision diagrams Eur. J. Automn 30 (1996): 1033-1050
    • (1996) Eur. J. Automn , vol.30 , pp. 1033-1050
    • Rauzy, A.1
  • 13
    • 0030246260 scopus 로고    scopus 로고
    • Improving the variable ordering of OBDD is NP-complete
    • B Bollig, I Wegener, Improving the variable ordering of OBDD is NP-complete IEEE Trans. Computers 45 (9) (1996): 993-1001
    • (1996) IEEE Trans. Computers , vol.45 , Issue.9 , pp. 993-1001
    • Bollig, B.1    Wegener, I.2
  • 14
    • 0025432031 scopus 로고
    • Finding the optimal variable ordering for binary decision diagrams
    • S. J Friedman, K. J Supowit, Finding the optimal variable ordering for binary decision diagrams IEEE Trans. Computers 39 (5) (1990): 710-713
    • (1990) IEEE Trans. Computers , vol.39 , Issue.5 , pp. 710-713
    • Friedman, S.J.1    Supowit, K.J.2
  • 16
    • 84993683812 scopus 로고    scopus 로고
    • Variable ordering schemes to apply to the binary decision diagram methodology for event tree sequences assessment
    • DOI: 10.1243/1748006XJRR67
    • C Ibaez-Llano, E Meléndez, F Nieto, Variable ordering schemes to apply to the binary decision diagram methodology for event tree sequences assessment Proc. IMechE, Part O: J. Risk and Reliability 222 (O1) (2008): 7-16 DOI: 10.1243/1748006XJRR67
    • (2008) Proc. IMechE, Part O: J. Risk and Reliability , vol.222 , Issue.1 , pp. 7-16
    • Ibaez-Llano, C.1    Meléndez, E.2    Nieto, F.3
  • 18
    • 0031222261 scopus 로고    scopus 로고
    • Improving efficiency in qualitative fault tree analysis
    • R. M Sinnamon, J. D Andrews, Improving efficiency in qualitative fault tree analysis Qual. Reliability Engng Int. 13 (1997): 293-298
    • (1997) Qual. Reliability Engng Int. , vol.13 , pp. 293-298
    • Sinnamon, R.M.1    Andrews, J.D.2
  • 25
    • 84990317145 scopus 로고    scopus 로고
    • Assessment of large automatically generated fault trees by means of binary decision diagrams
    • DOI: 10.1243/1748006XJRR47
    • A Rauzy, J Gauthier, X Leduc, Assessment of large automatically generated fault trees by means of binary decision diagrams Proc. IMechE, Part O: J. Risk and Reliability 221 (O2) (2007): 95-105 DOI: 10.1243/1748006XJRR47
    • (2007) Proc. IMechE, Part O: J. Risk and Reliability , vol.221 , Issue.2 , pp. 95-105
    • Rauzy, A.1    Gauthier, J.2    Leduc, X.3


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