One Net Fits All: A unifying semantics of Dynamic Fault Trees using GSPNs

  title={One Net Fits All: A unifying semantics of Dynamic Fault Trees using GSPNs},
  author={Sebastian Junges and Joost-Pieter Katoen and Mari{\"e}lle Stoelinga and Matthias Volk},
  booktitle={Petri Nets},
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… 
This thesis proposes a mechanism that indicates when parts of the GSPN are no longer relevant for the analysis similar to the principle of “Don’t Cares” in fault tree analysis, and proves the correctness of the construction and shows structural properties of the resulting GSPNs, e.
BDDs Strike Back: Efficient Analysis of Static and Dynamic Fault Trees
This paper combines the best of both worlds by following Dugan’s approach: dynamic sub-trees are analysed via model checking Markov models and replaced by basic events capturing the obtained failure probabilities, and the resulting SFT is then analysed via BDDs.
Model-based reliability analysis of aerospace systems
This thesis starts with describing the modeling language that is employed by the COMPASS toolset, both its syntax and semantics, and leads to the definition of the catalogue of system and software properties, which encodes requirement specifications directly in the system model.
Parameter Synthesis for Markov Models
This paper presents various analysis algorithms for parametric Markov chains and Markov decision processes, and gives a detailed account of the various algorithms, presents a software tool realising these techniques, and reports on an extensive experimental evaluation on benchmarks.
Safety Analysis for Vehicle Guidance Systems with Dynamic Fault Trees
A DFT Modeling Approach for Infrastructure Reliability Analysis of Railway Station Areas
Verification of the capability of station areas to fulfill operational design specifications as a whole remains widely open, particularly in station and junction areas.
Explaining Boolean-Logic Driven Markov Processes using GSPNs
A formal semantics of repairable BDMPs is presented by using generalized stochastic Petri nets (GSPNs) and is modular and thus easily extendable to other elements, e.g., leaves dedicated to security applications.
A Compositional Semantics for Repairable BDMPs
This paper presents a rigorous semantics to repairable BDMPs using Markov automata (MA), a variant of continuous-time Markov chains (CTMCs) with action transitions, and experimentally shows that it corresponds to the BDMP interpretation by the tool Yet Another Monte Carlo Simulation.
Computer Safety, Reliability, and Security: 39th International Conference, SAFECOMP 2020, Lisbon, Portugal, September 16–18, 2020, Proceedings
EASA has published its Artificial Intelligence Roadmap at the beginning of 2020, with a view to enabling the approval of AI-based solutions and with an initial focus on machine learning techniques, and the perspectives of this roadmap will be presented.
Synergizing Reliability Modeling Languages: BDMPs without Repairs and DFTs
This paper outlines a set of BDMP-to-DFT translation rules and applies them to thirty-three BDMP test cases modeling various scenarios of security, software and system reliability and compares the performance and capabilities of analysis tools for BDMPs.


Towards a sound semantics for dynamic fault trees
Fault trees and sequence dependencies
  • J. DuganS. BavusoM. Boyd
  • Computer Science, Geology
    Annual Proceedings on Reliability and Maintainability Symposium
  • 1990
New fault-tree gates to capture so-called sequence dependencies are defined, and the utility of the new gates is demonstrated by presenting several models of the FTPP (fault-tolerant parallel processor), which include both hot and cold spares.
Uncovering Dynamic Fault Trees
This paper systematically uncovers differences and categorises existing DFT variants, and awareness of these impacts is important when using DFT modelling and analysis.
The Conversion of Dynamic Fault Trees to Stochastic Petri Nets, as a case of Graph Transformation
  • D. Raiteri
  • Computer Science
    Electron. Notes Theor. Comput. Sci.
  • 2005
Fast Dynamic Fault Tree Analysis by Model Checking Techniques
This paper presents a new state-space generation approach for dynamic fault trees (DFTs) that exploits several successful reduction techniques from the field of model checking. The key idea is to
Quantitative Analysis of Dynamic Fault Trees Based on the Structure Function
A probabilistic model of dynamic gates which allows to perform the quantitative analysis of any dynamic fault tree (DFT) from its structure function and can accommodate any failure distribution of basic events.
Formal semantics of models for computational engineering: a case study on dynamic fault trees
  • D. CoppitK. SullivanJ. Dugan
  • Computer Science
    Proceedings 11th International Symposium on Software Reliability Engineering. ISSRE 2000
  • 2000
The approach revealed important shortcomings in the previous, informal definitions of the framework, and thus led to significant improvements, suggesting that formally specifying framework semantics is critical to effective framework design.