由不交化矩阵求最小割集的改进算法

Improved algorithm to MCS by non-intersect matrix

利用早期不交化法求解最小割集是目前进行故障树定性分析的一种有效方法。但不交化最小割集矩阵行数随着故障树规模的大小呈指数增长,对于数万乃至数百万行的不交化矩阵求解最小割集的过程就会慢得让人无法接受。通过对原算法的分析和改进,采用静态指针法建立动态数组,避免了原算法最耗时间的对不交化矩阵的排序运算。通过与原算法的对比分析,结果验证了本算法的有效性。

It is efficient method to get mininal cut sets for fault tree analysis by former non-intersect currently. But the rows of nonintersect mininal cut sets matrix increase exponentially along with the scale of fault tree. The tardy process will be tolerated while the minimal cut sets are being gained by the matrix often thousand to million rows. Through analysing and improving the original algorithm, the improved approach makes its running velocity faster according to avoiding sorting by static point and dynamic array. The practice confirms that the new algorithm is more effective than the old in running velocity.