A

SAFEST: The Static and Dynamic Fault Tree Analysis Tool

European Safety and Reliability Conference (ESREL), pp. 193–200

Abstract

We present SAFEST, the Static And dynamic Fault trEe analySis Tool.While standard (or static) fault trees (SFT) appeal as a relatively simple tool, they are limited in their modeling capabilities.Dynamic fault trees (DFT) extend SFT by support for faithfully modeling spare management, order-dependent failures and functional dependencies.While various analysis approaches for DFTs exist in the literature, tool support is scarce.During the last years, we developed SAFEST, a modern, state-of-the-art tool for modeling and analysing (SFTs and) DFTs.SAFEST's web-based interface offers a drag-and-drop editor for creating fault trees.A step-by-step simulator visualizes how failures -given by the user -affect the state of DFT elements.SAFEST employs a plethora of analysis approaches.SFTs are best analyzed using binary decision diagrams (BDD) and SAFEST performs comparable to existing SFT tools.DFTs are analyzed via state-based techniques by translation into a Markov model.SAFEST can analyze these models via probabilistic model checking, yielding exact results efficiently.It also provides an approximation approach that builds only the most "important" parts of the DFT's behaviour.This enables the analysis of gigantic DFTs at the expense of exactness of results.This approximation provides upper and lower bounds on the reliability measure of interest.The precision can be tuned according to the user's needs.The modeling and analysis capabilities of DFTs as well as the performance of our tool has been demonstrated in several practical and industrial case studies.DFTs with up to several hundreds of elements have been successfully analyzed with SAFEST.

Authors 6

  1. Matthias Volk corresponding Aachen

    Radboud University Nijmegen · RWTH Aachen University · University of Twente

    Affiliation as printed

    University of Twente , The Netherlands

    DGB Technologies, US

    RWTH Aachen University, Germany and

    Radboud University Nijmegen, The Netherlands

    University of Twente, The Netherlands

    University of Twente, The Netherlands and

  2. Radboud University Nijmegen · RWTH Aachen University · University of Twente

    Affiliation as printed

    RWTH Aachen University , Germany and

    University of Twente , The Netherlands

    DGB Technologies, US

    RWTH Aachen University, Germany and

    Radboud University Nijmegen, The Netherlands

    University of Twente, The Netherlands

    University of Twente, The Netherlands and

  3. Falak Sher Aachen

    Radboud University Nijmegen · RWTH Aachen University · University of Twente

    Affiliation as printed

    DGB Technologies , US

    DGB Technologies, US

    RWTH Aachen University, Germany and

    Radboud University Nijmegen, The Netherlands

    University of Twente, The Netherlands

    University of Twente, The Netherlands and

  4. Radboud University Nijmegen · RWTH Aachen University · University of Twente

    Affiliation as printed

    Radboud University Nijmegen , The Netherlands

    University of Twente , The Netherlands and

    DGB Technologies, US

    RWTH Aachen University, Germany and

    Radboud University Nijmegen, The Netherlands

    University of Twente, The Netherlands

    University of Twente, The Netherlands and

  5. Zafar Ahmad Aachen

    Radboud University Nijmegen · RWTH Aachen University · University of Twente

    Affiliation as printed

    DGB Technologies , US

    DGB Technologies, US

    RWTH Aachen University, Germany and

    Radboud University Nijmegen, The Netherlands

    University of Twente, The Netherlands

    University of Twente, The Netherlands and

Cited by 0 stored of 0

No patents citing this paper on Lens.org (checked 2026-10-06).

References 26