The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
A Storm is Coming: A Modern Probabilistic Model Checker
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
de Moura, L., & Bjørner, N. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78800-3_24 · Cited by 6,595
PRISM 4.0: Verification of Probabilistic Real-Time Systems
Kwiatkowska, M., Norman, G., & Parker, D. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22110-1_47 · Cited by 2,361
A logic for reasoning about time and reliability
Hansson, H., & Jonsson, B. (1994) · Formal Aspects of Computing · doi:10.1007/bf01211866 · Cited by 1,372
Dynamic fault-tree models for fault-tolerant computer systems
Dugan, J. B., Bavuso, S. J., & Boyd, M. A. (1992) · IEEE Transactions on Reliability · doi:10.1109/24.159800 · Cited by 769
Model-checking algorithms for continuous-time markov chains
Baier, C., Haverkort, B., Hermanns, H., & Katoen, J.-P. (2003) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2003.1205180 · Cited by 767
Self-citationCimatti, A., Griggio, A., Schaafsma, B. J., & Sebastiani, R. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-36742-7_7 · Cited by 488
Gordon, A. D., Henzinger, T. A., Nori, A. V., & Rajamani, S. K. (2014) · Future of Software Engineering Proceedings · doi:10.1145/2593882.2593900 · Cited by 357
The ins and outs of the probabilistic model checker MRMC
Katoen, J.-P., Zapreev, I. S., Hahn, E. M., Hermanns, H., & Jansen, D. N. (2011) · Performance Evaluation · doi:10.1016/j.peva.2010.04.001 · Cited by 250
Self-citationSymbolic and Parametric Model Checking of Discrete-Time Markov Chains
Daws, C. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31862-0_21 · Cited by 183
The Probabilistic Model Checking Landscape
Katoen, J.-P. (2016) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1145/2933575.2934574 · Cited by 182
Self-citation
Cited by
Towards Verified Artificial Intelligence
Seshia, S. A., Sadigh, D., & Sastry, S. S. (2016) · arXiv · doi:10.48550/arxiv.1606.08514 · Cited by 142
Formal Methods for Autonomous Systems
Wongpiromsarn, T., Ghasemi, M., Cubuktepe, M., Bakirtzis, G., Carr, S., Karabag, M. O., Neary, C., Gohari, P., & Topcu, U. (2023) · Foundations and Trends® in Systems and Control · doi:10.1561/2600000029 · Cited by 17
Metadata
- Authors
- Dehnert, C., Junges, S., Katoen, J.-P., & Volk, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2017
- Pages
- 592-600
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2593267253
- Cited by
- 401
- References
- 24
- FWCI
- 52.62
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Storm is Coming: A Modern Probabilistic Model Checker. https://app.cochat.ai/papers/10.1007/978-3-319-63390-9_31
- The paper
- Dehnert, C., Junges, S., Katoen, J.-P., & Volk, M. (2017). A Storm is Coming: A Modern Probabilistic Model Checker. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-319-63390-9_31
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
