6 papers
Hardwired Pattern Formation by Mobile Robots with Common Unit Distance
Yuta Kojima, Sébastien Tixeuil, Yukiko Yamauchi
The pattern formation (PTF) problem requires mobile robots to form a specified target pattern. Existing papers investigated the PTF problem and revealed the effect of obliviousness…
On the Solvability of Byzantine-tolerant Reliable Communication in Dynamic Networks
Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil
A reliable communication primitive guarantees the delivery, integrity, and authorship of messages exchanged between correct processes of a distributed system. We investigate the ne…
Tight Bounds on Window Size and Time for Single-Agent Graph Exploration under T-Interval Connectivity
Yuichi Sudo, Naoki Kitamura, Masahiro Shibata +4
We study deterministic exploration by a single agent in -interval-connected graphs, a standard model of dynamic networks in which, for every time window of length , the inter…
The Price of Universal Temporal Reachability
Binh-Minh Bui-Xuan, Nhat-Minh Nguyen, Sébastien Tixeuil +1
Dynamic networks are graphs in which edges are available only at specific time instants, modeling connections that change over time. The dynamic network creation game studies this…
A New Probabilistic Mobile Byzantine Failure Model for Self-Protecting Systems
Silvia Bonomi, Giovanni Farina, Roy Friedman +2
Modern distributed systems face growing security threats, as attackers continuously enhance their skills and vulnerabilities span across the entire system stack, from hardware to t…
Deterministic Self-Stabilizing BFS Construction in Constant Space
Lélia Blin, Franck Petit, Sébastien Tixeuil
In this paper, we resolve a long-standing question in self-stabilization by demonstrating that it is indeed possible to construct a spanning tree in a semi-uniform network using co…