On Formulations of Firing Squad Synchronization Problems

We propose a novel formulation of the firing squad synchronization problem. In this formulation we may use more than one general state and the general state to be used is determined by the boundary condition of the general. We show that the usual formulation and the new formulation yield different minimum firing times for some variations of the problem. Our results suggest that the new formulation is more suited for the general theory of the firing squad synchronization problem.

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

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

[3]  Kojiro Kobayashi,et al.  On time optimal solutions of the firing squad synchronization problem for two-dimensional paths , 2001, Theor. Comput. Sci..

[4]  Ljubomir Perkovic,et al.  Bounding the firing synchronization problem on a ring , 2004, Theor. Comput. Sci..

[5]  Nick Meyer,et al.  The wake up and report problem is time-equivalent to the firing squad synchronization problem , 2002, SODA '02.

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

[7]  Margherita Napoli,et al.  Synchronization of One-way Connected Processors , 1996, Complex Syst..

[8]  Jacques Mazoyer,et al.  A Six-State Minimal Time Solution to the Firing Squad Synchronization Problem , 1987, Theor. Comput. Sci..

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

[10]  Daniel Shawcross Wilkerson,et al.  Faster computation on directed networks of automata , 1995, PODC '95.

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

[12]  E. F. Moore.  Sequential Machines: Selected Papers , 1964 .

[13]  Peter Winkler,et al.  Computing with snakes in directed networks of automata , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

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

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

[16]  Thomas Worsch,et al.  The Firing Squad Synchronization Problem with Many Generals For One-Dimensional CA , 2004, IFIP TCS.

[17]  Katsunobu Imai,et al.  Firing Squad Synchronization Problem in Reversible Cellular Automata , 1996, Theor. Comput. Sci..

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

[19]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.