Abstract
We present a framework based on genetic algorithms to automatically generate cellular automata rules under four different asynchronous update models (fixed random sweep, random new sweep, clock and independent random ordering). We consider four different rules (18, 56, 110 and 180) with well known dynamics under synchronous update scheme. We try to reconstruct the same dynamics by means of a genetic algorithm using asynchronous update schemes. We show that in many cases it is impossible, by means of an asynchronous update scheme, to perfectly reconstruct these dynamics. Nevertheless, we show that the genetic algorithm finds the rules that more closely approximate the target behavior and the dynamics of the rules found by the genetic algorithm are rather similar to the target ones. In particular, we can always recognize a similar patter and we can also identify some differences in small details, which can be minimal (as for rule 18) or rather visible (as for rule 110). This paves the way to a deeper investigation on this track: does using asynchronous updates allow us to find more stable rules, i.e. rules that are less affected by noise, and thus do not overfit training data? This question remains open and answering it is one of the main goals of our current research.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Balister, P., Bollobás, B., Kozma, R.: Large deviations for mean fields models of probabilistic cellular automata. Random Structures and Algorithms 29(1), 339–415 (2006)
Bandini, S., Vanneschi, L., Wuensche, A., Bahgat Shehata, A.: A neuro-genetic framework for pattern recognition in complex systems. Fundamenta Informaticae 87(2) (2008)
Bersini, H., Detours, V.: Asynchrony induces stability in cellular automata based models. In: Proceedings of Artificial Life IV, pp. 382–387. MIT Press, Cambridge (1994)
Blok, H.J., Bergersen, B.: Synchronous versus asynchronous updating in the game of life. Phys. Rev. E 59, 3876–3879 (1999)
Buvel, R.L., Ingerson, T.E.: Structure in asynchronous cellular automata. Physica D 1(1), 59–68 (1984)
Chopard, B., Droz, M.: Cellular Automata Modeling of Physical Systems. Cambridge University Press, Cambridge (1998)
Cornforth, D., Green, D.G., Newth, D.: Ordered asynchronous processes in multi-agent systems. Physica D: Nonlinear Phenomena 204(1-2), 70–82 (2005)
Fatés, N., Morvan, M.: An experimental study of robustness to asynchronism for elementary cellular automata. Complex Systems 16(1), 1–27 (2005)
Fatés, N., Regnault, D., Schabanel, N., Thierry, É.: Asynchronous behaviour of double-quiescent elementary cellular automata. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 455–466. Springer, Heidelberg (2006)
Fukś, H.: Probabilistic cellular automata with conserved quantities. Nonlinearity 17(1), 159–173 (2004)
Gács, P.: Reliable cellular automata with self-organization. Journal of Statistical Physics 103(1/2), 45–267 (2001)
Gács, P., Reif, J.: A simple three-dimensional real-time reliable cellular array. Journal of Computer and System Sciences 36(2), 125–149 (1988)
Ganguly, N., Maji, P., Dhar, S., Sikdar, B.K., Chaudhuri, P.P.: Evolving Cellular Automata as Pattern Classifier. In: Bandini, S., Chopard, B., Tomassini, M. (eds.) ACRI 2002. LNCS, vol. 2493, pp. 56–68. Springer, Heidelberg (2002)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)
Holland, J.H.: Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor (1975)
Ibarra, O.H., Palis, M.A., Kim, S.M.: Fast parallel language recognition by cellular automata. Theoretical Computer Science 41(2-3), 231–246 (1985)
Jeanson, F.: Evolving asynchronous cellular automata for density classification. In: Bullock, S., Noble, J., Watson, R., Bedau, M.A. (eds.) Artificial Life XI: Proceedings of the Eleventh International Conference on the Simulation and Synthesis of Living Systems, pp. 282–288. MIT Press, Cambridge (2008)
Lumer, E.D., Nicolis, G.: Synchronous versus asynchronous dynamics in spatially distributed systems. Physica D 71(1), 440–452 (1994)
Maji, P., Shaw, C., Ganguly, N., Sikdar, B.K., Pal Chaudhuri, P.: Theory and application of cellular automata for pattern classification. Fundam. Inf. 58(3-4), 321–354 (2003)
Mitchell, M., Crutchfield, J.P., Das, R.: Evolving cellular automata with genetic algorithms: A review of recent work. In: Proceedings of the First International Conference on Evolutionary Computation and Its Applications (EvCA 1996) (1996)
Mitchell, T.: Machine Learning. McGraw Hill, New York (1996)
Regnault, D.: Abrupt behavior changes in cellular automata under asynchronous dynamics. In: Proceedings of 2nd European Conference on Complex Systems (ECCS), Oxford, UK (2006)
Regnault, D., Schabanel, N., Thierry, É.: Progresses in the analysis of stochastic 2d cellular automata: a study of asynchronous 2d minority. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 320–332. Springer, Heidelberg (2007)
Schönfish, B., de Ross, A.: Synchronous and asynchronous updating in cellular automata. BioSystems 51(1), 123–143 (1999)
Sipper, M.: Non-Uniform Cellular Automata: Evolution in Rule Space and Formation of Complex Structures. In: Brooks, R.A., Maes, P. (eds.) Proceedings of the 4th International Workshop on the Synthesis and Simulation of Living Systems (Artificial Life IV), pp. 394–399. MIT Press, Cambridge (1994)
Sipper, M.: Co-evolving non-uniform cellular automata to perform computations. Physica D 92(3-4), 193–208 (1996)
Sipper, M.: Evolution of parallel cellular machines: The Cellular Programming Approach. Springer, New York (1997)
Sipper, M., Tomassini, M., Capcarrere, M.S.: Evolving asynchronous and scalable non-uniform cellular automata. In: Proceedings of International Conference on Artificial Neural Networks and Genetic Algorithms (ICANNGA 1997), pp. 67–71. Springer, Heidelberg (1997)
Smith III, A.R.: Real-time language recognition by one-dimensional cellular automata. Journal of Computer and System Sciences 6(3), 233–253 (1972)
Tomassini, M., Venzi, M.: Artificially evolved asynchronous cellular automata for the density task. In: ACRI 2001: Proceedings of the 5th International Conference on Cellular Automata for Research and Industry, London, UK, pp. 44–55. Springer, Heidelberg (2002)
Toom, A.: Stable and attractive trajectories in multicomponent systems. Advances in Probability 6(1), 549–575 (1980)
Wolfram, S.: A New Kind of Science. Wolfram Media, Champaign (2002)
Wuensche, A.: Self-reproduction by glider collisions: the beehive rule. International Journal Pollack et al, pp. 286–291 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Valsecchi, A., Vanneschi, L., Mauri, G. (2010). A Study on the Automatic Generation of Asynchronous Cellular Automata Rules by Means of Genetic Algorithms. In: Bandini, S., Manzoni, S., Umeo, H., Vizzari, G. (eds) Cellular Automata. ACRI 2010. Lecture Notes in Computer Science, vol 6350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15979-4_45
Download citation
DOI: https://doi.org/10.1007/978-3-642-15979-4_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15978-7
Online ISBN: 978-3-642-15979-4
eBook Packages: Computer ScienceComputer Science (R0)