An Efficient Algorithm for Finding Modules in Fault Trees
An Efficient Algorithm for Finding Modules in Fault Trees
复制标题
一种在故障树中查找模块的高效算法
DOI：
10.1109/tr.2019.2940651
复制
发表时间：
2021-09
影响因子：
5.9
通讯作者：
Yi Ding
中科院分区：
文献类型：
--
作者：
Mei Chen;Ning-Cong Xiao;Ming J. Zuo;Yi Ding
故障树的一个模块是一个独立的子树，它没有来自树的其余部分的输入，也没有到其余部分的输出，除了顶部事件。模块化是减少大型复杂故障树分析计算量的重要技术。本文提出了一种新的线性时间算法，该算法更有效，更容易编码，用于查找故障树中存在的模块。该算法包括两个主要阶段：分支和变换。为了证明所提出的算法的效率和适用性，所提出的算法和其他线性时间算法之间的比较进行查找故障树中的模块。实验结果表明了该算法的优越性和有效性。
A module of a fault tree is an independent subtree that has no input from the rest of the tree and no output to the rest, except the top events. Modularization is an important technique to reduce the computation cost for large, complex fault tree analysis. This article presents a new linear-time algorithm that is more efficient and easier to code for finding modules existing in fault trees. Two main stages are included in the proposed algorithm: branching and transforming. To demonstrate the efficiency and applicability of the proposed algorithm, comparisons are performed between the proposed algorithm and other linear-time algorithms for finding modules in fault trees. Results have shown the superiority and effectiveness of the proposed algorithm.