Rich Interfaces for Dependability: Compositional Methods for Dynamic Fault Trees and Arcade models

H. Boudali; Pepijn Crouzen; Boudewijn R.H.M. Haverkort; G.W.M. Kuntz; Mariëlle Ida Antoinette Stoelinga

Rich Interfaces for Dependability: Compositional Methods for Dynamic Fault Trees and Arcade models

H. Boudali, Pepijn Crouzen, Boudewijn R.H.M. Haverkort, G.W.M. Kuntz, Mariëlle Ida Antoinette Stoelinga

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

30 Downloads (Pure)

Abstract

This paper discusses two behavioural interfaces for reliability analysis: dynamic fault trees, which model the system reliability in terms of the reliability of its components and Arcade, which models the system reliability at an architectural level. For both formalisms, the reliability is analyzed by transforming the DFT or Arcade model to a set of input-output Markov Chains. By using compositional aggregation techniques based on weak bisimilarity, significant reductions in the state space can be obtained.

Original language	English
Title of host publication	IEEE Transactions on Acoustics Speech and Signal Processing
Place of Publication	Aalborg, Denmark
Publisher	University of Aalborg
Number of pages	6
ISBN (Print)	not assigned
Publication status	Published - Apr 2008
Externally published	Yes

Keywords

EC Grant Agreement nr.: FP7/214755
EC Grant Agreement nr.: FP7-ICT-2007-1
IR-65424
METIS-256470
EWI-15213

Access to Document

FIT08

Cite this

@inproceedings{fcb807d4c55d406eae8e444690382a7c,

title = "Rich Interfaces for Dependability: Compositional Methods for Dynamic Fault Trees and Arcade models",

abstract = "This paper discusses two behavioural interfaces for reliability analysis: dynamic fault trees, which model the system reliability in terms of the reliability of its components and Arcade, which models the system reliability at an architectural level. For both formalisms, the reliability is analyzed by transforming the DFT or Arcade model to a set of input-output Markov Chains. By using compositional aggregation techniques based on weak bisimilarity, significant reductions in the state space can be obtained.",

keywords = "EC Grant Agreement nr.: FP7/214755, EC Grant Agreement nr.: FP7-ICT-2007-1, IR-65424, METIS-256470, EWI-15213",

author = "H. Boudali and Pepijn Crouzen and Haverkort, {Boudewijn R.H.M.} and G.W.M. Kuntz and Stoelinga, {Mari{\"e}lle Ida Antoinette}",

note = "eemcs-eprint-15213",

year = "2008",

month = apr,

language = "English",

isbn = "not assigned",

booktitle = "IEEE Transactions on Acoustics Speech and Signal Processing",

publisher = "University of Aalborg",

}

Rich Interfaces for Dependability: Compositional Methods for Dynamic Fault Trees and Arcade models. / Boudali, H.; Crouzen, Pepijn; Haverkort, Boudewijn R.H.M. et al.
IEEE Transactions on Acoustics Speech and Signal Processing. Aalborg, Denmark: University of Aalborg, 2008.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

TY - GEN

T1 - Rich Interfaces for Dependability

T2 - Compositional Methods for Dynamic Fault Trees and Arcade models

AU - Boudali, H.

AU - Crouzen, Pepijn

AU - Haverkort, Boudewijn R.H.M.

AU - Kuntz, G.W.M.

AU - Stoelinga, Mariëlle Ida Antoinette

N1 - eemcs-eprint-15213

PY - 2008/4

Y1 - 2008/4

N2 - This paper discusses two behavioural interfaces for reliability analysis: dynamic fault trees, which model the system reliability in terms of the reliability of its components and Arcade, which models the system reliability at an architectural level. For both formalisms, the reliability is analyzed by transforming the DFT or Arcade model to a set of input-output Markov Chains. By using compositional aggregation techniques based on weak bisimilarity, significant reductions in the state space can be obtained.

AB - This paper discusses two behavioural interfaces for reliability analysis: dynamic fault trees, which model the system reliability in terms of the reliability of its components and Arcade, which models the system reliability at an architectural level. For both formalisms, the reliability is analyzed by transforming the DFT or Arcade model to a set of input-output Markov Chains. By using compositional aggregation techniques based on weak bisimilarity, significant reductions in the state space can be obtained.

KW - EC Grant Agreement nr.: FP7/214755

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

KW - IR-65424

KW - METIS-256470

KW - EWI-15213

M3 - Conference contribution

SN - not assigned

BT - IEEE Transactions on Acoustics Speech and Signal Processing

PB - University of Aalborg

CY - Aalborg, Denmark

ER -

Rich Interfaces for Dependability: Compositional Methods for Dynamic Fault Trees and Arcade models

Abstract

Keywords

Access to Document

Fingerprint

Cite this