Satisfiability techniques for computing minimal tie sets in reliability assessment

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

Hasse diagram reliability tie set cut set satisfiability

Domains

Computer Science [cs] Performance [cs.PF]

Fichier principal

Techreport - Satisfiability techniques for computing minimal tie sets in reliability assessment.pdf (299.51 Ko)

Origin : Files produced by the author(s)

Margaux Duroeulx : Connect in order to contact the contributor

https://hal.inria.fr/hal-01518920

Submitted on : Friday, May 5, 2017-3:38:17 PM

Last modification on : Saturday, June 25, 2022-7:45:34 PM

Long-term archiving on: Sunday, August 6, 2017-3:43:44 PM

Dates and versions

hal-01518920 , version 1 (05-05-2017)

Identifiers

HAL Id : hal-01518920 , version 1

Cite

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

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

CNRS INRIA CRAN UNIV-LORRAINE INRIA2 LORIA LORIA-FM

312 View

249 Download