Synchronization of a line of finite automata with nonuniform delays
Résumé
We study the Firing Squad Synchronization Problem with non uniform delays in the case of a line of cells. The problem was solved in the general case by T.~Jiang in time Delta^3. In the case of the line, we improve his result, obtaining the Delta^2. We observe that there does not exist an optimal solution. We also note that the strategy, used here, is the general strategy (Waksman's one) and thus, even in this case, we can break the line in its middle.
Domaines
Informatique [cs]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...