BNeDiction (2021-2025, funded by ANR)
The project aims at providing a general methodology for making predictions from data on systems structure and dynamics by the means of ensembles of Boolean networks.
The project aims at providing a general methodology for making predictions from data on systems structure and dynamics by the means of ensembles of Boolean networks.
Develop a digital infrastructure for intelligent transport systems and autonomous transportation.
Efficient Techniques and Tools for the Verification and Synthesis of Real-Time Systems.
Orbites des systèmes dynamiques discrets en informatique.
Spécification et vérification des algorithmes de décision publique pour établir la concordance entre le code et la loi
Collaboration IIT Bangalore and IIT Goa (India) on the verification of control algorithms that evolve according to their environment.
A model-checking tool for the AltaRica language.
Learning techniques for program synthesis.
A set of ANSI C libraries related to Presburger Arithmetic and a small solver program.
An extensible model-checker for real-time systems.
Accessible and reproducible computational analyses of qualitative models of biological networks.
Static analyzer for reachability in discrete automata networks.
MC U. Bordeaux
MC U. Bordeaux
PhD student
PhD student
MC U. Bordeaux
CR CNRS
MC U. Bordeaux
CR CNRS
MC Bordeaux INP
MC U. Bordeaux
MC Bordeaux INP, head
PhD student
PhD student
MC (HDR) Bordeaux INP
PhD student
DR CNRS
PhD student
PhD student
PhD student
PR Bordeaux INP
PR U. Bordeaux
CR (HDR) CNRS
MC U. Bordeaux
IR CNRS
MC (HDR) Bordeaux INP
CR CNRS
DR CNRS
DR CNRS
PR U. Bordeaux
The MTV group meeting happens at 13:00. Please, refer to the shared calendar for the meeting room. Most group meetings can be attended online on Zoom.
27/06/2024 | ||
13/06/2024 | ||
30/05/2024 | ||
16/05/2024 | ||
11/04/2024 | ||
28/03/2024 | ||
14/03/2024 | ||
15/02/2024 | ||
01/02/2024 | ||
18/01/2024 | ||
21/12/2023 | ||
07/12/2023 | ||
23/11/2023 | ||
09/11/2023 | ||
19/10/2023 | ||
28/09/2023 | Loïc Paulevé (LaBRI) | Tackling Universal Properties of Minimal Trap Spaces of Boolean Networks |
14/09/2023 | Jérôme Leroux (LaBRI) | The Semilinear Home-Space Problem is Ackermann-Complete for Petri Nets |
22/06/2023 | Dylan Marinho (LORIA) | Ensuring opacity in timed systems |
08/06/2023 | Corto Mascle (LaBRI) | Parameterized Broadcast Networks with Registers |
25/05/2023 | Chana Weil-Kennedy (IMDEA) | Observation Petri Nets |
13/04/2023 | Théo Matricon (LaBRI) | Language Sharpening for Program Synthesis |
02/03/2023 | Pierre Vandenhove (U. Mons) | Memory Requirements of Omega-Regular Objectives: the Regular Case |
26/01/2023 | Celia Biane (IRISA) | Réseaux biologiques : des systèmes dynamiques Booléens à la neuroscience expérimentale |
12/01/2023 | Mikhail Raskin (LaBRI) | Getting readable proofs for replicated systems from automated provers |
15/12/2022 | Group discussion | ChatGPT, proof and reasoning |
01/12/2022 | Léon Bohm | Learning algorithms for ω-automata |
17/11/2022 | Group meeting | |
28/10/2022 | Jérôme Leroux (LaBRI) | State Complexity of Protocols with Leaders |
22/09/2022 | Sara Riva (U. Côte d'Azur) | Hypotheses and Equations on Discrete Dynamical Systems |
08/09/2022 | Srivathsan B (CMI Chennai) | Simulations for event-clock automata |
07/07/2022 | Nicolas Amat (IRIT) | What is Polyhedral Reduction? ... and how we use it to accelerate the verification of reachability problems. |
30/06/2022 | Pierre Civit (LIP6) | Dynamic Probabilistic Automata |
16/06/2022 | Emmanuelle Saillard (INRIA Bordeaux) | PARCOACH, a tool that combines static and dynamic analyses to detect misuse of MPI communications |
02/06/2022 | Frédéric Herbreteau (LaBRI) | Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods |
07/04/2022 | Samuel Pastva (U Brno) | Finding SCCs in many systems at once using symbolic algorithms |
10/03/2022 | Hugo Gimbert (LaBRI) | Distributed Asynchronous Games With Causal Memory are Undecidable |
17/02/2022 | Abdelhakim Baouya (Verimag) | Artificial Intelligence meets Formal Methods: Generation and verification of learned stochastic automata |
14/02/2022 | Charles Grellois (LIS) | Verification of (probabilistic) functional programs |
03/02/2022 | Damien Busatto-Gaston (ULB) | On the strategy synthesis problem in MDPs: probabilistic CTL and rolling windows |
06/01/2022 | Laure Petrucci (LIPN) | Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed Automata |
09/12/2021 | Benedikt Bollig (LMF) | Synthesis in Presence of Dynamic Links |
25/11/2021 | Benoît Delahaye (LS2N) | Vérification formelle et statistique de modèles paramétriques |
28/10/2021 | Corto Mascle (LaBRI) | Responsibility and verification: Importance value in temporal logics |
14/10/2021 | Nathanaël Fijalkow (LaBRI) | Learning LTL formulas |
30/09/2021 at 14:00!!! | Anirban Majumdar (LMF) | PhD defense "Verification and Synthesis of Parameterized Concurrent Systems" (see framacal for visio info) |
01/07/2021 | Arnaud Sangnier (IRIF) | Reachability in Distributed Memory Automata |
24/06/2021 | Aïda Ibrahim (LaBRI) | spécification et la vérification du code informatique de Tachygraphe |
17/06/2021 | Igor Khmelnitsky (LMF) | Minimal coverability tree construction made complete and efficient |
29/04/2021 | Jérôme Leroux (LaBRI) | Flat Petri Nets |
11/03/2021 | Loïc Paulevé (LaBRI) | Semantics, verification, synthesis and control of Boolean automata networks |
25/02/2021 | Igor Walukiewicz (LaBRI) | Partial-order reductions |