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

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

Maslov’s class K-bar is a fragment of First-Order Logic consisting of formulae in NNF whose variables occurring in the different atoms obey a certain

We propose a model for recoverable robust optimization with commitment. Given a combinatorial optimization problem and uncertainty about elements that

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

/Exposé /Talk/ In this talk, we will introduce a novel cooperative game theory model designed to tackle a significant unresolved issue in operations