Synchronizing the Squad with (Almost) Arbitrary Cut Ratio

Luidnel Maignan; Jean-Baptiste Yunès

doi:10.1109/CANDAR.2016.0048

Synchronizing the Squad with (Almost) Arbitrary Cut Ratio

Luidnel Maignan ¹ Jean-Baptiste Yunès ²

1 LACL - Laboratoire d'Algorithmique Complexité et Logique

2 IRIF - Institut de Recherche en Informatique Fondamentale

Abstract : In this paper, we design a solution to the generalized firing squad problem where the splittings can be chosen to happen at any ratio greater than two thirds. This is in the same spirit as the (non-generalized) solutions of Mazoyer except that we do not use signal speeds but the concept of fields to achieve this goal. Signals and speeds do appear visually as an effect of the spatio-temporal structure of the cellular automaton. However, not being setup by design allows the solution to automatically extends to more generalized settings. Moreover, the conceptual design of the solution is separated from the state space optimization that is only handle afterward. The finiteness of state space is also sketched.

Document type :

Conference papers

Domain :

Computer Science [cs]

Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01799305
Contributor : Luidnel Maignan <>
Submitted on : Thursday, May 24, 2018 - 3:31:05 PM
Last modification on : Friday, January 4, 2019 - 5:33:38 PM

Synchronizing the Squad with (Almost) Arbitrary Cut Ratio

Identifiers

Collections

Citation

Export

Metrics

112

Contact

Synchronizing the Squad with (Almost) Arbitrary Cut Ratio

Identifiers

Collections

Citation

Export

Share

Metrics

112

Contact