Model-Checking Algorithms for Continuous-Time Markov Chains
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.
Interactive Markov Chains
- H. Hermanns
- Mathematics, ArtLecture Notes in Computer Science
This paper presents a meta-analyses of interactive Markov Chains and its applications to knowledge representation, specifically in the context of knowledge representation and representation in the discrete-time model.
The Ins and Outs of the Probabilistic Model Checker MRMC
Probabilistic reachability for parametric Markov models
- E. M. Hahn, H. Hermanns, Lijun Zhang
- Computer Science, MathematicsInternational Journal on Software Tools for…
- 26 June 2009
It turns out that the bottleneck lies in the growth of the regular expression relative to the number of states (nΘ(log n), so the approach is to arrive at an effective method that avoids this blow up in most practical cases.
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.
Syntax , Semantics , Equivalences , and Axioms for MTIPP y
This report presents the language together with its operational semantics, that defines Markovian labelled transition systems as a combination of classical action-oriented transition systems andMarkovian processes, especially continuous time Markov chains, and presents equational laws for the central notion of equivalence.
Weak Bisimulation for Fully Probabilistic Processes
This paper gives an algorithm to decide weak (and branching) bisimulation with a time complexity cubic in the number of states of the fully probabilistic system, and illustrates that due to these properties, weak bisimulations provides all the crucial ingredients for mechanised compositional veri�cation of Probabilistic transition systems.
Comparative branching-time semantics for Markov chains
Probabilistic Termination: Soundness, Completeness, and Compositionality
- Luis María Ferrer Fioriti, H. Hermanns
- Computer ScienceACM-SIGACT Symposium on Principles of Programming…
- 14 January 2015
A framework to prove almost sure termination for probabilistic programs with real valued variables, based on ranking supermartingales, which is proven sound and complete for a meaningful class of programs involving randomization and bounded nondeterminism.