Fault Tree Analysis: Identifying Maximum Probability Minimal Cut Sets with MaxSAT
Artificial Intelligence
2020-05-08 v1 Cryptography and Security
Discrete Mathematics
Logic in Computer Science
Networking and Internet Architecture
Systems and Control
Systems and Control
Abstract
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.
Keywords
Cite
@article{arxiv.2005.03003,
title = {Fault Tree Analysis: Identifying Maximum Probability Minimal Cut Sets with MaxSAT},
author = {Martín Barrère and Chris Hankin},
journal= {arXiv preprint arXiv:2005.03003},
year = {2020}
}
Comments
Accepted for publication at the 50th IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2020), Fast Abstracts Track, 2020