Scalable Analysis of Fault Trees with Dynamic Features

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F15%3A00081287" target="_blank" >RIV/00216224:14330/15:00081287 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1109/DSN.2015.29" target="_blank" >http://dx.doi.org/10.1109/DSN.2015.29</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/DSN.2015.29" target="_blank" >10.1109/DSN.2015.29</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Scalable Analysis of Fault Trees with Dynamic Features

Popis výsledku v původním jazyce

Fault trees constitute one of the essential formalisms for static safety analysis of large industrial systems such as nuclear power plants. Dynamic fault trees (DFT) enrich the formalism by time-dependent behaviour, e.g., repairs or functional dependencies. Analysis of DFT is however so far limited to substantially smaller models than those required by safety regulators for nuclear power plants. We propose a fault tree formalism that combines both static and dynamic features, called SD fault trees. It gives the user the freedom to express each equipment failure either statically, without modelling temporal information, or dynamically, allowing repairs and other timed interdependencies. We introduce a general analysis algorithm for SD fault trees. The algorithm (1) scales similarly to static algorithms when considering an important subclass of this formalism and (2) allows for a more realistic analysis compared to static algorithms as it takes into account the temporal interdependencies

Název v anglickém jazyce

Scalable Analysis of Fault Trees with Dynamic Features

Popis výsledku anglicky

Fault trees constitute one of the essential formalisms for static safety analysis of large industrial systems such as nuclear power plants. Dynamic fault trees (DFT) enrich the formalism by time-dependent behaviour, e.g., repairs or functional dependencies. Analysis of DFT is however so far limited to substantially smaller models than those required by safety regulators for nuclear power plants. We propose a fault tree formalism that combines both static and dynamic features, called SD fault trees. It gives the user the freedom to express each equipment failure either statically, without modelling temporal information, or dynamically, allowing repairs and other timed interdependencies. We introduce a general analysis algorithm for SD fault trees. The algorithm (1) scales similarly to static algorithms when considering an important subclass of this formalism and (2) allows for a more realistic analysis compared to static algorithms as it takes into account the temporal interdependencies

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Centrum excelence - Institut teoretické informatiky (CE-ITI)</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2015

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

DSN 2015

ISBN

9781479986293

ISSN

—

e-ISSN

—

Počet stran výsledku

12

Strana od-do

89-100

Název nakladatele

IEEE

Místo vydání

Rio de Janeiro, Brazil

Místo konání akce

Rio de Janeiro, Brazil

Datum konání akce

1. 1. 2015

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

WRD - Celosvětová akce

Kód UT WoS článku

—