Franck Petit

Learn More
In this paper, we introduce the notion of snapstabilization. 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)
The mutual exclusion and concurrency are among the fundamental problems of distributed systems. The mutual exclusion ensures an exclusive access to a shared resource among a set of processes. The concurrency allows some processes to share a resource. The group mutual exclusion (GME) problem [1] deals with both mutual exclusion and concurrency. The GME(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)
The 20S proteasome (prosome) is a highly organized multiprotein complex with approximate molecular weight of about 700 kDa. Whilst the role of the proteasome in the processing and turnover of cellular proteins is becoming clearer, its relationship with RNA remains still obscure. Here we focus on the nature and function of proteasome associated endonuclease(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 distributed control of a set of n weak mobile robots. By weak, we mean that the robots are anonymous, memoryless, without any common sense of direction, and(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 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)
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)