The synchronization in cellular automata has been known as the firing squad
synchronization problem (FSSP) since its development, in which it was originally proposed …

An existence or non-existence of five-state firing squad synchronization protocol has been a
longstanding and famous open problem for a long time. In this paper, we answer partially to …

Here we present a new non-recursive minimal-time solution to the Firing Squad
Synchronization Problem which does not use any recursive process. In 1962, E. Goto …

A synchronization problem in cellular automata has been known as the Firing Squad
Synchronization Problem (FSSP), where the FSSP gives a finite-state protocol for …

Synchronization of large-scale networks is an important and fundamental computing
primitive in parallel and distributed systems. The synchronization in cellular automata …

Abstract The Firing Squad Synchronization Problem (FSSP) is an old problem in theoretical
Computer Science concerned with the synchronization of identical automata on lines of …

The firing squad synchronization problem (FSSP) on cellular automata has been studied
extensively for more than fifty years, and a rich variety of synchronization algorithms has …

For almost all variations of the firing squad synchronization problem for elementary
geometric figures such as lines, rings, squares, rectangles, and cubes, minimal-time …

An existence or non-existence of five-state firing squad synchronization protocol has been a
long-standing, famous open problem for a long time. In this paper, we answer partially to this …

We present some elements of a new family of time-optimal solutions to a less restrictive firing
squad synchronization problem. These solutions are all built on top of some elementary …