Fault Tree Analysis: Identifying Maximum Probability Minimal Cut Sets with MaxSAT
| Autor: | Barrère, Martín, Hankin, Chris |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Computer Science - Artificial Intelligence
Computer Science - Cryptography and Security Computer Science - Discrete Mathematics Computer Science - Logic in Computer Science Computer Science - Networking and Internet Architecture Electrical Engineering and Systems Science - Systems and Control 68M15 05C05 94C15 68R10 90B25 93B20 90C27 90C35 68U07 03B05 B.8 C.4 G.2.2 F.4.1 J.6 J.7 B.6.3 D.4.5 D.4.6 J.2 |
| Druh dokumentu: | Working Paper |
| Popis: | 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. Comment: Accepted for publication at the 50th IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2020), Fast Abstracts Track, 2020 |
| Databáze: | arXiv |
| Externí odkaz: |
|