基于阶跃函数的故障树最小割集算法

Minimum Cut of Fault Tree Based on Step Function Algorithm

运用阶跃函数表达故障树,提出了一种计算故障树最小割集的方法。通过对故障树中逻辑"与"门和"或"门的特点进行分析,推导出故障树逻辑关系与阶跃函数之间的转换规则,利用该规则可将故障树转化为便于编程求解的函数表达式。并对算法进行改进,从而大大降低了计算量。通过实例验证了该方法能快速准确地获得故障树的最小割集。

An algorithm for minimum cut of a fault tree based on step function is provided. According to analyzing the characteristic of the logic of ＂and＂ and ＂or＂ gates, a conversion rule between the logic of fault tree and the step function is derived. Using this conversion, fault tree to step function con be converced which is easy to calculate by programming in the computer. The amelioration of the algorithm can cut down calculated amount dramatically. The results of exemplified calculation demonstrate that minimum cuts of fault tree can be accurately and quickly obtained.