The Byzantine Firing Squad Problem.
Jeremy Burns, N. Lynch · 1985
NOTES 19. KEY V OROS (Contfnuae on reverse aid* ifneceseary end Identify by block number)Agreement, Byzantine generals problem, Firing squad problem. ABST R ACT (Continue an reverse oid it necesary and identity by block number)A new problem, the Byzantine Firing Squad problem, is defined and solved in two versions, Permissive and Strict.Both problems provide for synchronisation of iaitially unsynchronised processors in a synchronous network, in the absence of a common clock and in the presence of a limited number of faulty processors.Soir tions are given which take the same number of rounds as Byzantine Agreement but might transmit r times as many bits, where r is the number of rounds used.