On formulations of firing squad synchronization problems

Authors:
Kojiro Kobayashi;Darin Goldstein
Affiliations:
Department of Information Systems Science, Faculty of Engineering, Soka University, Hachioji-shi, Tokyo, Japan;Department of Computer Engineering and Computer Science, California State University, Long Beach
Venue:
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Year:
2005

Citing 9
Cited 2

An overview of the firing squad synchronization problem

Proceedings on LITP spring school on Theoretical Computer Science on Automata networks
Variations of the firing squad problem and applications

Information Processing Letters
Faster computation on directed networks of automata

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Firing squad synchronization problem in reversible cellular automata

Theoretical Computer Science
Computing with snakes in directed networks of automata

Journal of Algorithms
On time optimal solutions of the firing squad synchronization problem for two-dimensional paths

Theoretical Computer Science
The wake up and report problem is time-equivalent to the firing squad synchronization problem

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Bounding the firing synchronization problem on a ring

Theoretical Computer Science
Sequential Machines: Selected Papers

Sequential Machines: Selected Papers

Synchronization in P modules

UC'10 Proceedings of the 9th international conference on Unconventional computation
Faster synchronization in P systems

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

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.