Imperial College London
Alternate

Professor Christopher Hankin

Faculty of Engineering, Department of Computing

Professor of Computing
 
 
 
//

Contact

 

c.hankin Website

 
 
//

Location

 

Sherfield BuildingSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@inproceedings{Barrere:2020,
author = {Barrere, Cambrun M and Hankin, C},
publisher = {University of Helsinki, Department of Computer Science},
title = {MaxSAT Evaluation 2020 - Benchmark: Identifying maximum probability minimal cut sets in fault trees},
url = {https://www.imperial.ac.uk/people/m.barrere},
year = {2020}
}
Download

RIS format (EndNote, RefMan)

TY  - CPAPER
AB  - 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.
AU  - Barrere,Cambrun M
AU  - Hankin,C
PB  - University of Helsinki, Department of Computer Science
PY  - 2020///
TI  - MaxSAT Evaluation 2020 - Benchmark: Identifying maximum probability minimal cut sets in fault trees
UR  - https://www.imperial.ac.uk/people/m.barrere
UR  - https://helda.helsinki.fi/handle/10138/318451
UR  - http://hdl.handle.net/10044/1/81316
ER  -
Download