一种基于结构重要度的故障树底事件排序算法

A structure-based algorithm of basic event ordering for fault tree

故障树是分析航天系统安全性的一种常用方法,故障树分析包括定性分析与定量分析两个部分,定性分析即最小割集计算,是故障树研究的难点。当前,采用ZBDD(零压缩二元决策图,Zero-suppressed Binary Decision Diagram)对故障树进行计算是当前故障树研究的热点,本文对将故障树转化为ZBDD的关键问题--故障树底事件排序进行了研究,提出了一种基于结构重要度的故障树底事件排序算法。实验表明本文算法可以减少ZBDD的存储空间,从而降低算法时间复杂度。

Fault tree analysis is widely used for safety analysis of aerospace system.Fault tree analysis includes quantitative analysis and qualitative analysis called minimum cut set computing,which is most difficult problem of fault tree analysis.This paper studies basic event ordering of fault tree,which is the key issue of ZBDD（Zero-suppressed Binary Decision Diagram） based minimum cut set calculation,and then proposes a new ordering algorithm based on structure of fault tree.Experiments show that the algorithm can reduce the storage space of ZBDD,thus reducing the time complexity.