A reduction approach to improve the quantification of linked fault trees through binary decision diagrams
暂无分享,去创建一个
[1] Randal E. Bryant,et al. Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.
[2] Jaejoo Ha,et al. A fast BDD algorithm for large coherent fault trees analysis , 2004, Reliab. Eng. Syst. Saf..
[3] C. Guedes Soares,et al. Advances in Safety and Reliability , 1997 .
[4] Huo Hongxia. Event-tree Analysis Using Binary Decision Diagrams , 2008 .
[5] S. Contini. A new hybrid method for fault tree analysis , 1995 .
[6] John Andrews,et al. Quantitative fault tree analysis using Binary Decision Diagrams , 1996 .
[7] Steve Epstein,et al. Can we trust PRA? , 2005, Reliab. Eng. Syst. Saf..
[8] A. Rauzy,et al. BDD BASED FAULT-TREE PROCESSING : A COMPARISON OF VARIABLE ORDERING HEURISTICS , .
[9] Joon-Eon Yang,et al. Development of measures to estimate truncation error in fault tree analysis , 2005, Reliab. Eng. Syst. Saf..
[10] W. E. Vesely,et al. A time-dependent methodology for fault tree evaluation , 1970 .
[11] Kenneth J. Supowit,et al. Finding the Optimal Variable Ordering for Binary Decision Diagrams , 1990, IEEE Trans. Computers.
[12] Sofia Cassel,et al. Graph-Based Algorithms for Boolean Function Manipulation , 2012 .
[13] Antoine Rauzy. Mathematical foundations of minimal cutsets , 2001, IEEE Trans. Reliab..
[14] Randal E. Bryant,et al. Efficient implementation of a BDD package , 1991, DAC '90.
[15] Enrique Meléndez,et al. Relationship between probabilistic dynamics and event trees , 1996 .
[16] Marko Cepin. Analysis of truncation limit in probabilistic safety assessment , 2005, Reliab. Eng. Syst. Saf..
[17] Antoine Rauzy,et al. New algorithms for fault trees analysis , 1993 .
[18] Antoine Rauzy,et al. A brief introduction to Binary Decision Diagrams , 1996 .
[19] R. Rudell. Dynamic variable ordering for ordered binary decision diagrams , 1993, ICCAD 1993.
[20] Antoine Rauzy. Toward an efficient implementation of the MOCUS algorithm , 2003, IEEE Trans. Reliab..
[21] Macha Nikolskaia. Fine-tuning of boolean formulae preprocessing techniques , 1999 .
[22] R. Rudell. Dynamic variable ordering for ordered binary decision diagrams , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).
[23] Beate Bollig,et al. Improving the Variable Ordering of OBDDs Is NP-Complete , 1996, IEEE Trans. Computers.
[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] G. G. M. Cojazzi,et al. On the use of non-coherent fault trees in safety and security studies , 2008, Reliab. Eng. Syst. Saf..
[26] C. Ibáñez-Llano,et al. Variable ordering schemes to apply to the binary decision diagram methodology for event tree sequences assessment , 2008 .
[27] Joon-Eon Yang,et al. FAST BDD TRUNCATION METHOD FOR EFFICIENT TOP EVENT PROBABILITY CALCULATION , 2008 .