基于BDD的动态故障树优化分析研究

【作者】 张超；

【导师】 马存宝；

【作者基本信息】 西北工业大学 ， 通信与信息系统， 2004， 硕士

【摘要】 现今，故障树分析法已广泛地应用到系统可靠性和安全性的评价中。本文研究了动态建造故障树的方法，以及基于BDD的故障树定性分析、定量分析和模块分析方法。主要做了以下几方面的工作： 首先，提出了一种基于Windows界面的计算机辅助动态建造故障树的设计思想和实现方法，并在此基础上设计开发了一套可视化动态建造故障树软件，解决了当前建树方法通用性差和工作量大的问题。 其次，用基于结构重要度和基于神经网络两种方法实现了底事件最优指标顺序的确定，解决了底事件指标顺序对BDD规模的影响问题。依据布尔函数Shannon分解和BDD图的关系，用递归法实现了故障树向BDD转化。 再次，在基于BDD的故障树定性分析研究中，提出并实现了基于BDD和素数法相结合的单调关联故障树最小割集求解的新方法，用迭代法实现了非单调关联故障树质蕴含的求解。在基于BDD的故障树定量分析研究中，实现了顶事件发生概率和绝对失效强度的求解。为解决大型复杂故障树的简化分析问题，提出并实现了基于深度优先最左遍历和BDD相结合的故障树模块分析法。实现了计算机自动化故障树分析。通过这些方法，解决了基于布尔代数的故障树分析中长期存在的“组合爆炸”问题。 最后，探讨了故障树分析法和可靠性框图法在系统可靠性研究中的关系，首次得出两者分析结果满足互补关系。更多还原

【Abstract】 Nowadays, Fault Tree Analysis (FTA) has been widely used in the assessing of reliability and safety of systems. An active FTA constructing method, qualitative and quantitative as well as module analysis of FTA based on Binary Decision Diagram (BDD) was researched in this thesis. Including the following areas of contents:First, based on Windows interface, a design and implementation method of computer aided active FTA constructing method was presented. According to this method, the visualized active fault tree construction software was developed. And the worse versatility and huge working load problems of FTA construction were solved.Then, the optimal ordering permutation for the basic events of fault tree was produced by structural importance and neural network methods respectively, and the resulting size problem of BDD affected by the basic events’ order was solved. According to the relationship of Shannon’s formula of Boolean functions and BDD, the fault tree structure to BDD conversion was accomplished by recursive method.After then, a new method of solving the minimal cuts of s-coherent tree based on BDD and prime number was given in the qualitative analysis of FTA based on BDD, the prime implicant sets of non s-coherent tree was calculated by an iterative method. The probability and unconditional failure intensity of top event was computed in the quantitative analysis of FTA based on BDD. A Fault Tree Module Analysis (FTMA) based on. depth-first left-most traversals and BDD was presented to solve large complicated FTA problems. And the automatic computer analysis was implemented. The long exist NP (Non-deterministic Polynomial) problems of FTA based on Boolean algebra was solved by these methods.Finally, the relationship of FTA and Reliability Block Diagram Analysis (RBDA) was studied, and the complementation relation of their results was first verified.更多还原