Firing squad synchronization problem
Semantic Scholar uses AI to extract papers important to this topic.
We present some elements of a new family of time-optimal solutions to a less restrictive firing squad synchronization problem… (More)
- Int. J. Found. Comput. Sci.
It is well known that a solution for the Firing Squad Synchronization Problem (FSSP) takes time 2n — 1, n being the number of… (More)
The Firing Squad Synchronization Problem is one of the classical problems for cellular automata. In this paper we consider the… (More)
- Distributed Computing
We consider several problems relating to strongly-connected directed networks of identical finite-state processors that work… (More)
The one-dimensional firing squad synchronization problem (FSSP) is to construct a generic automaton of a one dimensional cellular… (More)
We studied the Firing Squad Synchronization Problem (FSSP) on reversible (i.e., backward deterministic) cellular automata (RCA… (More)
© Université de Lyon, 1986, tous droits réservés. L’accès aux archives de la série « Publications du Département de mathématiques… (More)
tn this paper, we give a solution of the Firing Squad Synchronization Problem for graphs. The synchronization *imes of solutions… (More)
For each class I’ of polyautomata networks (networks c:.xxposed of copies of a same finite automaton and connections from output… (More)
- Information and Control
A 16 state machine is proposed as an optimum solution to the "Firing Squad Synchronization Problem." It is shown that when given… (More)