In this paper, we introduce the notion of snapstabilization. A snap-stabilizing algorithm protocol gua rantees that, starting from an arbitrary system configuratio n, the protocol always behaves… (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… (More)
The contribution of this paper is threefold. First, we present the paradigm of snap-stabilization. A snap- stabilizing protocol guarantees that, starting from an arbitrary system configuration, the… (More)
In this paper, we investigate the possibility to deterministically solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, deaf and dumb, and oblivious). We introduce… (More)
A snap-stabilizingprotocol guarantees that the system always behaves accordi ng to its specification provided some processor initiated the protocol. We present how to sna pt bilize some important… (More)
We consider a team of k identical, oblivious, 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.… (More)
A Lyndon word is a non-empty word strictly smaller in the lexicographic order than any of its suffixes, except itself and the empty word. In this paper, we show how Lyndon words can be used in the… (More)
We consider a team of k identical, oblivious, asynchronous mobile robots that are able to sense (i.e., view) their environment, yet are unable to communicate, and evolve on a constrained path.… (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… (More)