Abstract
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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Balzer, R.: An 8-state minimal time solution to the firing squad synchronization problem. Information and Control 10, 22–42 (1967)
Berthiaume, A., Bittner, T., Perković, L., Settle, A., Simon, J.: Bounding the firing synchronization problem on a ring. Theoretical Computer Science 320, 213–228 (2004)
Culik, K.: Variations of the firing squad problem and applications. Information Processing Letters 30, 153–157 (1989)
Even, S., Litman, A., Winkler, P.: Computing with snakes in directed networks of automata. J. Algorithms 24(1), 158–170 (1997)
Goldstein, D., Kobayashi, K.: On the complexity of network synchronization. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 496–507. Springer, Heidelberg (2004)
Goldstein, D., Meyer, N.: The wake up and report problem is asymptotically time-equivalent to the firing squad synchronization problem. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, January 6-8, pp. 578–587 (2002)
Goto, E.: A minimal time solution of the firing squad problem. In: Course Notes for Applied Mathematics, vol. 298, pp. 52–59. Harvard University, Cambridge (1962)
Imai, K., Morita, K.: Firing squad synchronization problem in reversible cellular automata. Theoretical Computer Science 165, 475–482 (1996)
Kobayashi, K.: The firing squad synchronization problem for a class of polyautomata networks. J. Comput. Systems Sci. 17(3), 300–318 (1978)
Kobayashi, K.: A minimal time solution to the firing squad synchronization problem of rings with one-way information flow. Tokyo Institute of Technology, Department of Information Sciences, Research Reports on Information Sciences, No. C-8 (September 1976)
Kobayashi, K.: On time optimal solutions of the firing squad synchronization problem for two-dimensional paths. Theoretical Computer Science 259, 129–143 (2001)
LaTorre, S., Napoli, M., Parente, M.: Synchronization of one-way connected processors. Complex Systems 10, 239–255 (1996)
Mazoyer, J.: An overview of the firing squad synchronization problem. In: Choffrut, C. (ed.) LITP 1986. LNCS, vol. 316, pp. 82–94. Springer, Heidelberg (1986)
Moore, E.F.: Sequential Machines, Selected Papers. Addison Wesley, Reading (1962)
Moore, F.R., Langdon, G.G.: A generalized firing squad problem. Information and Control 12, 212–220 (1968)
Nishitani, Y., Honda, N.: The firing squad synchronization problem for graphs. Theoretical Computer Science 14(1), 39–61 (1981)
Ostrovsky, R., Wilkerson, D.: Faster computation on directed networks of automata. In: Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, Ottawa, Ontario, Canada, August 2-23, pp. 38–46 (1995)
Schmid, H., Worsch, T.: The firing squad synchronization problem with many generals for one-dimensional CA. In: 3rd IFIP International Conference on Theoretical Computer Science, pp. 111–124 (2004)
Shinahr, I.: Two- and three-dimensional firing-squad synchronization problem. Information and Control 24, 163–180 (1974)
Waksman, A.: An optimum solution to the firing squad synchronization problem. Information and Control 9, 66–78 (1966)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kobayashi, K., Goldstein, D. (2005). On Formulations of Firing Squad Synchronization Problems. In: Calude, C.S., Dinneen, M.J., Păun, G., Pérez-Jímenez, M.J., Rozenberg, G. (eds) Unconventional Computation. UC 2005. Lecture Notes in Computer Science, vol 3699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560319_15
Download citation
DOI: https://doi.org/10.1007/11560319_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29100-8
Online ISBN: 978-3-540-32022-7
eBook Packages: Computer ScienceComputer Science (R0)