16 citations · 43 across the 10 of their papers we have counts for
11 papers
A Necessary Condition for Byzantine -Set Agreement
Zohir Bouzid, Damien Imbs, Michel Raynal
This short paper presents a necessary condition for Byzantine -set agreement in (synchronous or asynchronous) message-passing systems and asynchronous shared memory systems wher…
Anonymous Obstruction-free -Set Agreement with Atomic Read/Write Registers
Zohir Bouzid, Michel Raynal, Pierre Sutra
The -set agreement problem is a generalization of the consensus problem. Namely, assuming each process proposes a value, each non-faulty process has to decide a value such that…
Strong Equivalence Relations for Iterated Models
Zohir Bouzid, Eli Gafni, Petr Kuznetsov
The Iterated Immediate Snapshot model (IIS), due to its elegant geometrical representation, has become standard for applying topological reasoning to distributed computing. Its mod…
Certified Impossibility Results for Byzantine-Tolerant Mobile Robots
Cédric Auger, Zohir Bouzid, Pierre Courtieu +2
We propose a framework to build formal developments for robot networks using the COQ proof assistant, to state and to prove formally various properties. We focus in this paper on i…
Wait-Free Gathering of Mobile Robots
Zohir Bouzid, Shantanu Das, Sébastien Tixeuil
The problem of gathering multiple mobile robots to a single location, is one of the fundamental problems in distributed coordination between autonomous robots. The problem has been…
The BG-simulation for Byzantine Mobile Robots
Taisuke Izumi, Zohir Bouzid, Sébastien Tixeuil +1
This paper investigates the task solvability of mobile robot systems subject to Byzantine faults. We first consider the gathering problem, which requires all robots to meet in fini…