.png){kind=icon}
返回
An Efficient Algorithm for Finding Modules in Fault Trees
.png){kind=icon}
PRE
AI
DOI：10.1109/TR.2019.2940651.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Fault trees
Logic gates
Software algorithms
Parallel algorithms
Indexes
Terminology
Reliability
Coherent fault trees
linear-time algorithm
lowest common ancestor
modules
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.7
论文数:
2.8K
被引数:
8.5K
机构
引用论文
Compact Power Splitters with Mosaic-based Structure Designed by Bayesian Direct-binary-search Method
PREAI
分享收藏Development of Isolation-Induced Vocal Behavior in Normal-Hearing and Deafened Guinea Pig Infants
PREAI
分享收藏Optimised Anaesthesia to Reduce Post Operative Cognitive Decline (POCD) in Older Patients Undergoing Elective Surgery, a Randomised Controlled Trial.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏
查看更多内容