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 …

Cyber deception aims to misrepresent the state of the network to mislead the attackers,
falsify their reconnaissance conclusions, and deflect them away from their goals. Honeypots …

Probabilistic ω-automata are variants of nondeterministic automata over infinite words where
all choices are resolved by probabilistic distributions. Acceptance of a run for an infinite input …

In two-player finite-state stochastic games of partial observation on graphs, in every state of
the graph, the players simultaneously choose an action, and their joint actions determine a …

We study observation-based strategies for two-player turnbased games played on graphs
with parity objectives. An observationbased strategy relies on imperfect information about …

The diagnosis problem amounts to deciding whether some specific “fault” event occurred or
not in a system, given the observations collected on a run of this system. This system is then …

We study observation-based strategies for partially-observable Markov decision processes
(POMDP s) with parity objectives. An observation-based strategy relies on partial information …

We consider two-player zero-sum stochastic games on graphs with ω-regular winning
conditions specified as parity objectives. These games have applications in the design and …

We consider two-player zero-sum games on graphs. On the basis of the information
available to the players these games can be classified as follows:(a) partial-observation …

The probabilistic modal μ-calculus is a fixed-point logic designed for expressing properties
of probabilistic labeled transition systems (PLTS's). Two equivalent semantics have been …