Effective static and dynamic fault tree analysis.

D 2016

Effective static and dynamic fault tree analysis.

BÄCKSTRÖM, Ola, Yuliya BUTKOVA, Holger HERMANNS, Jan KRČÁL, Pavel KRČÁL et. al.

Basic information

Original name

Effective static and dynamic fault tree analysis.

Authors

BÄCKSTRÖM, Ola (752 Sweden), Yuliya BUTKOVA (860 Uzbekistan), Holger HERMANNS (276 Germany), Jan KRČÁL (203 Czech Republic, guarantor, belonging to the institution) and Pavel KRČÁL (203 Czech Republic)

Edition

Berlin, In International Conference on Computer Safety, Reliability, and Security, p. 266-280, 15 pp. 2016

Publisher

Springer

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Germany

Confidentiality degree

není předmětem státního či obchodního tajemství

Publication form

printed version "print"

Impact factor

Impact factor: 0.402 in 2005

RIV identification code

RIV/00216224:14330/16:00088815

Organization unit

Faculty of Informatics

ISBN

978-3-319-45476-4

ISSN

DOI

http://dx.doi.org/10.1007/978-3-319-45477-1_21

Keywords in English

static and dynamic fault trees; PSA; nuclear safety; interactive Markov chains; open IMC

Abstract

V originále

Fault trees constitute one of the essential formalisms for static safety analysis of various industrial systems. Dynamic fault trees (DFT) enrich the formalism by support for time-dependent behaviour, e.g., repairs or dynamic dependencies. This enables more realistic and more precise modelling, and can thereby avoid overly pessimistic analysis results. But analysis of DFT is so far limited to substantially smaller models than those required for instance in the domain of nuclear power safety. This paper considers so called SD fault trees, where the user is free to express each equipment failure either statically, without modelling temporal information, or dynamically, allowing repairs and other timed interdependencies. We introduce an analysis algorithm for an important subclass of SD fault trees. The algorithm employs automatic abstraction techniques effectively, and thereby scales similarly to static analysis algorithms, albeit allowing for a more realistic modelling and analysis. We demonstrate the applicability of the method by an experimental evaluation on fault trees of nuclear power plants.

Links

GBP202/12/G061, research and development project

Name: Centrum excelence - Institut teoretické informatiky (CE-ITI) (Acronym: CE-ITI)

Investor: Czech Science Foundation

Citovat

BÄCKSTRÖM, Ola, Yuliya BUTKOVA, Holger HERMANNS, Jan KRČÁL and Pavel KRČÁL. Effective static and dynamic fault tree analysis. In In International Conference on Computer Safety, Reliability, and Security. Berlin: Springer, 2016, p. 266-280. ISBN 978-3-319-45476-4. Available from: https://dx.doi.org/10.1007/978-3-319-45477-1_21.

@inproceedings{1377788,
   author = {Bäckström, Ola and Butkova, Yuliya and Hermanns, Holger and Krčál, Jan and Krčál, Pavel},
   address = {Berlin},
   booktitle = {In International Conference on Computer Safety, Reliability, and Security},
   doi = {http://dx.doi.org/10.1007/978-3-319-45477-1_21},
   keywords = {static and dynamic fault trees; PSA; nuclear safety; interactive Markov chains; open IMC},
   howpublished = {tištěná verze "print"},
   language = {eng},
   location = {Berlin},
   isbn = {978-3-319-45476-4},
   pages = {266-280},
   publisher = {Springer},
   title = {Effective static and dynamic fault tree analysis.},
   year = {2016}
}

TY  - JOUR
ID  - 1377788
AU  - Bäckström, Ola - Butkova, Yuliya - Hermanns, Holger - Krčál, Jan - Krčál, Pavel
PY  - 2016
TI  - Effective static and dynamic fault tree analysis.
PB  - Springer
CY  - Berlin
SN  - 9783319454764
KW  - static and dynamic fault trees
KW  - PSA
KW  - nuclear safety
KW  - interactive Markov chains
KW  - open IMC
N2  - Fault trees constitute one of the essential formalisms for static safety analysis of various industrial systems. Dynamic fault trees (DFT) enrich the formalism by support for time-dependent behaviour, e.g., repairs or dynamic dependencies. This enables more realistic and more precise modelling, and can thereby avoid overly pessimistic analysis results. But analysis of DFT is so far limited to substantially smaller models than those required for instance in the domain of nuclear power safety. This paper considers so called SD fault trees, where the user is free to express each equipment failure either statically, without modelling temporal information, or dynamically, allowing repairs and other timed interdependencies. We introduce an analysis algorithm for an important subclass of SD fault trees. The algorithm employs automatic abstraction techniques effectively, and thereby scales similarly to static analysis algorithms, albeit allowing for a more realistic modelling and analysis. We demonstrate the applicability of the method by an experimental evaluation on fault trees of nuclear power plants.
ER  -

BÄCKSTRÖM, Ola, Yuliya BUTKOVA, Holger HERMANNS, Jan KRČÁL and Pavel KRČÁL. Effective static and dynamic fault tree analysis. In \textit{In International Conference on Computer Safety, Reliability, and Security}. Berlin: Springer, 2016, p.~266-280. ISBN~978-3-319-45476-4. Available from: https://dx.doi.org/10.1007/978-3-319-45477-1\_{}21.

Detailed Information on Publication Record