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
Verifying Liveness Properties under Weak Memory Models I will discuss verifying liveness properties for concurrent programs running on weak memory
Nils Morawietz (LaBRI) Title: A Parameterized-Complexity Framework for Finding Local Optima Abstract: Local search is a fundamental optimization
/Exposé /Talk/ In this talk, we will introduce a novel cooperative game theory model designed to tackle a significant unresolved issue in operations
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
ATTENTION: 10:45 Guillaume Lagarde (LaBRI) Title: Analyzing and Leveraging the k-Sensitivity of LZ77 Abstract: We study the sensitivity of the Lempel
We present deterministic suffix-reading automata (DSA), a new automaton model over finite words. Our motivation for this model comes from
Petra Wolf, «Kernelizing Temporal Exploration Problems» Abstract: We study the kernelization of exploration problems on temporal graphs. A temporal
In automated learning problems, the task is to find a model that maps given inputs to their corresponding outputs as accurately as possible. Over the