摘要
本文利用事故树最简关联矩阵的概念,介绍了利用最简关联矩阵求事故树最小径集的方法,给出了便于计算机处理的算法,并从理论上验证了算法原理。
The concept of the incidence matrix of fault trees is used in this paper, also introduced are a method for finding the minimal path-sets of fault tree, and an algorithm which can be easily implemented by computer programs. The principle of the algorithm is verified theoretically.
出处
《系统工程理论方法应用》
1993年第3期20-24,共5页
Systems Engineering Theory·Methodology·Applications
关键词
最小径集
关联矩阵
事故树
Minimal cut-sets. Minimal path-sets, Incidence matrix, Fault trees with time delay
