Abstract
Firing Squad Synchronization Problems are well known to be solvable by voluminous transition tables describing signals traveling and colliding. In this paper, we show that it is possible to solve it by expressing directly the fact that we want a recursive division of the space into two parts of equal size, and a notification when no further division is possible. Using fields – objects associating a value to every point in space and time – as primitive objects, the solution is designed algorithmically by a semantically-intuitive decomposition of the global evolution into simpler evolutions.
The system we obtain has several interesting characteristics : it is understandable, time-optimal, tackles many initial configurations, and allows a new interpretation of the traditional signals and collisions point of view. We will quickly sketch how we can obtain a finite state automaton by reduction of the system using the Lipschitz-continuity of involved fields, and a kind of tail-recursivity property of the dependencies.
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
Culik, K.: Variations of the firing squad problem and applications. Information Processing Letters 30, 153–157 (1989)
Goto, E.: A minimum time solution of the firing squad synchronization problem. Courses Notes for Applied Mathematics, vol. 298. Harvard University (1962)
Grasselli, A.: Synchronization of cellular arrays: The firing squad problem in two dimensions. Information and Control 28, 113–124 (1975)
Herman, G.T., Liu, W., Rowland, S., Walker, A.: Synchronization of growing cellular automata. Information and Control 25, 103–122 (1974)
Jiang, T.: The synchronization of nonuniform networks of finite automata. Information and Control 97, 234–261 (1992)
Kobayashi, K.: The firing squad synchronisation problem for two-dimensional arrays. Information and Control 34, 177–197 (1977)
Maignan, L., Gruau, F.: Integer gradient for cellular automata: Principle and examples. In: Proceedings of the 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops, pp. 321–325. IEEE Computer Society, Washington, DC (2008)
Maignan, L., Gruau, F.: A 1D cellular automaton that moves particles until regular spatial placement. Parallel Processing Letters 19(2), 315–331 (2009)
Maignan, L., Gruau, F.: Convex Hulls on Cellular Automata. In: Bandini, S., Manzoni, S., Umeo, H., Vizzari, G. (eds.) ACRI 2010. LNCS, vol. 6350, pp. 69–78. Springer, Heidelberg (2010)
Maignan, L., Gruau, F.: Gabriel graphs in arbitrary metric space and their cellular automaton for many grids. ACM Trans. Auton. Adapt. Syst. 6, 12:1–12:14 (June 2011)
Mazoyer, J.: A six states minimal time solution to the firing squad synchronization problem. Theoretical Computer Science 50, 183–238 (1987)
Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall (1967)
Moore, E.E.: Sequential machines, Selected papers. Addison-Wesley (1964)
Noguchi, K.: Simple 8-state minimal time solution to the firing squad synchronization problem. TCS 314, 303–334 (2004)
Rosenstiehl, P., Fiskel, J.R., Holliger, A.: Intelligent Graphs: Networks of Finite Automata capable of Solving Graph Problems. In: Read, R.C. (ed.) Graph Theory and Computing. Academic Press (1972)
Schmid, H., Worsch, T.: The firing squad synchronization problem with many generals for one-dimensional CA. In: Lévy, J.-J., Mayr, E.W., Mitchell, J.C. (eds.) IFIP TCS, pp. 111–124. Kluwer (2004)
Shinahr, I.: Two and three dimensional firing squad synchronization problems. Information and Control 24, 163–180 (1974)
Szwerinski, H.: Time-optimal solution of the firing-squad synchronization problem for n-dimensional rectangles with the general at an arbitrary position. Theoretical Computer Science 19, 305–320 (1982)
Varshavsky, V.I., Marakhovsky, V.B., Peshansky, V.A.: Synchronization of interacting automata. Mathematical System Theory 4(3), 212–230 (1969)
Yunès, J.-B.: An intrinsically non minimal-time Minsky-like 6-states solution to the firing squad synchronization problem. RAIRO ITA/TIA 42(1), 55–66 (2008)
Yunès, J.-B.: Known CA synchronizers made insensitive to the initial state of the initiator. JCA 4(2), 147–158 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maignan, L., Yunès, JB. (2012). A Spatio-temporal Algorithmic Point of View on Firing Squad Synchronisation Problem. In: Sirakoulis, G.C., Bandini, S. (eds) Cellular Automata. ACRI 2012. Lecture Notes in Computer Science, vol 7495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33350-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-33350-7_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33349-1
Online ISBN: 978-3-642-33350-7
eBook Packages: Computer ScienceComputer Science (R0)