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

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

This paper presents a MaxSAT benchmark focused on the identification of Maximum Probability Minimal Cut Sets (MPMCSs) in fault trees. We address the MPMCS problem by transforming the input fault tree into a weighted logical formula that is then used to build and solve a Weighted Partial MaxSAT problem. The benchmark includes 80 cases with fault trees of different size and composition as well as the optimal cost and solution for each case.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/05/2020

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

In this paper, we present a novel MaxSAT-based technique to compute Maxi...
research
11/01/2019

MaxSAT Evaluation 2019 – Benchmark: Identifying Security-Critical Cyber-Physical Components in Weighted AND/OR Graphs

This paper presents a MaxSAT benchmark focused on identifying critical n...
research
04/28/2020

Various Ways to Quantify BDMPs

A Boolean logic driven Markov process (BDMP) is a dependability analysis...
research
03/14/2018

One Net Fits All: A unifying semantics of Dynamic Fault Trees using GSPNs

Dynamic Fault Trees (DFTs) are a prominent model in reliability engineer...
research
02/12/2019

Parametric analyses of attack-fault trees

Risk assessment of cyber-physical systems, such as power plants, connect...
research
04/30/2018

A Formal Transformation Method for Automated Fault Tree Generation from a UML Activity Model

Fault analysis and resolution of faults should be part of any end-to-end...
research
08/05/2020

An Evolver program for weighted Steiner trees

We present an algorithm to find near-optimal weighted Steiner minimal tr...

Please sign up or login with your details

Forgot password? Click here to reset