/dft-bdmp

Transformation from Boolean Logic Driven Markov Processes (BDMPs) to Dynamic Fault Trees (DFTs)

Primary LanguageC++

Boolean Logic Driven Markov Processes (BDMPs)

The repository provides supplementary material for publications about BDMPs and their analysis.

List of files

  • The PRDC 2019 publication presents a transformation from BDMPs to Dynamic Fault Trees (DFTs).
  • The SAFECOMP 2020 publicaiton presents a compositional semantics of BDMPs in terms of Markov automata.
  • The 2020-EDCC publication presents a transformation from BDMPs to Generalized Stochastic Petri Nets (GSPNs).
  • The 2020-Lars-Beckers-Thesis provides implementation details of BDMP2GSPN approach embedded in Storm.
  • The 2021-DSN publication presents Figaro model checker build on top of Storm.
  • The 2021-NFM publication presents a lazy abstraction approch enabled on a recently developed Figaro model checker.
  • The 2021-PRDC publication presents a translation of repariable BDMPs into repairable DFTs . State of of the art for repairable DFTs is discussed.
  • The 2021-LADC publication presents a sprinkler system case study.
  • The 2022-SMACD publication presents a combined model checking- and theorem proving-based approach for static fault tree analysis.
  • The 2022-LambdaMu is under review. This paper advertises Figaro model checker to industrial users.
  • The Dissertation contains results of Ph.D. dissertation for reproducability.

Download

To download all files, click here.