A Rigorous, Compositional, and Extensible Framework for Dynamic Fault Tree Analysis

H. Boudali, R. Sandhu (Editor), Pepijn Crouzen, Mariëlle Ida Antoinette Stoelinga

Research output: Contribution to journalArticleAcademicpeer-review

86 Citations (Scopus)
29 Downloads (Pure)

Abstract

Fault trees (FT) are among the most prominent formalisms for reliability analysis of technical systems. Dynamic FTs extend FTs with support for expressing dynamic dependencies among components. The standard analysis vehicle for DFTs is state-based, and treats the model as a CTMC, a continuous-time Markov chain. This is not always possible, as we will explain, since some DFTs allow multiple interpretations. This paper introduces a rigorous semantic interpretation of DFTs. The semantics is defined in such a way that the semantics of a composite DFT arises in a transparent manner from the semantics of its components. This not only eases the understanding of how the FT building blocks interact. It also is a key to alleviate the state explosion problem. By lifting a classical aggregation strategy to our setting, we can exploit the DFT structure to build the smallest possible Markov chain representation of the system. The semantics - as well as the aggregation and analysis engine is implemented in a tool, called CORAL. We show by a number of realistic and complex systems that this methodology achieves drastic reductions in the state space.
Original languageUndefined
Pages (from-to)128-143
Number of pages16
JournalIEEE transactions on dependable and secure computing
Volume7
Issue number2
DOIs
Publication statusPublished - Jun 2010

Keywords

  • formal models
  • EWI-17048
  • EC Grant Agreement nr.: FP7-ICT-2007-1
  • EC Grant Agreement nr.: FP7/214755
  • Reliability
  • IR-80455
  • Compositionality
  • Framework
  • Fault Trees
  • METIS-318686

Cite this

@article{1c9148b57e8c4f198ed0f5fdb87c1934,
title = "A Rigorous, Compositional, and Extensible Framework for Dynamic Fault Tree Analysis",
abstract = "Fault trees (FT) are among the most prominent formalisms for reliability analysis of technical systems. Dynamic FTs extend FTs with support for expressing dynamic dependencies among components. The standard analysis vehicle for DFTs is state-based, and treats the model as a CTMC, a continuous-time Markov chain. This is not always possible, as we will explain, since some DFTs allow multiple interpretations. This paper introduces a rigorous semantic interpretation of DFTs. The semantics is defined in such a way that the semantics of a composite DFT arises in a transparent manner from the semantics of its components. This not only eases the understanding of how the FT building blocks interact. It also is a key to alleviate the state explosion problem. By lifting a classical aggregation strategy to our setting, we can exploit the DFT structure to build the smallest possible Markov chain representation of the system. The semantics - as well as the aggregation and analysis engine is implemented in a tool, called CORAL. We show by a number of realistic and complex systems that this methodology achieves drastic reductions in the state space.",
keywords = "formal models, EWI-17048, EC Grant Agreement nr.: FP7-ICT-2007-1, EC Grant Agreement nr.: FP7/214755, Reliability, IR-80455, Compositionality, Framework, Fault Trees, METIS-318686",
author = "H. Boudali and R. Sandhu and Pepijn Crouzen and Stoelinga, {Mari{\"e}lle Ida Antoinette}",
note = "eemcs-eprint-17048",
year = "2010",
month = "6",
doi = "10.1109/TDSC.2009.45",
language = "Undefined",
volume = "7",
pages = "128--143",
journal = "IEEE transactions on dependable and secure computing",
issn = "1545-5971",
publisher = "IEEE",
number = "2",

}

A Rigorous, Compositional, and Extensible Framework for Dynamic Fault Tree Analysis. / Boudali, H.; Sandhu, R. (Editor); Crouzen, Pepijn; Stoelinga, Mariëlle Ida Antoinette.

In: IEEE transactions on dependable and secure computing, Vol. 7, No. 2, 06.2010, p. 128-143.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - A Rigorous, Compositional, and Extensible Framework for Dynamic Fault Tree Analysis

AU - Boudali, H.

AU - Crouzen, Pepijn

AU - Stoelinga, Mariëlle Ida Antoinette

A2 - Sandhu, R.

N1 - eemcs-eprint-17048

PY - 2010/6

Y1 - 2010/6

N2 - Fault trees (FT) are among the most prominent formalisms for reliability analysis of technical systems. Dynamic FTs extend FTs with support for expressing dynamic dependencies among components. The standard analysis vehicle for DFTs is state-based, and treats the model as a CTMC, a continuous-time Markov chain. This is not always possible, as we will explain, since some DFTs allow multiple interpretations. This paper introduces a rigorous semantic interpretation of DFTs. The semantics is defined in such a way that the semantics of a composite DFT arises in a transparent manner from the semantics of its components. This not only eases the understanding of how the FT building blocks interact. It also is a key to alleviate the state explosion problem. By lifting a classical aggregation strategy to our setting, we can exploit the DFT structure to build the smallest possible Markov chain representation of the system. The semantics - as well as the aggregation and analysis engine is implemented in a tool, called CORAL. We show by a number of realistic and complex systems that this methodology achieves drastic reductions in the state space.

AB - Fault trees (FT) are among the most prominent formalisms for reliability analysis of technical systems. Dynamic FTs extend FTs with support for expressing dynamic dependencies among components. The standard analysis vehicle for DFTs is state-based, and treats the model as a CTMC, a continuous-time Markov chain. This is not always possible, as we will explain, since some DFTs allow multiple interpretations. This paper introduces a rigorous semantic interpretation of DFTs. The semantics is defined in such a way that the semantics of a composite DFT arises in a transparent manner from the semantics of its components. This not only eases the understanding of how the FT building blocks interact. It also is a key to alleviate the state explosion problem. By lifting a classical aggregation strategy to our setting, we can exploit the DFT structure to build the smallest possible Markov chain representation of the system. The semantics - as well as the aggregation and analysis engine is implemented in a tool, called CORAL. We show by a number of realistic and complex systems that this methodology achieves drastic reductions in the state space.

KW - formal models

KW - EWI-17048

KW - EC Grant Agreement nr.: FP7-ICT-2007-1

KW - EC Grant Agreement nr.: FP7/214755

KW - Reliability

KW - IR-80455

KW - Compositionality

KW - Framework

KW - Fault Trees

KW - METIS-318686

U2 - 10.1109/TDSC.2009.45

DO - 10.1109/TDSC.2009.45

M3 - Article

VL - 7

SP - 128

EP - 143

JO - IEEE transactions on dependable and secure computing

JF - IEEE transactions on dependable and secure computing

SN - 1545-5971

IS - 2

ER -