摘要
本文引入了事故树关联矩阵的概念,介绍了利用关联矩阵便于计算机处理的化简事故树的算法和事故最小割集和最小径集的求法,并从理论上验证了算法原理。
The concept of incidence matrix of fault trees is introduced in this paper. Also introduced are an algorithm for reducing the order of Fault Trees to the minimum by using the incidence matrix, and a method of finding the minimal cut set and the minimal path set, which can be easily implemented by computer programs.The prenciple of the algorithm is verified theoretically.
出处
《系统工程学报》
CSCD
1991年第2期20-25,共6页
Journal of Systems Engineering
基金
国家自然科学基金
