Modularization Method for Cut Sequence Set Analysis of Dynamic Fault Tree
Wang Zhi-ana · Jisuanji gongcheng · 2011
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.