Efficient probabilistic fault tree analysis of safety critical systems via probabilistic model checking

Ammar, Marwan; Hamad, Ghaith Bany; Mohamed, Otmane Aït; Savaria, Yvon

doi:10.1109/fdl.2016.7880373

Cited by 6 publications

(2 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Rather than generating the whole state space at once-leading to a procedure that is difficult to understand and modify- [6,7] generate a Markov model for each DFT element. Recently, Ammar et al [1] advocated the use of compositional model generation combined with probabilistic model checking for DFTs using Markov decision processes (MDPs). The whole state space is then obtained by composing these Markov models in a smart way.…”

Section: Compositional State-space Generationmentioning

confidence: 99%

See 1 more Smart Citation

Boosting Fault Tree Analysis by Formal Methods

Katoen

Stoelinga

2017

ModelEd, TestEd, TrustEd

View full text Add to dashboard Cite

Fault trees are a key technique in safety and reliability engineering. Their application includes aerospace, nuclear power, car, and process engineering industries. Various fault tree extensions exist that increase expressiveness while yielding succinct models. Their analysis is a main bottleneck: techniques do not scale and require manual effort.Formal methods have an enormous potential to solve these issues. We discuss a mixture of formal method techniques resulting in a fully automated and scalable approach to analyze Dugan's dynamic fault trees.1 BDDs are succinct representations for switching functions. In 1990, their use in formal methods, in particular formal verification, has been introduced [11].

show abstract

Section: Compositional State-space Generationmentioning

confidence: 99%

“…Fault trees that only contain logical gates such as AND and OR are called static. Static fault tree analysis can be efficiently done using binary decision diagrams 1 .…”

Section: Introductionmentioning

confidence: 99%