关键词: 故障树分析, 安全性分析, 最小割集, 可满足性问题

Abstract:

Fault tree analysis is widely used in the safety analysis of safety crisis areas such as nuclear industry, aerospace engineering, traffic control, etc. It is the key step to solve the minimal cut sets of fault tree in fault tree analysis. The conventional algorithms solving the minimal cut sets of large-scale fault tree are mainly based on the binary decision diagram. Their main drawback is that the time and space consumption of the algorithm relies heavily on a good order of variables. In order to reduce the storage resources and speed up the process, we propose a new algorithm based on Boolean satisfiability problem to solve the minimal cut sets in fault tree analysis. Firstly, we convert this problem into a Boolean satisfiability problem. Secondly, the SAT solver is used to solve the minimal satisfiability of the Boolean formula, namely the minimal cut sets of the fault tree, through the iteration of above processes. Experimental results show that compared with conventional algorithms, this new algorithm is not only more accurate but also more efficient for solving the minimal cut sets in fault tree analysis.

Key words: fault tree analysis, safety analysis, minimal cut set, Boolean satisfiability problem