An Optimum Solution to the Firing Squad Synchronization Problem


A 16 state machine is proposed as an optimum solution to the "Firing Squad Synchronization Problem." It is shown that when given an arbitrarily long (but finite) array of such machines and a command is given at one end at t = 0, it is possible to cause all the machines to go to one terminal state, all at once, at time t = 2n -2 where n is the number of… (More)
DOI: 10.1016/S0019-9958(66)90110-0