Recherche
I am interested in verification of distributed systems with an unbounded number of agents running the same finite-state program. These include systems
Making synchronous algorithms efficiently self-stabilizing in arbitrary asynchronous environments (continued) This paper deals with the trade-off
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
/Exposé en français/Talk in french / Transparents en anglais/English slides/ In this talk, I will given a rather simple construction of a graph U n
We present algorithms for model checking and controller synthesis of timed automata, seeing a timed automaton model as a parallel composition of a
/Exposé /Talk/ A seminal result of Komlos, Sarkozy and Szemeredi proves that for any \Delta and \alpha, any graph G with minimum degree (1/2+\alpha)n
/Exposé en anglais/Talk in english/ *A tight local algorithm for the minimum dominating set problem in outerplanar graphs* We present a deterministic