Pôle Modèles Model Checking and Synthesis

Overview

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, and stochastic processes. We identify and study fundamental properties of these models, such as expressiveness, computational complexity, succinctness, or equivalence among different models.

We embed our study into a rigorous mathematical framework rooted in 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.

Members

Permanent

Emeritus

PhD Students

PostDoc

Publications

Full list of publications: https://hal.science/LMF-MCS

Recent Publications

Projects

Current

Past

Keywords