论文标题
MAXSAT评估2020-基准：确定最大概率最小剪切设置在故障树中
MaxSAT Evaluation 2020 -- Benchmark: Identifying Maximum Probability Minimal Cut Sets in Fault Trees
论文作者
论文摘要
本文介绍了一个主要鉴定故障树中最大概率最小切割集（MPMCS）的MaxSAT基准测试。我们通过将输入故障树转换为加权逻辑公式来解决MPMCS问题，然后将其用于构建和解决加权的部分MaxSat问题。基准包括80个具有不同大小和组成的故障树，以及每种情况的最佳成本和解决方案。
This paper presents a MaxSAT benchmark focused on the identification of Maximum Probability Minimal Cut Sets (MPMCSs) in fault trees. We address the MPMCS problem by transforming the input fault tree into a weighted logical formula that is then used to build and solve a Weighted Partial MaxSAT problem. The benchmark includes 80 cases with fault trees of different size and composition as well as the optimal cost and solution for each case.
