Recherche

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

Given a relational specification \varphi(X, Y_1, ... Y_n), Boolean functional synthesis concerns the construction of Boolean functions F_1(X), ... F_n

On the Compressibility of Real Numbers: Certain insights using Fourier analytic methods Subin Pulari (post-doc M2F) Abstract: Measuring the

Decision problems for finitely generated groups: overview and perspectives I will present a historical account of the study of computability on

Mouna Safir (ENS Lyon) Title: Self-Stabilizing Mutual Exclusion in Dynamic Networks with Bounded Temporal Diameter Abstract: We consider distributed

Colette Johnen (LaBRI) Title: From Static Stabilization to Dynamic Stabilization in case of bounded recurrent edges Abstract: We consider the problem

We present deterministic suffix-reading automata (DSA), a new automaton model over finite words. Our motivation for this model comes from