论文部分内容阅读
本文提出的顶事件发生概率的算法不借助割集，直接采用自顶向下的技术对故障树进行分割求解。该算法的时间和内存耗用与故障树的节点数目没有必然联系，而仅仅取决于故障树中不同的重复事件的个数。
In this paper, the algorithm of probability of occurrence of top event is used to segment the fault tree using the top-down technique without cutting set. The time and memory consumption of the algorithm is not necessarily related to the number of nodes in the fault tree, but only depends on the number of different repetitive events in the fault tree.