In a functional program, a function may take an argument that is itself... a function. When it comes to model-checking, that implies that the tree of
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
Any Physical Theory of Nature Must Be Boundlessly Multipartite Nonlocal [Note: no quantum background is needed to attend this talk] Quantum
[ICQ] Maxime Cautrès (LIG) Vertex-minor universal graphs for generating entangled quantum subsystems
We study the notion of k-stabilizer universal quantum state, that is, an n-qubit quantum state, such that it is possible to induce any stabilizer
(Uniquement en présentiel / Only offline, no online version) We introduce a limit theory for Latin squares, paralleling the recent limit theories of
Linear Temporal Logic (LTL) is one of the most common formalisms for expressing properties of systems in formal verification and other fields. However
/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
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