Complex fault tree analysis based on BDD route-based rules
暂无分享,去创建一个
[1] Jaejoo Ha,et al. A fast BDD algorithm for large coherent fault trees analysis , 2004, Reliab. Eng. Syst. Saf..
[2] C. Y. Lee. Representation of switching circuits by binary-decision programs , 1959 .
[3] Kishor S. Trivedi,et al. A BDD-Based Algorithm for Analysis of Multistate Systems with Multistate Components , 2003, IEEE Trans. Computers.
[4] Yuan-Shun Way,et al. A simple component-connection method for building binary decision diagrams encoding a fault tree , 2000, Reliab. Eng. Syst. Saf..
[5] Suguo Du,et al. New Progressive Variable Ordering for Binary Decision Diagram Analysis of Fault Trees , 2005 .
[6] R. Bryant. Graph-Based Algorithms for Boolean Function Manipulation12 , 1986 .
[7] Rasa Remenyte-Prescott,et al. A simple component connection approach for fault tree conversion to binary decision diagram , 2006, First International Conference on Availability, Reliability and Security (ARES'06).
[8] Sheldon B. Akers,et al. Binary Decision Diagrams , 1978, IEEE Transactions on Computers.
[9] A. Saltelli,et al. Reliability Engineering and System Safety , 2008 .
[10] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[11] Antoine Rauzy,et al. New algorithms for fault trees analysis , 1993 .