• Publications
  • Influence
Principles of model checking
TLDR
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. Expand
  • 4,076
  • 672
  • PDF
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
  • 769
  • 105
  • PDF
Principles of Model Checking (Representation and Mind Series)
TLDR
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. Expand
  • 1,072
  • 85
Probabilistic ω-automata
TLDR
We study a series of fundamental properties of probabilistic ω-automata with three different language-semantics: (1) the probable semantics that requires positive acceptance probability, (2) the almost-sure semantics that require acceptance with probability 1, and (3) the threshold semantics that relies on an additional parameter λ ∈ ]0,1 that specifies a lower probability bound for the acceptance probability. Expand
  • 390
  • 42
  • PDF
Modeling component connectors in Reo by constraint automata
TLDR
We introduce constraint automata and propose them as an operational model for Reo, an exogenous coordination language for compositional construction of component connectors based on a calculus of channels. Expand
  • 331
  • 36
  • PDF
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
  • 279
  • 33
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
  • 193
  • 19
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
Model checking for a probabilistic branching time logic with fairness
TLDR
We consider concurrent probabilistic systems, based on Probabilistic automata of Segala & Lynch [55], which allow non-deterministic choice between probability distributions. Expand
  • 247
  • 18
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
  • 174
  • 18
  • PDF