<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet href="client.xsl" type="text/xsl"?>
<article article-type="other">
<front>
<journal-meta>
<journal-id/>
<issn/>
<banner>
<href>banner.jpg</href>
<size width="100%"/>
</banner>
</journal-meta>
<doi>0293-cd</doi>
<article-meta>
<title-group>
<article-title>Integrating Satisfiability Solving in the Assessment of System Reliability Modeled by Dynamic Fault Trees</article-title>
</title-group>

<author>Margaux Duroeulx<sup>1,2,a</sup>, Nicolae Br&#238;nzei<sup>1</sup>, Marie Duflot<sup>2</sup> and Stephan Merz<sup>2</sup></author>

<aff><sup>1</sup>University of Lorraine, CNRS, CRAN, F-54000 Nancy, France</aff>

<aff><sup>2</sup>University of Lorraine, CNRS, Inria, LORIA, F-54000 Nancy, France</aff>
<email><a href="mailto:margaux.duroeulx@loria.fr"><sup>a</sup>margaux.duroeulx@loria.fr</a></email>


</article-meta></front>
<body>
<abstract>
<title>ABSTRACT</title>
<p>Fault trees (FTs) and their extensions are diagrammatic formalisms that are commonly used for reliability assessment and that represent the structure function of systems. The structure function determines tie sets and cut sets, and minimal tie sets are instrumental for assessing systems reliability. In a previous paper, we used satisfiability (SAT) techniques to compute tie sets from the structure function. In this paper we define minimal tie sets with sequences (MTSSs) as an extension of minimal tie sets for analyzing dynamic fault trees (DFTs), and we extend our previous techniques for computing MTSSs. We illustrate our approach using a standard case study and assess its performance over several industrial-size benchmarks</p>
<p><italic>Keywords: </italic>Reliability, Satisfiability, Structure function, Dynamic fault trees, Tie sets, Tie sets with sequences.</p>
</abstract>
<fpdf>
<href>pdflogo.jpg</href>
<hpdf>0293</hpdf>
</fpdf>
</body>
</article>