In a previous work (see [3]) we presented a general scheme to solve the 1D Generalized Firing Squad Synchronization Problem. We designed it in a modular way using the concept of fields (open CA). The solution was not designed as a finite cellular automaton because we needed unbounded integers as states for distance fields, and the recursive nature of the algorithm leaded to a unbounded number of fields. In this paper, we show as claimed, that this approach does lead to a finite cellular automaton. We exhibit a transformation function from infinite to finite states and write a program that generates the associated finite transition table while checking its validity and the conservation of the input-output behavior of the original cellular automaton.
CITATION STYLE
Maignan, L., & Yunès, J. B. (2014). Experimental finitization of infinite field-based generalized FSSP Solution. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8751, 136–145. https://doi.org/10.1007/978-3-319-11520-7_15
Mendeley helps you to discover research relevant for your work.