En | Fr | Es

Antonio Casares Santos

Je suis maître de conférences en informatique à Aix-Marseille Université et au LIS. Mes intérêts de recherche sont liés à la logique et aux langages formels. Plus précisément, je m’intéresse aux jeux sur les graphes et aux automates sur des mots infinis.

Avant j'ai terminé mon doctorat en 2023 sous la direction de Thomas Colcombet, Nathanaël Fijalkow et Igor Walukiewicz. J'ai été postdoc à l'Université de Varsovie avec Mikołaj Bojańczyk et à l'University Kaiserslautern-Landau avec Anthony W. Lin.

Plus de détails se trouvent sur mon CV .

NEWS

J'ai commencé en tant que MCF à l'Université Aix-Marseille en septembre !
J'ai été décerné l'un des prix Vicent Caselles 2026.
Je suis dans le PC de LICS 2027.

Links:

J'ai rassemblé quelques liens contenant des conseils sur différents aspects de la recherche ici (en anglais).

Je soutiens:

Recherche

La liste de mes publications se trouve aussi sur mon site dblp et Google Scholar.

Thèse de doctorat

Structural properties of automata over infinite words and memory for games, 2023, Université de Bordeaux - Manuscript of the thesis (pdf) - Bibtex - Slides

Ma thèse a été attribuée le prix "Sciences et technologies" de l'Université de Bordeaux! (lien)

Livres

Chapitre Positionality and Memory dans le livre Games on Graphs: From Logic and Automata to Algorithms (avec Pierre Ohlmann et Pierre Vandenhove) - arxiv link - bibtex of chapter.

Surveys

Transition-based vs stated-based acceptance for automata over infinite words. In: Bulletin EATCS, Oct 2025 - pdf.

Publications dans des journaux et conférences scientifiques

Layered automata: A canonical model for automata over inﬁnite words (with Christof Löding and Igor Walukiewicz). In: LICS 2026 - pdf.
Automata for MSO over Infinite Trees with Quantification over Borel Sets of Branches (with Mikołaj Bojańczyk, Sven Manthe and Paweł Parys). In: LICS 2026.
The memory of ω-regular and BC(Σ₂) objectives (with Pierre Ohlmann). In: ICALP 2025 - conf version - full version - bibtex.
Positional ω-regular languages (with Pierre Ohlmann). In: LICS 2024 & TheoretiCS (2026) - conf version - journal version - bibtex.
Fast value iteration: A uniform approach to efficient algorithms for energy games (with Michaël Cadilhac and Pierre Ohlmann). In: TACAS 2025 - pdf.
From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism (with Thomas Colcombet, Nathanaël Fijalkow and Karoliina Lehtinen). In: TheoretiCS (2024) - pdf - bibtex.
On the Minimisation of Deterministic and History-Deterministic Generalised (co)Büchi Automata (with Olivier Idir, Denis Kuperberg, Corto Mascle and Keya Prakash). In: CSL 2025 - pdf.
The Complexity of Simplifying ω-Automata through the Alternating Cycle Decomposition (with Corto Mascle). In: MFCS 2024 - short version - full version- bibtex.
Simple and Tight Complexity Lower Bounds for Solving Rabin Games (with Marcin Pilipczuk, Michał Pilipczuk, Uéverton S. Souza, K. S. Thejaswini). In: SOSA 2024 - pdf - bibtex.
Characterising Memory in Infinite Games (with Pierre Ohlmann). In: ICALP 2023 & LMCS (2025) - journal version - conf version - bibtex.
Half-Positional Objectives Recognized by Deterministic Büchi Automata (with Patricia Bouyer, Mickael Randour and Pierre Vandenhove). In: CONCUR 2022 & IJCAI 2023 & LMCS (2024) - journal version - conf version - extended abstract - bibtex.
On the Size of Good-For-Games Rabin Automata and Its Link with the Memory in Muller Games (with Thomas Colcombet and Karoliina Lehtinen). In: ICALP 2022 - pdf - bibtex.
Practical Applications of the Alternating Cycle Decomposition (with Alexandre Duret-Lutz, Klara J. Meyer, Florian Renkin and Salomon Sickert). In: TACAS 2022 - full version - bibtex.
On the Minimisation of Transition-Based Rabin Automata and the Chromatic Memory Requirements of Muller Conditions. In: CSL 2022 - short version - full version - bibtex. Best Student Paper Award.
Optimal Transformations of Games and Automata using Muller Conditions (with Thomas Colcombet and Nathanaël Fijalkow). In: ICALP 2021 - conf version - journal version - bibtex.

Preprints

History-Deterministic Büchi Automata are Succinct (with Keya Prakash and K.S Thejaswini). Submitted to: ICALP 2027 - pdf.
Infinite lexicographic products of positional objectives (with Pierre Ohlmann, Michał Skrzypczak and Igor Walukiewicz). Submitted to: LMCS - pdf.
A positional Π₃⁰-complete objective (with Pierre Ohlmann and Pierre Vandenhove), 2024 - pdf - bibtex.

Exposés

Quelques slides et ressources

Layered Automata: A Canonical Model for ω-Regular Languages - pdf - animated slides.
An Automata Model for Borel-MSO - pdf - animations.
How to write a good introduction - animated slides.
State-Based vs Transition-Based Acceptance in ω-Automata - animated slides - video (youtube).
Fast Value Iteration: A Uniform Framework for Energy Games - animated slides.
Safety and Liveness. Some thoughts - animated slides.
Canonical Models of Automata - animated slides.
The Memory of ω-Regular Languages - short version - long version.
Positional ω-Regular Languages - old slides - poster.
Simplifying ω-Automata through the Alternating Cycle Decomposition - slides.
Minimisation of (History) Deterministic Generalised (co)Büchi Automata - slides.
Half-Positional Objectives Recognized by Deterministic Büchi Automata - slides.
On a Correspondence Between Memory Structures for Muller Games and Rabin Automata.- slides.
Good-For-Games Rabin Automata and the Memory Requirements of Muller Conditions.- slides- poster.
Minimisation of Transition-Based Rabin Automata - slides - poster.
Optimal Transformations of Games and Automata using Muller Conditions - slides.
Open Problem: Memory Requirements for Generalised Reachability games - poster.
Can we program without while loops? - slides - ancienne version en Espagnol - video youtube.
Lógica y juegos para la verificación formal (in Spanish) - animated slides.

Encadrement d'étudiants (2024-2025)

Émilie Neyraud (ENS Lyon-RPTU, 2026). M1 internship on: Boolean operations on layered automata.
Kacper Lewandowski (University of Warsaw, 2025) Master thesis on: History-deterministic coBüchi automata.
Alan Le Brech (ENS Rennes, 2025). M1 internship on: Universal value-iteration algorithms for games on graphs.

Enseignement

2026, Summer semester (RPTU, University Kaiserslautern-Landau)

Automated Reasoning (Master course. Lectures on CDCL, Presburger and real arithmetic, the simplex method).

2023 - 2024 (University of Warsaw)

Algorithmic Aspects of Game Theory (Tutorials and some lectures).

Contact

E-mail
antonio.casares [at] lis-lab [dot] fr

Adresse
Bâtiment TPR2, Bureau 05.09 Laboratoire d'Informatique et Systèmes 163 avenue de Luminy - F-13288 Marseille Cedex 9