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

05/05/2020
by   Martín Barrère, et al.
0

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.

READ FULL TEXT

page 1

page 2

research
07/16/2020

MaxSAT Evaluation 2020 – Benchmark: Identifying Maximum Probability Minimal Cut Sets in Fault Trees

This paper presents a MaxSAT benchmark focused on the identification of ...
research
04/20/2023

Bounds on Maximum Weight Directed Cut

We obtain lower and upper bounds for the maximum weight of a directed cu...
research
08/09/2019

Parameterized Algorithms for Maximum Cut with Connectivity Constraints

We study two variants of Maximum Cut, which we call Connected Maximum Cu...
research
11/05/2021

Directed flow-augmentation

We show a flow-augmentation algorithm in directed graphs: There exists a...
research
04/28/2020

Various Ways to Quantify BDMPs

A Boolean logic driven Markov process (BDMP) is a dependability analysis...
research
09/17/2022

Adaptive importance sampling based on fault tree analysis for piecewise deterministic Markov process

Piecewise deterministic Markov processes (PDMPs) can be used to model co...
research
05/13/2021

Merit and Blame Assignment with Kind 2

We introduce two new major features of the open-source model checker Kin...

Please sign up or login with your details

Forgot password? Click here to reset