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

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

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

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

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

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

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

In this paper, we introduce weak and branching bisimulation for fully probabilistic systems, transition systems where nondeterministic branching is replaced by Probabilistic branching.Expand

We consider concurrent probabilistic systems, based on Probabilistic automata of Segala & Lynch [55], which allow non-deterministic choice between probability distributions.Expand