Surrey researchers Sign in
Back
Fault Tree Analysis: Identifying Maximum Probability Minimal Cut Sets with MaxSAT
Conference proceeding

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

Martin Barrere and Chris Hankin
2020 50th Annual IEEE-IFIP International Conference on Dependable Systems and Networks-Supplemental Volume (DSN-S), pp.53-54
International Conference on Dependable Systems and Networks
2020 50th Annual IEEE-IFIP International Conference on Dependable Systems and Networks-Supplemental Volume (DSN-S) (Valencia, Spain, 29/06/2020 - 02/07/2020)
05/08/2020
DOI: https://doi.org/10.1109/DSN-S50200.2020.00029

Abstract

Computer Science, Hardware & Architecture Computer Science, Information Systems Science & Technology Computer Science Technology
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.

Metrics

28 Record Views
2 Times Cited - Web of Science

Details

Usage Policy

Usage details for all content viewed and downloaded in this site are shared with IRUS-UK (Institutional Repository Usage Statistics UK). Cookies are used to remember your decision. Click Accept to accept usage details sharing and the cookies.

Learn more