Skip to Main content Skip to Navigation
Conference papers

Satisfiability techniques for computing minimal tie sets in reliability assessment

Margaux Duroeulx 1, 2, 3 Nicolae Brinzei 1 Marie Duflot 2, 3 Stephan Merz 2, 3
2 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
LORIA - FM - Department of Formal Methods , Inria Nancy - Grand Est, MPII - Max-Planck-Institut für Informatik
3 MOSEL - Proof-oriented development of computer-based systems
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.
Complete list of metadatas

Cited literature [7 references]  Display  Hide  Download
Contributor : Stephan Merz <>
Submitted on : Wednesday, November 8, 2017 - 11:46:24 AM
Last modification on : Friday, December 11, 2020 - 6:31:06 PM
Long-term archiving on: : Friday, February 9, 2018 - 12:22:33 PM


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


  • HAL Id : hal-01630851, version 1



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⟩



Record views


Files downloads