论文信息 - Cellular automata synchronization

Cellular automata synchronization

The first part of this paper deals with the Firing Squad Synchronization problem extended to networks however connected. A new class of configurations called ''flower graphs'' is presented whose synchronization is useful to reduce synchronization time for any graph. The second part investigates the lower bounds for synchronization time from a theoretical point of view. Results are obtained that are valid for several classes of graphs.

Francesco Romani

[1] F. R. Moore,et al. A Generalized Firing Squad Problem , 1968, Inf. Control..

[2] Robert Balzer,et al. An 8-state Minimal Time Solution to the Firing Squad Synchronization Problem , 1967, Inf. Control..

[3] Pierre Rosenstiehl,et al. Existence d'automates finis capables de s'accorder bien qu'arbitrairement connectés et nombreux , 1966 .

[4] P. Rosenstiehl,et al. INTELLIGENT GRAPHS: NETWORKS OF FINITE AUTOMATA CAPABLE OF SOLVING GRAPH PROBLEMS , 1972 .

[5] Ilka Shinahr. Two- and Three-Dimensional Firing-Squad Synchronization Problems , 1974, Inf. Control..

[6] Adrian Walker,et al. Synchronization of Growing Cellular Arrays , 1974, Inf. Control..

[7] Abraham Waksman,et al. An Optimum Solution to the Firing Squad Synchronization Problem , 1966, Inf. Control..

[8] Antonio Grasselli,et al. Synchronization of Cellular Arrays: The Firing Squad Problem in Two Dimensions , 1975, Inf. Control..

[9] Gabor T. Herman,et al. Models for cellular interactions in development without polarity of individual cells II. Problems of synchronization and regulation , 1972 .