This short note establishes positionality of mean-payoff games over infi...
We use model-theoretic tools originating from stability theory to derive...
A class of graphs 𝒞 is monadically stable if for any unary
expansion 𝒞 o...
This paper is concerned with games of infinite duration played over
pote...
We study turn-based quantitative games of infinite duration opposing two...
We consider the problem of automatically constructing computer programs ...
We propose a variant of an algorithm introduced by Schewe and also studi...
We study the algorithm of Gurvich, Khachyian and Karzanov (GKK algorithm...
The notion of separating automata was introduced by Bojanczyk and Czerwi...
We introduce the notion of universal graphs as a tool for constructing
a...
Progress-measure lifting algorithms for solving parity games have the be...
Bertrand et al. introduced a model of parameterised systems, where each ...
The Monniaux Problem in abstract interpretation asks, roughly speaking,
...
We study the computational complexity of solving mean payoff games. This...
The Orbit Problem consists of determining, given a linear
transformation...