Nov 18, 2014: Sebastian Junges: Graph rewriting on Dynamic Fault Trees for faster state space generation

November 18, 2014Graph rewriting on Dynamic Fault Trees for faster state space generation
Room: Carre 2GSebastian Junges
12:30-13:30

Fault Tree Analysis is a widespread industrial standard for Reliablility, Availabilty, Maintainability & Safety (RAMS) analysis.
Dynamic Fault Trees (DFTs) are a particular expressive modeling language for FTA, which extend standard fault trees with order-dependent failures and spare management.
The omni-present state space explosion also applies to DFTs. While compositional semantics as presented in (1) efficiently reduce the resulting state space of the underlying model, the state space generation time still poses challenges. Inspired by the observation that the size of many DFTs can be reduced on the level of DFTs, we propose a framework for graph rewriting on fault trees. First results indicate that the underlying state space of the reduced fault trees is generated notably faster.
In this presentation, we introduce DFTs and give examples for reductions that can be obtained. We then shortly sketch the underlying theory - from a denotational-style semantics to a proper embedding in graphs for rewriting. Afterwards, we shortly present the implementation in Groove (2).

(1)
Boudali, H. and Crouzen, P. and Stoelinga, M.I.A. (2010) A Rigorous, Compositional, and Extensible Framework for Dynamic Fault Tree Analysis. IEEE Transactions on Dependable and Secure Computing, 7 (2). pp. 128-143. ISSN 1545-5971

(2)
Ghamarian, A.H. and de Mol, M.J. and Rensink, A. and Zambon, Eduardo and Zimakova, M.V. (2012) Modelling and analysis using GROOVE. International journal on software tools for technology transfer, 14 (1). pp. 15-40. ISSN 1433-2779