Recherche

/Exposé en anglais/Talk in english/ Let G be a bridgeless cubic graph. The Berge-Fulkerson Conjecture (1970s) states that G admits a list of six

Linear Temporal Logic (LTL) is one of the most common formalisms for expressing properties of systems in formal verification and other fields. However

Sébastien Bouchard, LaBRI Titre: Byzantine gathering in polynomial time. Abstract: Gathering is a key task in distributed and mobile systems, which

In this presentation, I will focus on two classes of games showing quantum computational advantage: XOR nonlocal games and XOR* sequential games with

Alternating timed automata (ATA) are an extension of timed automata where the effect of each transition is described by a positive boolean combination

In the first paper of the Graph Minors series [JCTB ’83], Robertson and Seymour proved the Forest Minor theorem: the H-minor-free graphs have bounded

Fabien Lotte est lauréat 2022 du prix USERN (Universal Scientific Education and Research Network) dans la catégorie "Formal Science", pour son projet

Petri nets constitute a well-studied model to verify and study concurrent systems, among others, and computing the coverability set is one of the most

/Exposé /Talk/ Recent developments in the intersection of structural graph theory, parameterized algorithms, and finite model theory have provided

/Exposé en anglais/Talk in english/ We consider an edge version of the famous (and hard) degree-diameter problem, where one is wondering about the