The model-checking approach was originally formulated for verifying qualitative properties
of systems, for example safety and liveness (see Chap. 2), and subsequently extended to …

The book consists of two sets of lecture notes devoted to slightly different methods of
analysis of concurrent and probabilistic computational systems. The first set of lectures …

We summarize classical and recent results about two-player games played on graphs with ω-
regular objectives. These games have applications in the verification and synthesis of …

We tackle the problem of non robustness of simulation and bisimulation when dealing with
probabilistic processes. It is important to ignore tiny deviations in probabilities because …

Stochastic games provide a versatile model for reactive systems that are affected by random
events. This dissertation advances the algorithmic theory of stochastic games to incorporate …

We extend the classical system relations of trace inclusion, trace equivalence, simulation,
and bisimulation to a quantitative setting in which propositions are interpreted not as …

We extend the basic system relations of trace inclusion, trace equivalence, simulation, and
bisimulation to a quantitative setting in which propositions are interpreted not as boolean …

Temporal logic is two-valued: formulas are interpreted as either true or false. When applied
to the analysis of stochastic systems, or systems with imprecise formal models, temporal …

Markov decision processes (MDPs) are standard models for probabilistic systems with non-
deterministic behaviours. Long-run average rewards provide a mathematically elegant …

We study two-player reachability games on finite graphs. At each state the interaction
between the players is concurrent and there is a stochastic Nature. Players also play …