The synchronization of nonuniform networks of finite automata

The generalized firing squad synchronization problem (GFSSP) is the well-known firing squad synchronization problem extended to arbitrarily connected networks of finite automata. When the transmission delays associated with the links of a network are allowed to be arbitrary nonnegative integers, the problem is called GFSSP-NUD (GFSSP with nonuniform delays). A solution of GFSSP-NUD is given for the first time. The solution is independent of the structure of the network and the actual delays of the links. The firing time of the solution is bounded by O( Delta /sup 3/+ tau /sub max/), where tau /sub max/ is the maximum transmission delay of any single link and Delta is the maximum transmission delay between the general and any other node of a given network. Extensions of GFSSP and GFSSP-NUD to networks with more than one general are presented.<<ETX>>

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

[2]  Yasuaki Nishitani,et al.  The Firing Squad Synchronization Problem for Graphs , 1977, Theor. Comput. Sci..

[3]  Helge Szwerinski.  Time-Optimal Solution of the Firing-Squad-Synchronization-Problem for n-Dimensional Rectangles with the General at an Arbitrary Position , 1982, Theor. Comput. Sci..

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

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

[6]  Karel Culik.  Variations of the Firing Squad Problem and Applications , 1989, Inf. Process. Lett..

[7]  Francesco Romani,et al.  The Parallelism Principle: Speeding Up the Cellular Automata Synchronization , 1978, Inf. Control..

[8]  Kojiro Kobayashi,et al.  The Firing Squad Synchronization Problem for a Class of Polyautomata Networks , 1978, J. Comput. Syst. Sci..

[9]  Jacques Mazoyer,et al.  An Overview of the Firing Squad Synchronization Problem , 1986, Automata Networks.

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

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

[12]  Kojiro Kobayashi,et al.  The Firing Squad Synchronization Problem for Two-Dimensional Arrays , 1977, Inf. Control..

[13]  Francesco Romani.  Cellular automata synchronization , 1976 .

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

[15]  Kojiro Kobayashi,et al.  On the Minimal Firing Time of the Firing Squad Synchronization Problem for Polyautomata Networks , 1978, Theor. Comput. Sci..