Satisfiability techniques for computing minimal tie sets in reliability assessment

Margaux Duroeulx 1, 2 Nicolae Brinzei 1 Marie Duflot 2 Stephan Merz 2
1 CRAN - Centre de Recherche en Automatique de Nancy
2 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
MPII - Max-Planck-Institut für Informatik, Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : Estimates of system reliability crucially rely on qualitative techniques for determining the impact of component failures. Formally, the structure function of a system determines minimal tie or cut sets that are instrumental for quantitative techniques of reliability assessment. This paper describes three techniques, based on Boolean satisfiability solving, for computing minimal tie sets.
Keywords : cut set Hasse diagram satisfiability reliability tie set
Document type :
Conference papers
Complete list of metadatas

Cited literature [7 references]  Display  Hide  Download
https://hal.inria.fr/hal-01630851
Contributor : Stephan Merz <>
Submitted on : Wednesday, November 8, 2017 - 11:46:24 AM
Last modification on : Tuesday, February 19, 2019 - 3:40:04 PM
Long-term archiving on: Friday, February 9, 2018 - 12:22:33 PM

File

resubmission-Satisfiability te...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01630851, version 1

Collections

CNRS | CRAN | INRIA | LORIA | LORIA-FM | UNIV-LORRAINE | TDS-MACS

Citation

Margaux Duroeulx, Nicolae Brinzei, Marie Duflot, Stephan Merz. Satisfiability techniques for computing minimal tie sets in reliability assessment. 10th International Conference on Mathematical Methods in Reliability, MMR 2017, Jul 2017, Grenoble, France. pp.1-8. ⟨hal-01630851⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

269

Files downloads

85

 

 

Contact

archive-ouverte@inria.fr