Hybrid approach for the assessment of PSA models by means of binary decision diagrams

Abstract Binary decision diagrams are a well-known alternative to the minimal cutsets approach to assess the reliability Boolean models. They have been applied successfully to improve the fault trees models assessment. However, its application to solve large models, and in particular the event trees coming from the PSA studies of the nuclear industry, remains to date out of reach of an exact evaluation. For many real PSA models it may be not possible to compute the BDD within reasonable amount of time and memory without considering the truncation or simplification of the model. This paper presents a new approach to estimate the exact probabilistic quantification results (probability/frequency) based on combining the calculation of the MCS and the truncation limits, with the BDD approach, in order to have a better control on the reduction of the model and to properly account for the success branches. The added value of this methodology is that it is possible to ensure a real confidence interval of the exact value and therefore an explicit knowledge of the error bound. Moreover, it can be used to measure the acceptability of the results obtained with traditional techniques. The new method was applied to a real life PSA study and the results obtained confirm the applicability of the methodology and open a new viewpoint for further developments.

[1]  R. Rudell.  Dynamic variable ordering for ordered binary decision diagrams , 1993, ICCAD 1993.

[2]  Jaejoo Ha,et al.  A fast BDD algorithm for large coherent fault trees analysis , 2004, Reliab. Eng. Syst. Saf..

[3]  W. E. Vesely,et al.  NEW METHODOLOGY FOR OBTAINING CUT SETS FOR FAULT TREES. , 1972 .

[4]  A. Rauzy,et al.  BDD BASED FAULT-TREE PROCESSING : A COMPARISON OF VARIABLE ORDERING HEURISTICS , .

[5]  Randal E. Bryant,et al.  Efficient implementation of a BDD package , 1991, DAC '90.

[6]  S. Contini.  A new hybrid method for fault tree analysis , 1995 .

[7]  Beate Bollig,et al.  Improving the Variable Ordering of OBDDs Is NP-Complete , 1996, IEEE Trans. Computers.

[8]  Joon-Eon Yang,et al.  Development of measures to estimate truncation error in fault tree analysis , 2005, Reliab. Eng. Syst. Saf..

[9]  W. E. Vesely,et al.  A time-dependent methodology for fault tree evaluation , 1970 .

[10]  Kenneth J. Supowit,et al.  Finding the Optimal Variable Ordering for Binary Decision Diagrams , 1990, IEEE Trans. Computers.

[11]  Sofia Cassel,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 2012 .

[12]  Krishna B. Misra,et al.  Handbook of Performability Engineering , 2008 .

[13]  Marko Cepin.  Analysis of truncation limit in probabilistic safety assessment , 2005, Reliab. Eng. Syst. Saf..

[14]  G. G. M. Cojazzi,et al.  On the use of non-coherent fault trees in safety and security studies , 2008, Reliab. Eng. Syst. Saf..

[15]  C. Ibáñez-Llano,et al.  Variable ordering schemes to apply to the binary decision diagram methodology for event tree sequences assessment , 2008 .

[16]  Lisa Marie Bartlett.  Variable ordering heuristics for binary decision diagrams , 2000 .

[17]  Antoine Rauzy.  Toward an efficient implementation of the MOCUS algorithm , 2003, IEEE Trans. Reliab..

[18]  Antoine Rauzy,et al.  Binary Decision Diagrams for Reliability Studies , 2008 .

[19]  Antoine Rauzy,et al.  New algorithms for fault trees analysis , 1993 .

[20]  Antoine Rauzy,et al.  A brief introduction to Binary Decision Diagrams , 1996 .

[21]  Roslyn M. Sinnamon,et al.  Improved efficiency in qualitative fault tree analysis , 1997 .

[22]  R. Rudell.  Dynamic variable ordering for ordered binary decision diagrams , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[23]  Contini Sergio,et al.  On the Need of Exact Probabilistic Quantification in FT/ET Analysis , 2005 .

[24]  Antoine Rauzy,et al.  Minimal cutsets-based reduction approach for the use of binary decision diagrams on probabilistic safety assessment fault tree models , 2009 .

[25]  John D. Andrews,et al.  A fault tree analysis strategy using binary decision diagrams , 2002, Reliab. Eng. Syst. Saf..

[26]  C. Guedes Soares,et al.  Advances in Safety and Reliability , 1997 .

[27]  A B Rauzy.  Some disturbing facts about depth-first left-most variable ordering heuristics for binary decision diagrams , 2008 .

[28]  John Andrews,et al.  Calculating the failure intensity of a non-coherent fault tree using the BDD technique , 2004 .

[29]  Hannu Tenhunen,et al.  Extending systems-on-chip to the third dimension: performance, cost and technological tradeoffs , 2007, ICCAD 2007.

[30]  Roslyn M. Sinnamon,et al.  Improved accuracy in quantitative fault tree analysis , 1997 .

[31]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[32]  Olivier P. M. Nusbaumer,et al.  Analytical solutions of linked fault tree probabilistic risk assessments using binary decision diagrams with emphasis on nuclear safety applications , 2007 .

[33]  Steve Epstein,et al.  Can we trust PRA? , 2005, Reliab. Eng. Syst. Saf..

[34]  Antoine Rauzy.  Mathematical foundations of minimal cutsets , 2001, IEEE Trans. Reliab..

[35]  Huo Hongxia.  Event-tree Analysis Using Binary Decision Diagrams , 2008 .