一种故障树预处理和最小割集的嵌套求解方法  

A Method for Fault Tree Preprocessing and Minimum Cut-Set

作　　者：李旭 张仁斌[1] 樊玉琦[1] Li Xu;Zhang Renbin;FanYuqi(School of Computer and Information,Hefei University of Technology,Hefei 230601,China)

机构地区：[1]合肥工业大学计算机与信息学院,合肥230601

出　　处：《核安全》2024年第5期48-56,共9页Nuclear Safety

摘　　要：故障树分析(Fault Tree Analyze,FTA)是一种系统安全性分析方法。求解故障树最小割集(Minimum Cut Set,MCS)是FTA的重要环节,其方法主要包括基于布尔代数的算法和基于二元决策图(Binary Decision Diagram,BDD)的算法,在使用普通计算机分析大规模故障树时,现有方法存在工作内存不足和计算时间过久的问题。为了解决上述问题,针对国内某百万千瓦级大型压水堆风险模型,提出了一种基于布尔代数的故障树预处理和最小割集嵌套求解算法(Pretreat and Nested Minimum Cut-Set Algorithm,PNMCS)。该算法由三个模块组成:故障树化简、故障树剪枝、最小割集嵌套计算。在国内某大型压水堆风险模型和几种实际应用风险模型上的应用表明,本算法在求得正确结果的同时,有效解决了工作内存不足和计算时间过久的问题。Fault Tree Analyze(FTA)is a system security analysis method,and solving the Minimum Cut Set(MCS)of the fault tree is an important part of FTA.The method mainly includes the algorithm based on Boolean algebra and the algorithm based on Binary Decision Diagram(BDD).When using ordinary computer to analyze large-scale fault trees,the existing method has the problems of insufficient working memory and too long calculation time.In order to solve the above problems,a Boolean algebraic fault tree Pretreat and Nested Minimum Cut-Set Algorithm(PNMCS)is proposed for a domestic large pressurized water reactor risk model.The algorithm consists of three modules:fault tree simplification,fault tree pruning and minimum cut set nesting.The application of this algorithm to the risk model of a large pressurized water reactor in China and several practical application risk models shows that the algorithm can solve the problems of insufficient working memory and too long calculation time while obtaining correct results.

关 键 词：故障树分析 割集法 组合爆炸 布尔代数 二元决策图 

分 类 号：TP311.5[自动化与计算机技术—计算机软件与理论]