All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Scalable Analysis of Fault Trees with Dynamic Features

The result's identifiers

  • Result code in 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>

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Scalable Analysis of Fault Trees with Dynamic Features

  • Original language description

    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

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>

  • Continuities

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

Others

  • Publication year

    2015

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    DSN 2015

  • ISBN

    9781479986293

  • ISSN

  • e-ISSN

  • Number of pages

    12

  • Pages from-to

    89-100

  • Publisher name

    IEEE

  • Place of publication

    Rio de Janeiro, Brazil

  • Event location

    Rio de Janeiro, Brazil

  • Event date

    Jan 1, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article