One net fits all. A unifying semantics of dynamic fault trees using GSPNs

DOI10.1007/978-3-319-91268-4_14MaRDI QIDQ2280191zbMATH OpenOpenAlexFDO

Authors Sebastian Junges, Matthias Volk, Joost-Pieter Katoen, Mariëlle I. A. Stoelinga

Publication date 18 December 2019

Full work available at URL https://arxiv.org/abs/1803.05376

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Abstract: Dynamic Fault Trees (DFTs) are a prominent model in reliability engineering. They are strictly more expressive than static fault trees, but this comes at a price: their interpretation is non-trivial and leaves quite some freedom. This paper presents a GSPN semantics for DFTs. This semantics is rather simple and compositional. The key feature is that this GSPN semantics unifies all existing DFT semantics from the literature. All semantic variants can be obtained by choosing appropriate priorities and treatment of non-determinism.

Recommendations

• A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
• The conversion of dynamic fault trees to stochastic Petri nets, as a case of graph transformation
• A semantics for every GSPN
• Fault trees on a diet -- automated reduction by graph rewriting
• Fault trees on a diet: automated reduction by graph rewriting

Cited in

(2)

• Robust almost-sure reachability in multi-environment MDPs
• A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains

This page was built for publication: One net fits all. A unifying semantics of dynamic fault trees using GSPNs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2280191)