Newly enhanced computing algorithm to quantify unavailability of maintained multi-component systems

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F18%3A10241519" target="_blank" >RIV/61989100:27240/18:10241519 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.taylorfrancis.com/books/e/9781351174657" target="_blank" >https://www.taylorfrancis.com/books/e/9781351174657</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Newly enhanced computing algorithm to quantify unavailability of maintained multi-component systems

Popis výsledku v původním jazyce

In our previous work we developed an analytical algorithm which is able to carry out exact reliability quantification of highly reliable systems with maintenance (both preventive and correc-tive). A directed Acyclic Graph (AG) was used as a system representation. The unavailability of a node of an AG is in fact given by going over all possible combinations of probabilities of the input edges (such combinations that cause failure of the node). New improvement of the computing methodology will be presented in this paper, which efficiently reduces computing time and complexity. The improvement is based on applicable properties of internal non-terminal nodes. If an internal node has multiple-dimensionality, i.e. a lot of input edges, resulting in an excessive summarizing combinations, the number of combinations can be significantly reduced by multiple application of the pivotal decomposition. The effectiveness of the process will be demonstrated on selective systems. (C) 2018 Taylor &amp; Francis Group, London.

Název v anglickém jazyce

Newly enhanced computing algorithm to quantify unavailability of maintained multi-component systems

Popis výsledku anglicky

In our previous work we developed an analytical algorithm which is able to carry out exact reliability quantification of highly reliable systems with maintenance (both preventive and correc-tive). A directed Acyclic Graph (AG) was used as a system representation. The unavailability of a node of an AG is in fact given by going over all possible combinations of probabilities of the input edges (such combinations that cause failure of the node). New improvement of the computing methodology will be presented in this paper, which efficiently reduces computing time and complexity. The improvement is based on applicable properties of internal non-terminal nodes. If an internal node has multiple-dimensionality, i.e. a lot of input edges, resulting in an excessive summarizing combinations, the number of combinations can be significantly reduced by multiple application of the pivotal decomposition. The effectiveness of the process will be demonstrated on selective systems. (C) 2018 Taylor &amp; Francis Group, London.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10103 - Statistics and probability

Projekt

<a href="/cs/project/EF16_019%2F0000867" target="_blank" >EF16_019/0000867: Centrum výzkumu pokročilých mechatronických systémů</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2018

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Safety and Reliability - Safe Societies in a Changing World - Proceedings of the 28th International European Safety and Reliability Conference, ESREL 2018

ISBN

978-0-8153-8682-7

ISSN

—

e-ISSN

neuvedeno

Počet stran výsledku

6

Strana od-do

931-936

Název nakladatele

CRC Press

Místo vydání

Leiden

Místo konání akce

Trondheim

Datum konání akce

17. 6. 2018

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—