<?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>0516-cd</doi>
<article-meta>
<title-group>
<article-title>A Decomposition approach for Computation of Survival Signatures of Heterogeneous Systems with Subsystems with Shared Components</article-title>
</title-group>

<author>Daniel Krpel&#237;k<sup>1,2,a</sup>, Frank P.A. Coolen<sup>1</sup> and Louis J.M. Aslett<sup>1</sup></author>

<aff><sup>1</sup>Department of Mathematical Sciences, Durham University, UK</aff>

<aff><sup>2</sup>Department of Applied Mathematics, V&#352;B-Technical University of Ostrava, CZ</aff>

<email><a href="mailto:daniel.krpelik@durham.ac.uk"><sup>a</sup>daniel.krpelik@durham.ac.uk</a></email>

</article-meta></front>
<body>
<abstract>
<title>ABSTRACT</title>
<p>We introduce a formula for computing system survival signatures by the means of merging survival signatures of multiple subsystems. The algorithm extends previous results for survival signatures on merging systems with no common components to systems with common components. It also extends existing results on merging dependent systems for calculating Samaniego&#39;s system signatures to survival signatures. Apart from these trivial extensions, we also introduce a novel decomposition method which allows us to decouple the dependencies among subsystems according to a wider class of events which may lead to savings of computational resources.<br/>
The survival signatures can be equivalently represented by the counting signatures. We present our results for computing them. The survival signatures can then be obtained by simple point-wise division.</p>
<p><italic>Keywords: </italic>System Reliability, Survival Signature, Fault Tree Analysis, System Decomposition.</p>
</abstract>
<fpdf>
<href>pdflogo.jpg</href>
<hpdf>0516</hpdf>
</fpdf>
</body>
</article>