一种动态故障树顶事件发生概率的近似算法

An Approximate Algorithm for Top-Event Occurrence Rate of Dynamic Fault Trees

本文提出了一种动态故障树顶事件发生概率的近似算法,该算法不需要把动态故障树转化为马尔可夫链,而是直接分析故障树模块,并用梯形公式得到近似数值解。最后通过一个实例说明了该方法的有效性。

This paper introduces an approximate algorithm for top-event occurrence rate of dynamic fault trees. The method need not convert dynamic fault trees to Markov chains, but analyzes dynamic modules directly, and obtain approximate numerical solution using trapezoid formula. The validity of the method is proved by an example.