Fault-Tolerant and Self-stabilizing Mobile Robots Gathering: –Feasibility Study–
X Défago, M Gradinariu, S Messika… - … Symposium, DISC 2006 …, 2006 - Springer
Gathering is a fundamental coordination problem in cooperative mobile robotics. In short,
given a set of robots with arbitrary initial location and no initial agreement on a global …
given a set of robots with arbitrary initial location and no initial agreement on a global …
Probabilistic verification of Herman's self-stabilisation algorithm
Herman's self-stabilisation algorithm provides a simple randomised solution to the problem
of recovering from faults in an N-process token ring. However, a precise analysis of the …
of recovering from faults in an N-process token ring. However, a precise analysis of the …
Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
J Beauquier, M Gradinariu, C Johnen - Distributed Computing, 2007 - Springer
We present a randomized self-stabilizing leader election protocol and a randomized self-
stabilizing token circulation protocol under an arbitrary scheduler on anonymous and …
stabilizing token circulation protocol under an arbitrary scheduler on anonymous and …
Computing fault-containment times of self-stabilizing algorithms using lumped Markov chains
V Turau - Algorithms, 2018 - mdpi.com
The analysis of self-stabilizing algorithms is often limited to the worst case stabilization time
starting from an arbitrary state, ie, a state resulting from a sequence of faults. Considering …
starting from an arbitrary state, ie, a state resulting from a sequence of faults. Considering …
Computing with pavlovian populations
Population protocols have been introduced by Angluin et al. as a model of networks
consisting of very limited mobile agents that interact in pairs but with no control over their …
consisting of very limited mobile agents that interact in pairs but with no control over their …
Randomised and distributed methods for reliable peer-to-peer data communication in wireless ad hoc networks
HZ Chou, SC Wang, SY Kuo, IY Chen, SY Yuan - IET communications, 2007 - IET
Peer-to-peer (P2P) communications have attracted a great deal of attention from the network
research community in recent years. However, due to the fundamental limitations of wireless …
research community in recent years. However, due to the fundamental limitations of wireless …
A tighter bound for the self-stabilization time in Hermanʼs algorithm
A tighter bound for the self-stabilization time in Hermanʼs algorithm - ScienceDirect Skip to
main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …
main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …
On stabilization in Herman's algorithm
Herman's algorithm is a synchronous randomized protocol for achieving self-stabilization in
a token ring consisting of N processes. The interaction of tokens makes the dynamics of the …
a token ring consisting of N processes. The interaction of tokens makes the dynamics of the …
Three tokens in Herman's algorithm
Herman's algorithm is a synchronous randomized protocol for achieving self-stabilization in
a token ring consisting of N processes. The interaction of tokens makes the dynamics of the …
a token ring consisting of N processes. The interaction of tokens makes the dynamics of the …
Computing the fault-containment time of self-stabilizing algorithms using Markov chains and lumping
V Turau - Stabilization, Safety, and Security of Distributed …, 2017 - Springer
The analysis of self-stabilizing algorithms is in the vast majority of all cases limited to the
worst case stabilization time starting from an arbitrary configuration. Considering the fact that …
worst case stabilization time starting from an arbitrary configuration. Considering the fact that …