Next meeting
Webpage of the GT Informel Seminar series: here
Contact: Laurent Doyen
Webpage of the GT Informel Seminar series: here
We are interested in the foundations of computation. Formal models of computation include classes of languages and machines such as finite automata, games, pushdown and counter systems, weighted automata, (continuous) timed systems, stochastic processes. We identify and study fundamental properties of these models, such as expressiveness, computational complexity, succinctness, equivalence among different models.
We embed our study into rigorous mathematical framework rooted with formal logic, and develop algorithmic procedures, either to prove the correctness of a model, or to provide a counter-example. We develop decision procedures for solving fundamental questions related to the models and logics (satisfiability, realizability, optimization) and provide complexity lower and upper bounds (time and space).
Our goal is to provide efficient techniques and tools to automate and optimize the design of systems (software, circuits, etc.). We seek to establish the correctness of systems through the approaches of verification, diagnosis, learning, control, and synthesis. Furthermore, we develop quantitative approaches to optimize the quality of designed systems.
Full list of publications: https://hal.science/LMF-MCS
Better Synthesis for Quantitative Underspecified Systems
ANR
2023-2027
Méthodes d'Analyse pour la Vérification de propriétés Quantitatives
ANR
2021 - 2025
Non-Aggregative Resource COmpositions
ANR
2022 - 2026
New Challenges for Recurrent Neural Networks and Grammatical Inference
CampusFrance & DAAD
Since 2020
Indo-French Research Lab
Since 2017
Argentino-French Research Lab
Since 2019