A Storm is Coming: A Modern Probabilistic Model Checker
Christian Dehnert,Sebastian Junges,Joost-Pieter Katoen,Matthias Volk +3 more
- pp 592-600
TLDR
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.Abstract:
We launch the new probabilistic model checker Storm. It features the analysis of discrete- and continuous-time variants of both Markov chains and MDPs. It supports the Prism and JANI modeling languages, probabilistic programs, dynamic fault trees and generalized stochastic Petri nets. It has a modular set-up in which solvers and symbolic engines can easily be exchanged. It offers a Python API for rapid prototyping by encapsulating Storm’s fast and scalable algorithms. Experiments on a variety of benchmarks show its competitive performance.read more
Citations
More filters
Posted Content
Towards Verified Artificial Intelligence
Sanjit A. Seshia,Dorsa Sadigh +1 more
TL;DR: Five challenges for achieving Verified AI are described, and five corresponding principles for addressing these challenges are described.
Journal ArticleDOI
Fast Dynamic Fault Tree Analysis by Model Checking Techniques
TL;DR: 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 to aggressively exploit the DFT structure—detecting symmetries, spurious nondeterminism, and don't cares.
Journal ArticleDOI
The probabilistic model checker Storm
TL;DR: 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.
Journal ArticleDOI
Synthesis of probabilistic models for quality-of-service software engineering
TL;DR: EvoChecker can be used to synthesise the Pareto-optimal set of probabilistic models associated with the QoS requirements of a system under design, and to support the selection of a suitable system architecture and configuration.
Proceedings Article
Finite-State Controllers of POMDPs using Parameter Synthesis
Sebastian Junges,Nils Jansen,Ralf Wimmer,Tim Quatmann,Leonore Winterer,Joost-Pieter Katoen,Bernd Becker +6 more
TL;DR: Uncertainty in Artificial Intelligence: Thirty-Fourth Conference (2018) August 6-10, 2018, Monterey, California, USA
References
More filters
Book ChapterDOI
Z3: an efficient SMT solver
TL;DR: Z3 is a new and efficient SMT Solver freely available from Microsoft Research that is used in various software verification and analysis applications.
Book ChapterDOI
PRISM 4.0: verification of probabilistic real-time systems
TL;DR: A major new release of the PRISMprobabilistic model checker is described, adding, in particular, quantitative verification of (priced) probabilistic timed automata.
Journal ArticleDOI
A logic for reasoning about time and reability
Hans Hansson,Bengt Jonsson +1 more
TL;DR: This work presents a logic for stating properties such as, “after a request for service there is at least a 98% probability that the service will be carried out within 2 seconds” and gives algorithms for checking that a given Markov chain satisfies a formula in the logic.
Journal ArticleDOI
Model-checking algorithms for continuous-time Markov chains
TL;DR: The problem of model-checking time-bounded until properties can be reduced to the problem of computing transient state probabilities for CTMCs and a variant of lumping equivalence (bisimulation) preserves the validity of all formulas in the logic.
Journal ArticleDOI
Dynamic fault-tree models for fault-tolerant computer systems
TL;DR: HARP (Hybrid Automated Reliability Predictor) is a software package developed at Duke University and NASA Langley Research Center that can solve fault-tree models that frequently employ high levels of redundancy, dynamic redundancy management, and complex fault and error recovery techniques.