10 citations · 11 across the 7 of their papers we have counts for
8 papers
Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous
Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder
We consider networks of processes that all execute the same finite-state protocol and communicate via a rendez-vous mechanism. When a process requests a rendez-vous, another proces…
Games on Graphs: From Logic and Automata to Algorithms
Nathanaël Fijalkow, C. Aiswarya, Guy Avni +22
The objective of this book is to give a comprehensive presentation of the research field concerned with infinite duration games on graphs. Historically, these game models appeared…
Synthesis in Presence of Dynamic Links
Béatrice Bérard, Benedikt Bollig, Patricia Bouyer +2
The problem of distributed synthesis is to automatically generate a distributed algorithm, given a target communication network and a specification of the algorithm's correct behav…
Parameterized Verification of Algorithms for Oblivious Robots on a Ring
Arnaud Sangnier, Nathalie Sznajder, Maria Potop-Butucaru +1
We study verification problems for autonomous swarms of mobile robots that self-organize and cooperate to solve global objectives. In particular, we focus in this paper on the mode…
Real-Time Synthesis is Hard!
Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts +3
We study the reactive synthesis problem (RS) for specifications given in Metric Interval Temporal Logic (MITL). RS is known to be undecidable in a very general setting, but on infi…
Probabilistic Opacity for Markov Decision Processes
Béatrice Bérard, Krishnendu Chatterjee, Nathalie Sznajder
Opacity is a generic security property, that has been defined on (non probabilistic) transition systems and later on Markov chains with labels. For a secret predicate, given as a s…