Satisfiability techniques for computing minimal tie sets in reliability assessment

Margaux Duroeulx 1, 2 Nicolae Brinzei 1 Marie Duflot 2 Stephan Merz 2
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.
Document type :
Preprints, Working Papers, ...
Liste complète des métadonnées

Cited literature [6 references]  Display  Hide  Download

https://hal.inria.fr/hal-01518920
Contributor : Margaux Duroeulx <>
Submitted on : Friday, May 5, 2017 - 3:38:17 PM
Last modification on : Tuesday, February 19, 2019 - 3:40:04 PM
Document(s) archivé(s) le : Sunday, August 6, 2017 - 3:43:44 PM

File

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

Identifiers

  • HAL Id : hal-01518920, version 1

Citation

Margaux Duroeulx, Nicolae Brinzei, Marie Duflot, Stephan Merz. Satisfiability techniques for computing minimal tie sets in reliability assessment. 2017. ⟨hal-01518920⟩

Share

Metrics

Record views

379

Files downloads

146