Learn More
We propose a general self-stabilizing scheme for solving any synchronization problem whose safety specification can be defined using a local property. We demonstrate the versatility of our scheme by showing that very memory-efficient solutions to many well-known problems (e.g., asynchronous phase clock, local mutual exclusion, local reader-writers, and(More)
We consider a team of k identical, oblivious, and semi-synchronous mobile robots that are able to sense (i.e., view) their environment, yet are unable to communicate, and evolve on a constrained path. Previous results in this weak scenario show that initial symmetry yields high lower bounds when problems are to be solved by deterministic robots. In this(More)
Proteasomes have been purified from sunflower hypocotyles. They elute with a molecular mass of 600 kDa from gel filtration columns and two-dimensional gel electrophoresis indicates that the complex contains at least 20 different protein subunits. Peptide microsequencing revealed the presence of four subunits homologous to subunits Beta2, Beta6, Alpha5 and(More)
In this paper, we introduce the notion of snap-stabilization. A snap-stabilizing algorithm protocol guarantees that, starting from an arbitrary system configuration, the protocol always behaves according to its specification. So, a snap-stabilizing protocol is a self-stabilizing protocol which stabilizes in 0 steps. We propose a snap-stabilizing Propagation(More)
In this paper, we investigate the possibility to deterministi-cally solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, deaf and dumb, and oblivious). We introduce strong multiplicity detection as the ability for the robots to detect the exact number of robots located at a given position. We show that with strong(More)
Leader election and arbitrary pattern formation are fundammental tasks for a set of autonomous mobile robots. The former consists in distinguishing a unique robot, called the leader. The latter aims in arranging the robots in the plane to form any given pattern. The solvability of both these tasks turns out to be necessary in order to achieve more complex(More)
The group mutual exclusion (GME) problem deals with sharing a set of (Ñ) mutually exclusive resources among all (Ò) processes of a network. Processes are allowed to be in a critical section simultaneously provided they request the same resource. We present three group mutual exclusion solutions for tree networks. All three solutions do not use process(More)
We present a deterministic distributed Propagation of Information with Feedback (PIF) protocol in arbitrary rooted networks. The proposed algorithm does not use a pre-constructed spanning tree. The protocol is self-stabilizing, meaning that starting from an arbitrary state (in response to an arbitrary perturbation modifying the memory state), it is(More)