메뉴 건너뛰기




Volumn 88, Issue 3, 2005, Pages 195-205

Can we trust PRA?

Author keywords

Binary decision diagrams; Event Trees; Minimal cutsets; Probabilistic risk assessment

Indexed keywords

APPROXIMATION THEORY; BINARY SEQUENCES; BOOLEAN ALGEBRA; FAILURE ANALYSIS; MATHEMATICAL MODELS; PROBABILITY; PROBLEM SOLVING; RISK ASSESSMENT; SENSITIVITY ANALYSIS;

EID: 15744365034     PISSN: 09518320     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ress.2004.07.013     Document Type: Article
Times cited : (89)

References (25)
  • 1
    • 0034197755 scopus 로고    scopus 로고
    • Event tree analysis using binary decision diagrams
    • J.D. Andrews, and S.J. Dunnett Event tree analysis using binary decision diagrams IEEE Trans Reliab 49 2000 230 239
    • (2000) IEEE Trans Reliab , vol.49 , pp. 230-239
    • Andrews, J.D.1    Dunnett, S.J.2
  • 2
    • 0030246260 scopus 로고    scopus 로고
    • Improving the variable ordering of OBDD is NP-complete
    • B. Bollig, and I. Wegener Improving the variable ordering of OBDD is NP-complete IEEE Trans Software Eng 45 9 1996 993 1001
    • (1996) IEEE Trans Software Eng , vol.45 , Issue.9 , pp. 993-1001
    • Bollig, B.1    Wegener, I.2
  • 3
    • 0035341687 scopus 로고    scopus 로고
    • A new importance measure for risk-informed decision making
    • E. Borgonovo, and G.E. Apostolakis A new importance measure for risk-informed decision making Reliab Eng Syst Saf 72 2001 193 212
    • (2001) Reliab Eng Syst Saf , vol.72 , pp. 193-212
    • Borgonovo, E.1    Apostolakis, G.E.2
  • 4
    • 0022769976 scopus 로고
    • Graph based algorithms for Boolean function manipulation
    • R. Bryant Graph based algorithms for Boolean function manipulation IEEE Trans Comput 35 8 1986 677 691
    • (1986) IEEE Trans Comput , vol.35 , Issue.8 , pp. 677-691
    • Bryant, R.1
  • 6
    • 0026913667 scopus 로고
    • Symbolic Boolean manipulation with ordered binary decision diagrams
    • R. 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.1
  • 8
    • 20144379174 scopus 로고    scopus 로고
    • Analysis of truncation limit in probabilistic safety assessment
    • M. Čepin Analysis of truncation limit in probabilistic safety assessment Reliab Eng Syst 2004 [in press]
    • (2004) Reliab Eng Syst
    • Čepin, M.1
  • 9
    • 0032083843 scopus 로고    scopus 로고
    • Use of importance measures in risk informed regulatory applications
    • M.C. Cheok, G.W. Parry, and R.R. Sherry Use of importance measures in risk informed regulatory applications Reliab Eng Syst Saf 60 1998 213 226
    • (1998) Reliab Eng Syst Saf , vol.60 , pp. 213-226
    • Cheok, M.C.1    Parry, G.W.2    Sherry, R.R.3
  • 10
    • 0035341763 scopus 로고    scopus 로고
    • Efficient algorithms to assess components and gates importances in Fault-Tree analysis
    • Y. Dutuit, and A. Rauzy Efficient algorithms to assess components and gates importances in Fault-Tree analysis Reliab Eng Syst Saf 72 2000 213 222
    • (2000) Reliab Eng Syst Saf , vol.72 , pp. 213-222
    • Dutuit, Y.1    Rauzy, A.2
  • 11
    • 15744389273 scopus 로고    scopus 로고
    • LukeTreeWalker: Specifications
    • ARBoost Technologies
    • Epstein S, Rauzy A. LukeTreeWalker: specifications. Technical Report TR2004-01, ARBoost Technologies.
    • Technical Report , vol.TR2004-01
    • Epstein, S.1    Rauzy, A.2
  • 13
    • 0005255668 scopus 로고
    • A new methodology for obtaining cut sets for Fault Trees
    • J.B. Fussel, and 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
  • 16
    • 0346341075 scopus 로고    scopus 로고
    • A fast BDD algorithm for large coherent fault trees analysis
    • W.S. Jung, S.H. Han, and J. Ha A fast BDD algorithm for large coherent fault trees analysis Reliab Eng Syst Saf 83 2004 369 374
    • (2004) Reliab Eng Syst Saf , vol.83 , pp. 369-374
    • Jung, W.S.1    Han, S.H.2    Ha, J.3
  • 20
    • 0032156545 scopus 로고    scopus 로고
    • Mathematical foundations of event trees
    • I.A. Papazoglou Mathematical foundations of event trees Reliab Eng Syst Saf 61 1998 169 183
    • (1998) Reliab Eng Syst Saf , vol.61 , pp. 169-183
    • Papazoglou, I.A.1
  • 21
    • 0027289814 scopus 로고
    • New algorithms for Fault Trees analysis
    • A. Rauzy New algorithms for Fault Trees analysis Reliab Eng Syst Saf 40 1993 203 211
    • (1993) Reliab Eng Syst Saf , vol.40 , pp. 203-211
    • Rauzy, A.1
  • 22
    • 0035720977 scopus 로고    scopus 로고
    • Mathematical foundation of minimal cutsets
    • A. Rauzy Mathematical foundation of minimal cutsets IEEE Trans Reliab 50 2001 389 396
    • (2001) IEEE Trans Reliab , vol.50 , pp. 389-396
    • Rauzy, A.1
  • 23
    • 0043175390 scopus 로고    scopus 로고
    • Towards an efficient implementation of mocus
    • A. Rauzy Towards an efficient implementation of mocus IEEE Trans Reliab 52 2003 175 180
    • (2003) IEEE Trans Reliab , vol.52 , pp. 175-180
    • Rauzy, A.1


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