论文标题
故障树分析：用MaxSat确定最大概率最小切割集
Fault Tree Analysis: Identifying Maximum Probability Minimal Cut Sets with MaxSAT
论文作者
论文摘要
在本文中，我们提出了一种基于最大的新技术，以计算故障树中最大概率最小切割集（MPMCS）。我们将MPMC问题建模为加权部分MaxSat问题，并使用并行的SAT溶解结构来解决它。使用我们的开源工具获得的结果表明该方法是有效而有效的。
In this paper, we present a novel MaxSAT-based technique to compute Maximum Probability Minimal Cut Sets (MPMCSs) in fault trees. We model the MPMCS problem as a Weighted Partial MaxSAT problem and solve it using a parallel SAT-solving architecture. The results obtained with our open source tool indicate that the approach is effective and efficient.
