The objective of this collaborative textbook is to present the state of ...
We study transformations of automata and games using Muller conditions i...
We tackle the problem of automatic generation of computer programs from ...
We consider two-player games over graphs and give tight bounds on the me...
This paper studies two-player zero-sum games played on graphs and makes
...
We consider the problem of automatically constructing computer programs ...
Linear temporal logic (LTL) is a specification language for finite seque...
The notion of separating automata was introduced by Bojanczyk and Czerwi...
We introduce the notion of universal graphs as a tool for constructing
a...
In this paper we initiate the study of the computational complexity of
l...
We study alternating automata with qualitative semantics over infinite b...
This paper studies the complexity of languages of finite words using aut...
Programming by example is the problem of synthesizing a program from a s...
Bertrand et al. introduced a model of parameterised systems, where each ...
The success of neural networks across most machine learning tasks and th...
The Monniaux Problem in abstract interpretation asks, roughly speaking,
...
We study the computational complexity of solving mean payoff games. This...
This paper is a contribution to the study of parity games and the recent...
Several distinct techniques have been proposed to design quasi-polynomia...
We consider the decidability of state-to-state reachability in linear
ti...
The quest for a polynomial time algorithm for solving parity games gaine...
We study Monadic Second-Order Logic (MSO) over finite words, extended wi...
The Orbit Problem consists of determining, given a linear
transformation...