Share This Author
A Storm is Coming: A Modern Probabilistic Model Checker
The new probabilistic model checker Storm features the analysis of discrete- and continuous-time variants of both Markov chains and MDPs and offers a Python API for rapid prototyping by encapsulating Storm’s fast and scalable algorithms.
PROPhESY: A PRObabilistic ParamEter SYnthesis Tool
ProPhESY, a tool for analyzing parametric Markov chains (MCs), can compute a rational function (i.e., a fraction of two polynomials in the model parameters) for reachability and expected reward objectives and supports the novel feature of conditional probabilities.
Accelerating Parametric Probabilistic Verification
A novel method for computing reachability probabilities of parametric discrete-time Markov chains whose transition probabilities are fractions of polynomials over a set of parameters based on a graph decomposition into strongly connected subgraphs combined with a novel factorization strategy for polynOMials.
The Probabilistic Model Checker Storm
- Christian Hensel, Sebastian Junges, J. Katoen, Tim Quatmann, Matthias Volk
- Computer ScienceInt. J. Softw. Tools Technol. Transf.
- 17 February 2020
The main features of Storm are reported and how to effectively use them are explained and an empirical evaluation of different configurations of Storm on the QComp 2019 benchmark set is presented.
The COMICS Tool - Computing Minimal Counterexamples for DTMCs
- N. Jansen, E. Ábrahám, Matthias Volk, Ralf Wimmer, J. Katoen, B. Becker
- Computer ScienceATVA
- 4 June 2012
This paper presents the tool COMICS 1.0, which performs model checking and generates counterexamples for DTMCs, and comes with a command line version as well as a graphical user interface that allows the user to interactively influence the refinement process of the countereXample.
Model-Based Safety Analysis for Vehicle Guidance Systems
- Majdi Ghadhab, Sebastian Junges, J. Katoen, M. Kuntz, Matthias Volk
- Computer ScienceSAFECOMP
- 12 September 2017
The proposed approach constructs dynamic fault trees (DFTs) to model a variety of safety concepts and E/E architectures for drive automation to evaluate various quantitative measures by means of model checking.
Fast Dynamic Fault Tree Analysis by Model Checking Techniques
- Matthias Volk, Sebastian Junges, J. Katoen
- Computer ScienceIEEE Transactions on Industrial Informatics
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…
One Net Fits All: A unifying semantics of Dynamic Fault Trees using GSPNs
A GSPN semantics for DFTs is presented, which unifies all existing DFT semantics from the literature and can be obtained by choosing appropriate priorities and treatment of non-determinism.
Formal Verification of Rewriting Rules for Dynamic Fault Trees
- Yassmeen Elderhalli, Matthias Volk, O. Hasan, J. Katoen, S. Tahar
- Computer ScienceSEFM
- 18 September 2019
This work presents the formalization in HOL of commonly used DFT gates, i.e., AND, OR and PAND, with an arbitrary number of inputs, and describes the formal specification of the rewriting rules and the verification of their intended behavior using the HOL4 theorem prover.
The COMICS Tool - Computing Minimal Counterexamples for Discrete-time Markov Chains
The tool COMICS, which performs model checking and generates counterexamples for DTMCs, comes with a command-line version as well as a graphical user interface that allows the user to interactively influence the refinement process of the countereXample.