Principles of model checking
Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field.
Model-Checking Algorithms for Continuous-Time Markov Chains
- C. Baier, B. Haverkort, H. Hermanns, J. Katoen
- Computer ScienceIEEE Trans. Software Eng.
- 1 April 2002
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.
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field.
A Storm is Coming: A Modern Probabilistic Model Checker
- C. Dehnert, Sebastian Junges, J. Katoen, Matthias Volk
- Computer ScienceInternational Conference on Computer Aided…
- 14 February 2017
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.
The Ins and Outs of the Probabilistic Model Checker MRMC
- J. Katoen, Ivan S. Zapreev, E. M. Hahn, H. Hermanns, D. Jansen
- Computer ScienceSixth International Conference on the…
- 13 September 2009
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
- C. Baier, J. Katoen, H. Hermanns
- Mathematics, Computer ScienceInternational Conference on Concurrency Theory
- 24 August 1999
A symbolic approximate method for solving the integrals using MTDDs (multi-terminal decision diagrams), a generalisation of MTBDDs, suitable for numerical integration using quadrature formulas based on equally-spaced abscissas, like trapezoidal, Simpson and Romberg integration schemes.
Model Checking Continuous-Time Markov Chains by Transient Analysis
- C. Baier, B. Haverkort, H. Hermanns, J. Katoen
- Computer ScienceInternational Conference on Computer Aided…
- 15 July 2000
The main result of this paper is that model checking probabilistic timing properties can be reduced to the problem of computing transient state probabilities for CTMCs, and a variant of ordinary lumping equivalence, a well-known notion for aggregating CT MCs, preserves the validity of all CSL-formulas.
A Markov reward model checker
- J. Katoen, M. Khattri, Ivan S. Zapreev
- Computer ScienceInternational Conference on Quantitative…
- 19 September 2005
MRMC, a model checker for discrete-time and continuous-time Markov reward models, supports reward extensions of PCTL and CSL, and allows for the automated verification of properties concerning long-run and instantaneous rewards as well as cumulative rewards.
Comparative branching-time semantics for Markov chains
- C. Baier, J. Katoen, H. Hermanns, V. Wolf
- Computer ScienceInformation and Computation
- 1 August 2005
Discrete-Time Rewards Model-Checked
- S. Andova, H. Hermanns, J. Katoen
- Computer ScienceInternational Conference on Formal Modeling and…
- 6 September 2003
The temporal logic probabilistic CTL is extended with reward constraints and formulae to formulate complex measures – involving expected as well as accumulated rewards – in a precise and succinct way are introduced.
...
...