Firing squad synchronization problem

Known as: FSSP, Firing squad (disambiguation), Firing squad problem 
The firing squad synchronization problem is a problem in computer science and cellular automata in which the goal is to design a cellular automaton… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1966-2017
010203019662017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
We present some elements of a new family of time-optimal solutions to a less restrictive firing squad synchronization problem… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
Is this relevant?
2007
2007
It is well known that a solution for the Firing Squad Synchronization Problem (FSSP) takes time 2n — 1, n being the number of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
The Firing Squad Synchronization Problem is one of the classical problems for cellular automata. In this paper we consider the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2002
2002
We consider several problems relating to strongly-connected directed networks of identical finite-state processors that work… (More)
  • figure 1
  • figure 2
Is this relevant?
1996
1996
The one-dimensional firing squad synchronization problem (FSSP) is to construct a generic automaton of a one dimensional cellular… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1996
1996
We studied the Firing Squad Synchronization Problem (FSSP) on reversible (i.e., backward deterministic) cellular automata (RCA… (More)
  • table 1
  • figure 1
Is this relevant?
Highly Cited
1987
Highly Cited
1987
© 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)
  • figure 1.7
  • figure 2.2
  • figure 3.2
  • figure 3.4
  • figure 4.2
Is this relevant?
1981
1981
tn this paper, we give a solution of the Firing Squad Synchronization Problem for graphs. The synchronization *imes of solutions… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
1978
1978
For each class I’ of polyautomata networks (networks c:.xxposed of copies of a same finite automaton and connections from output… (More)
  • figure 5
  • figure 6
  • figure 7
  • figure 8
  • figure 9
Is this relevant?
Highly Cited
1966
Highly Cited
1966
A 16 state machine is proposed as an optimum solution to the "Firing Squad Synchronization Problem." It is shown that when given… (More)
Is this relevant?