摘要
针对割序集模型较高的复杂度,提出静态子树模块化和动态子树模块化2种简化方法。利用模块化方法将动态故障树划分为多个静态子树和动态子树。对完全由静态门构成的静态子树采用二叉决策图计算其发生概率;对动态子树采用割序集模型进行分析,将其中包含的静态子树作为一个整体进行处理。通过实例阐述模块化方法的应用过程,算例分析结果表明,该方法能有效降低割序集模型的复杂度。
Since the known Cut Sequence Set（CSS） model has to face large complexity,the paper provides two modularization methods,namely the modularization of static sub-trees and dynamic sub-trees.Dynamic Fault Tree（DFT） can be partitioned into several static sub-trees and dynamic sub-trees.For a static sub-tree,Binary Decision Diagram（BDD） is used to compute its probability.For a dynamic sub-tree,CSS model is used to analyze it.If a static sub-tree exists in a dynamic sub-tree,it is treated as a whole.An example is used to illustrate the applications of the simplification methods.The analysis results show that the provided methods can decrease the computational complexity of CSS model.
出处
《计算机工程》
CAS
CSCD
北大核心
2011年第7期10-11,20,共3页
Computer Engineering
基金
国家自然科学基金资助项目(60904082)
关键词
割序集
动态故障树
模块化
Cut Sequence Set（CSS）
Dynamic Fault Tree（DFT）
modularization
