求取故障树最小割集的新算法

A New Algorithm for Minimizing Cut Sets of Fault Trees

本文提出一种采用微机直接求取故障树最小割集的新算法。该法程序实现简洁,与常用的Fussell 算法比较,可成倍地提高计算速度,节省内存。

This paper presents a new algorithm for minimizing cut sets offault trees by microcomputer directly.Program is made succinct in this meth-od.Comparing with russell algorithm,it raises the speed of calcultion dou-bly and saves the space of internal storage.