• Publications
  • Influence
Model-Checking Algorithms for Continuous-Time Markov Chains
TLDR
This paper introduces a branching temporal logic for expressing real-time probabilistic properties on CTMCs and presents approximate model checking algorithms for this logic. Expand
  • 767
  • 105
  • PDF
Interactive Markov Chains
  • H. Hermanns
  • Computer Science
  • Lecture Notes in Computer Science
  • 2002
Interactive Processes.- Markov Chains.- Interactive Markov Chains.- Algebra of Interactive Markov Chains.- Interactive Markov Chains in Practice.- Conclusion.- Proofs for Chapter 3 and Chapter 4.-Expand
  • 558
  • 67
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
TLDR
This paper presents a symbolic model checking algorithm for continuous-time Markov chains for an extension of continuous stochastic logic CSL of Aziz et al . Expand
  • 278
  • 33
Discrete-Time Rewards Model-Checked
TLDR
This paper presents a model-checking approach for analyzing discrete-time Markov reward models. Expand
  • 125
  • 20
  • PDF
Model Checking Continuous-Time Markov Chains by Transient Analysis
TLDR
We show that model checking probabilistic timing properties of continuous-time Markov chains against continuous stochastic logic can be reduced to the problem of computing transient state probabilities. Expand
  • 192
  • 19
Probabilistic CEGAR
TLDR
We apply counterexample-guided abstraction refinement to the verification of probabilistic systems in the context of predicate abstraction. Expand
  • 181
  • 19
  • PDF
Weak Bisimulation for Fully Probabilistic Processes
TLDR
In this paper, we introduce weak and branching bisimulation for fully probabilistic systems, transition systems where nondeterministic branching is replaced by Probabilistic branching. Expand
  • 168
  • 19
  • PDF
On Probabilistic Automata in Continuous Time
TLDR
We develop a compositional behavioural model that integrates a variation of probabilistic automata into a conservative extension of interactive Markov chains. Expand
  • 168
  • 18
  • PDF
Comparative branching-time semantics for Markov chains
TLDR
This paper presents various semantics in the branching-time spectrum of discrete-time Markov chains (DTMCs and CTMCs). Expand
  • 173
  • 18
  • PDF
Probabilistic Termination: Soundness, Completeness, and Compositionality
TLDR
We propose a framework to prove almost sure termination for probabilistic programs with real valued variables. Expand
  • 100
  • 17