RAIRO-Theor. Inf. Appl.
Volume 42, Number 1, January-March 2008A nonstandard spirit among computer scientists:a tribute to Serge Grigorieff at the occasion of his 60th birthday
|Page(s)||55 - 68|
|Published online||18 January 2008|
An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem
LIAFA, Université Paris 7 Denis Diderot, 175 rue du chevaleret, 75013 Paris, France; Jean-Baptiste.Yunes@liafa.jussieu.fr
Here is presented a 6-states non minimal-time solution which is intrinsically Minsky-like and solves the three following problems: unrestricted version on a line, with one initiator at each end of a line and the problem on a ring. We also give a complete proof of correctness of our solution, which was never done in a publication for Minsky's solutions.
Mathematics Subject Classification: 65Y05 / 68Q25 / 68Q80 / 68W10
Key words: Firing squad / synchronization
© EDP Sciences, 2007
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.