Graph-based games are an important tool in computer science. They have applications in
synthesis, verification, refinement, and far beyond. We review graph-based games with …

In recent years, there has been a growing need and interest in formally reasoning about the
quality of software and hardware systems. As opposed to traditional verification, in which …

We study turn-based stochastic zero-sum games with lexicographic preferences over
objectives. Stochastic games are standard models in control, verification, and synthesis of …

A nondeterministic discounted-sum automaton (NDA) values a run by the discounted sum of
the visited transition weights. That is, the weight in the i-th position of a run of a λ-NDA is …

Abstract Design and control of computer systems that operate in uncertain, competitive or
adversarial, environments can be facilitated by formal modelling and analysis. In this paper …

We consider Markov decision processes (MDPs) with multiple limit-average (or mean-
payoff) objectives. There exist two different views:(i) the expectation semantics, where the …

We study turn-based stochastic zero-sum games with lexicographic preferences over
reachability and safety objectives. Stochastic games are standard models in control …

Markov decision processes (MDPs) with multi-dimensional weights are useful to analyze
systems with multiple objectives that may be conflicting and require the analysis of trade …

The target discounted-sum problem is the following: Given a rational discount factor 0< λ< 1
and three rational values a, b, and t, does there exist a finite or an infinite sequence ω∈(a …

Markov decision processes (MDPs) with multi-dimensional weights are useful to analyze
systems with multiple objectives that may be conflicting and require the analysis of trade …