arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.03003cs.AIcs.CRcs.DMcs.LOcs.NIcs.SYeess.SY
收藏

Fault Tree Analysis: Identifying Maximum Probability Minimal Cut Sets with MaxSAT

Institute for Security Science and Technology, Imperial College London(伦敦帝国理工学院安全科学与技术研究所)

Martín Barrère, Chris Hankin

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑