Antonio Casares Santos

Soy profesor asociado (maître de conférences) en informática teórica en la Universidad Aix-Marseille y en el LIS.

Mi investigación se centra en temas relacionados con la lógica y la teoría de lenguajes formales. Más en concreto, estudio propiedades de lenguajes definidos por ω-autómatas, así como algoritmos para la resolución de juegos de duración infinita sobre grafos y teoría de modelos finitos.

Previamente, obtuve mi doctorado por la Universidad de Burdeos en 2023, bajo la supervisión de Thomas Colcombet, Nathanaël Fijalkow e Igor Walukiewicz. Trabajé como postdoc en la Universidad de Varsovia con Mikołaj Bojańczyk y en la Universidad de Kaiserslautern-Landau con Anthony W. Lin.

Puedes consultar mi CV para más información.

NEWS

• He sido galardonado con uno de los Premios Vicent Caselles 2026.
• Soy miembro del comité de programa de la conferencia LICS 2027.

Enlaces:

He recopilado algunos enlaces con diferentes consejos sobre la vida académica aquí (en inglés).

Apoyo las siguientes iniciativas:

Investigación

La lista de mis publicaciones también se puede encontrar en mis páginas de dblp y Google Scholar.

Tesis doctoral

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

Capítulos de libros

• Capítulo Positionality and Memory en el libro Games on Graphs: From Logic and Automata to Algorithms (escrito con Pierre Ohlmann y 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.

Publicaciones en revistas y conferencias científicas

• Layered automata: A canonical model for automata over infinite 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.

Charlas

Algunas diapositivas y pósteres

• 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 - versión antigua - video youtube.
• Lógica y juegos para la verificación formal (in Spanish) - animated slides.

Supervisión de estudiantes de máster

• É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-Warsaw, 2025). M1 internship on: Universal value-iteration algorithms for games on graphs.

Docencia

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).

2022 - 2023 (ENSEIRB-MATMECA - Bordeaux INP)

• Programmation impérative 1 (Primer año, TP).
• Systèmes de Gestion de Bases de Données (Segundo año, TD-TP).

2021 - 2022 (Université de Bordeaux)

• Algorithmique des Tableaux (Licence 1, TD-TP).
• Modèles de la Programmation et du Calcul (Licence 3, TD).

2020 - 2021 (Université de Bordeaux)

• Coloration Informatique (Licence 1, TP).
• Modèles de la Programmation et du Calcul (Licence 3, TD).

Contacto

E-mail
antonio.casares [arroba] lis-lab [punto] fr

Dirección
Edificio TPR2, Despacho 05.09 Laboratoire d'Informatique et Systèmes 163 avenue de Luminy - F-13288 Marseille Cedex 9