Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Cellular Automata and Discrete Complex Systems

AUTOMATA 2013: Cellular Automata and Discrete Complex Systems pp 15–30Cite as

A Guided Tour of Asynchronous Cellular Automata

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8155))

Abstract

Research on asynchronous cellular automata has received a great amount of attention these last years and has turned to a thriving field. We survey the recent research that has been carried out on this topic and present a wide state of the art where computing and modelling issues are both represented.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramson, G., Zanette, D.H.: Globally coupled maps with asynchronous updating. Physical Review E 58, 4454–4460 (1998), http://link.aps.org/doi/10.1103/PhysRevE.58.4454

    Article  Google Scholar 

  2. Adachi, S., Peper, F., Lee, J.: Computation by asynchronously updating cellular automata. Journal of Statistical Physics 114(1-2), 261–289 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Adachi, S., Peper, F., Lee, J.: Universality of hexagonal asynchronous totalistic cellular automata. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds.) ACRI 2004. LNCS, vol. 3305, pp. 91–100. Springer, Heidelberg (2004), http://dx.doi.org/10.1007/978-3-540-30479-1_10

    Chapter  Google Scholar 

  4. Aracena, J., Goles, E., Moreira, A., Salinas, L.: On the robustness of update schedules in boolean networks. Biosystems 97(1), 1–8 (2009), http://www.sciencedirect.com/science/article/pii/S0303264709000471

    Article  Google Scholar 

  5. Baetens, J.M., Van der Weeën, P., De Baets, B.: Effect of asynchronous updating on the stability of cellular automata. Chaos, Solitons & Fractals 45(4), 383–394 (2012), http://dx.doi.org/10.1016/j.chaos.2012.01.002

    Article  MATH  Google Scholar 

  6. Bandini, S., Bonomi, A., Vizzari, G.: An analysis of different types and effects of asynchronicity in cellular automata update schemes. Natural Computing 11(2), 277–287 (2012), http://dx.doi.org/10.1007/s11047-012-9310-4

    Article  MathSciNet  Google Scholar 

  7. Bandini, S., Bonomi, A., Vizzari, G., Acconci, V.: An asynchronous cellular automata-based adaptive illumination facility. In: Serra, R., Cucchiara, R. (eds.) AI*IA 2009. LNCS, vol. 5883, pp. 405–415. Springer, Heidelberg (2009), http://dx.doi.org/10.1007/978-3-642-10291-2_41

    Chapter  Google Scholar 

  8. Bandman, O.: Parallel composition of asynchronous cellular automata simulating reaction diffusion processes. In: Bandini, S., Manzoni, S., Umeo, H., Vizzari, G. (eds.) ACRI 2010. LNCS, vol. 6350, pp. 395–398. Springer, Heidelberg (2010), http://dx.doi.org/10.1007/978-3-642-15979-4_41

    Chapter  Google Scholar 

  9. Belgacem, S., Fatès, N.: Robustness of multi-agent models: the example of collaboration between turmites with synchronous and asynchronous updating. Complex Systems 21(3), 165–182 (2012), http://www.complex-systems.com/abstracts/v21_i03_a01.html

    MathSciNet  Google Scholar 

  10. Bersini, H., Detours, V.: Asynchrony induces stability in cellular automata based models. 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. 382–387. MIT Press (1994)

    Google Scholar 

  11. Blok, H.J., Bergersen, B.: Synchronous versus asynchronous updating in the “game of life”. Physical Review E 59, 3876–3879 (1999)

    Article  Google Scholar 

  12. Bouré, O., Fatès, N., Chevrier, V.: First steps on asynchronous lattice-gas models with an application to a swarming rule. In: Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2012. LNCS, vol. 7495, pp. 633–642. Springer, Heidelberg (2012), http://dx.doi.org/10.1007/978-3-642-33350-7_65

    Chapter  Google Scholar 

  13. Bouré, O., Fatès, N., Chevrier, V.: Probing robustness of cellular automata through variations of asynchronous updating. Natural Computing 11, 553–564 (2012), http://dx.doi.org/10.1007/s11047-012-9340-y

    Google Scholar 

  14. Buvel, R.L., Ingerson, T.E.: Structure in asynchronous cellular automata. Physica D 1, 59–68 (1984)

    MathSciNet  Google Scholar 

  15. Capcarrère, M.S.: Evolution of asynchronous cellular automata. In: Guervós, J.J.M., Adamidis, P., Beyer, H.G., Schwefel, H.P., Fernández-Villacañas, J.L. (eds.) PPSN VII. LNCS, vol. 2439, pp. 903–912. Springer, Heidelberg (2002), http://dx.doi.org/10.1007/3-540-45712-7_87

    Chapter  Google Scholar 

  16. Worsch, T.: (intrinsically?) universal asynchronous CA. In: Sirakoulis, G.C., Bandini, S. (eds.) Proceedings of ACRI 2012. pp. 689–698. Lecture Notes in Computer Science, Springer (2012), http://dx.doi.org/10.1007/978-3-642-33350-7_70

    Chapter  Google Scholar 

  17. Chassaing, P., Gerin, L.: Asynchronous cellular automata and brownian motion. In: DMTCS Proceedings of AofA 2007, vol. AH, pp. 385–402 (2007), http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/viewArticle/dmAH0129

  18. Chevrier, V., Fatès, N.: How important are updating schemes in multi-agent systems? an illustration on a multi-turmite model. In: Proceedings of AAMAS 2010, pp. 533–540. International Foundation for Autonomous Agents and Multiagent Systems, Richland (2010), http://doi.acm.org/10.1145/1838206.1838282

  19. Cori, R., Métivier, Y., Zielonka, W.: Asynchronous mappings and asynchronous cellular automata. Information and Computation 106(2), 159–202 (1993), http://dx.doi.org/10.1006/inco.1993.1052

    Article  MathSciNet  MATH  Google Scholar 

  20. Cornforth, D., Green, D.G., Newth, D.: Ordered asynchronous processes in multi-agent systems. Physica D 204(1-2), 70–82 (2005), http://www.sciencedirect.com/science/article/pii/S0167278905001338

    Article  MathSciNet  Google Scholar 

  21. Das, S., Sarkar, A., Sikdar, B.K.: Synthesis of reversible asynchronous cellular automata for pattern generation with specific hamming distance. In: Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2012. LNCS, vol. 7495, pp. 643–652. Springer, Heidelberg (2012), http://dx.doi.org/10.1007/978-3-642-33350-7_66

    Chapter  Google Scholar 

  22. Eisele, M.: Long-range correlations in chaotic cellular automata. PLoS One 5(8), e11793 (2010), http://dx.doi.org/10.1371

  23. Dennunzio, A., Formenti, E., Manzoni, L.: Computing issues of asynchronous CA. Fundamenta Informaticae 120(2), 165–180 (2012), http://dx.doi.org/10.3233/FI-2012-755

    MathSciNet  MATH  Google Scholar 

  24. Dennunzio, A., Formenti, E., Manzoni, L., Mauri, G.: m-asynchronous cellular automata. In: Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2012, vol. 7495, pp. 653–662. Springer, Heidelberg (2012), http://dx.doi.org/10.1007/978-3-642-33350-7_67

    Chapter  Google Scholar 

  25. Droste, M., Gastin, P.: Asynchronous cellular automata for pomsets without auto-concurrency. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 627–638. Springer, Heidelberg (1996), http://dx.doi.org/10.1007/3-540-61604-7_80

    Chapter  Google Scholar 

  26. Droste, M., Gastin, P., Kuske, D.: Asynchronous cellular automata for pomsets. Theoretical Computer Science 247(1-2), 1–38 (2000), http://dx.doi.org/10.1016/S0304-39750000166-3

    Article  MathSciNet  MATH  Google Scholar 

  27. Fatès, N.: Asynchronism induces second order phase transitions in elementary cellular automata. Journal of Cellular Automata 4(1), 21–38 (2009), http://hal.inria.fr/inria-00138051

    MathSciNet  MATH  Google Scholar 

  28. Fatès, N.: Critical phenomena in cellular automata: perturbing the update, the transitions, the topology. Acta Physica Polonica B - Proceedings Supplement 3(2), 315–325 (2010), http://www.actaphys.uj.edu.pl/sup3/abs/s3p0315.htm

    Google Scholar 

  29. Fatès, N.: Does life resist asynchrony? In: Adamatzky, A. (ed.) Game of Life Cellular Automata, pp. 257–274. Springer, London (2010), http://dx.doi.org/10.1007/978-1-84996-217-9_14

    Chapter  Google Scholar 

  30. Fatès, N.: A note on the density classification problem in two dimensions. Exploratory papers presented at AUTOMATA 2012, La Marana, Corse, France (2012), http://hal.inria.fr/hal-00727558

  31. Fatès, N.: A note on the classification of the most simple asynchronous cellular automata. In: Kari, J., Kutrib, M., Malcher, A. (eds.) AUTOMATA 2013. LNCS, vol. 8155, pp. 31–45. Springer, Heidelberg (2013)

    Google Scholar 

  32. Fatès, N., Gerin, L.: Examples of fast and slow convergence of 2D asynchronous cellular systems. Journal of Cellular Automata 4(4), 323–337 (2009)

    MathSciNet  MATH  Google Scholar 

  33. Fatès, N., Morvan, M.: An experimental study of robustness to asynchronism for elementary cellular automata. Complex Systems 16, 1–27 (2005), http://www.complex-systems.com/abstracts/v16_i01_a01.html

    MathSciNet  Google Scholar 

  34. Fatès, N., Morvan, M., Schabanel, N., Thierry, E.: Fully asynchronous behavior of double-quiescent elementary cellular automata. Theoretical Computer Science 362, 1–16 (2006), http://dx.doi.org/10.1016/j.tcs.2006.05.036

    Article  MathSciNet  MATH  Google Scholar 

  35. Fatès, N., Regnault, D., Schabanel, N., Thierry, É.: Asynchronous behavior 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), http://dx.doi.org/10.1007/11682462_43

    Chapter  Google Scholar 

  36. Ferber, J., Müller, J.-P.: Influences and reaction: a model of situated multiagent systems. In: Proceedings of the 2nd International Conference on Multi-agent Systems, pp. 72–79 (1996)

    Google Scholar 

  37. Fukś, H., Skelton, A.: Orbits of the bernoulli measure in single-transition asynchronous cellular automata. In: Fatès, N., Goles, E., Maass, A., Rapaport, I. (eds.) Proceedings of Automata 2011. Discrete Mathematics and Theoretical Computer Science Proceedings, DMTCS, pp. 95–112 (2011), http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAP0107

  38. Gács, P.: Deterministic computations whose history is independent of the order of asynchronous updating. CoRR cs.DC/0101026 (2001), http://arxiv.org/abs/cs.DC/0101026

  39. Gharavi, R., Anantharam, V.: Effect of noise on long-term memory in cellular automata with asynchronous delays between the processors. Complex Systems 6(3), 287–300 (1992), http://www.complex-systems.com/abstracts/v06_i03_a05.html

    MathSciNet  MATH  Google Scholar 

  40. Grilo, C., Correia, L.: Effects of asynchronism on evolutionary games. Journal of Theoretical Biology 269(1), 109–122 (2011), http://dx.doi.org/10.1016/j.jtbi.2010.10.022

    Article  MathSciNet  Google Scholar 

  41. Hoffmann, J., Fatès, N., Palacios, H.: Brothers in arms? on AI planning and cellular automata. In: Coelho, H., Studer, R., Wooldridge, M. (eds.) Proceedings of ECAI 2010. Frontiers in Artificial Intelligence and Applications, vol. 215, pp. 223–228. IOS Press (2010), http://www.booksonline.iospress.nl/Content/View.aspx?piid=17702

  42. Hoseini, M., Tan, Z., You, C., Pavicic, M.: Design of a reconfigurable pulsed quad-cell for cellular-automata-based conformal computing. International Journal of Reconfigurable Computing 7907, Article ID 352428 (2010), http://dx.doi.org/10.1155/2010/352428

  43. Huberman, B.A., Glance, N.: Evolutionary games and computer simulations. Proceedings of the National Academy of Sciences, USA 90, 7716–7718 (1993)

    Article  MATH  Google Scholar 

  44. Kanada, Y.: The effects of randomness in asynchronous 1d cellular automata (poster). Artificial Life IV (1994), http://www.kanadas.com/CA/AsyncCA/AsyncCAext.pdf

  45. Kuske, D.: Emptiness is decidable for asynchronous cellular machines. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 536–551. Springer, Heidelberg (2000), http://dx.doi.org/10.1007/3-540-44618-4_38

    Chapter  Google Scholar 

  46. Kuske, D.: Weighted asynchronous cellular automata. Theoretical Computer Science 374(1-3), 127–148 (2007), http://dx.doi.org/10.1016/j.tcs.2006.11.031

    Article  MathSciNet  MATH  Google Scholar 

  47. Lee, J.: A simple model of asynchronous cellular automata exploiting fluctuation. Journal of Cellular Automata 6(4-5), 341–352 (2011), http://www.oldcitypublishing.com/JCA/JCAabstracts/JCA6.4-5abstracts/JCAv6n4-5p341-352Lee.html

    Article  MathSciNet  MATH  Google Scholar 

  48. Lee, J., Adachi, S., Peper, F.: Reliable self-replicating machines in asynchronous cellular automata. Artificial Life 13(4), 397–413 (2007), http://dx.doi.org/10.1162/artl.2007.13.4.397

    Article  Google Scholar 

  49. Lee, J., Adachi, S., Peper, F., Mashiko, S.: Delay-insensitive computation in asynchronous cellular automata. Journal of Computer and System Sciences 70(2), 201–220 (2005), http://dx.doi.org/10.1016/j.jcss.2004.10.009

    Article  MathSciNet  MATH  Google Scholar 

  50. Lee, J., Adachi, S., Peper, F., Morita, K.: Asynchronous game of life. Physica D 194(3-4), 369–384 (2004), http://dx.doi.org/10.1016/j.physd.2004.03.007

    Article  MathSciNet  MATH  Google Scholar 

  51. Lee, J., Zhu, Q.S.: A direct proof of turing universality of delay-insensitive circuits. International Journal of Unconventional Computing 8(2), 107–118 (2012), http://www.oldcitypublishing.com/IJUC/IJUCabstracts/IJUC8.2abstracts/IJUCv8n2p107-118Lee.html

    MathSciNet  Google Scholar 

  52. Lumer, E.D.L., Nicolis, G.: Synchronous versus asynchronous dynamics in spatially distributed systems. Physica D: Nonlinear Phenomena 71(4), 440–452 (1994), http://www.sciencedirect.com/science/article/pii/0167278994900108

    Article  MATH  Google Scholar 

  53. Macauley, M., McCammond, J., Mortveit, H.: Dynamics groups of asynchronous cellular automata. Journal of Algebraic Combinatorics 33(1), 11–35 (2011), http://dx.doi.org/10.1007/s10801-010-0231-y

    Article  MathSciNet  MATH  Google Scholar 

  54. Macauley, M., McCammond, J., Mortveit, H.S.: Order independence in asynchronous cellular automata. Journal of Cellular Automata 3(1), 37–56 (2008), http://www.oldcitypublishing.com/JCA/JCAabstracts/JCA3.1abstracts/JCAv3n1p37-56Macauley.html

    MathSciNet  MATH  Google Scholar 

  55. Macauley, M., Mortveit, H.S.: Coxeter groups and asynchronous cellular automata. In: Bandini, S., Manzoni, S., Umeo, H., Vizzari, G. (eds.) ACRI 2010. LNCS, vol. 6350, pp. 409–418. Springer, Heidelberg (2010), http://dx.doi.org/10.1007/978-3-642-15979-4_43

    Chapter  Google Scholar 

  56. Mamei, M., Roli, A., Zambonelli, F.: Emergence and control of macro-spatial structures in perturbed cellular automata, and implications for pervasive computing systems. IEEE Transactions on Systems, Man, and Cybernetics, Part A 35(3), 337–348 (2005), http://dx.doi.org/10.1109/TSMCA.2005.846379

    Article  Google Scholar 

  57. Manzoni, L.: Asynchronous cellular automata and dynamical properties. Natural Computing 11(2), 269–276 (2012), http://dx.doi.org/10.1007/s11047-012-9308-y

    Article  MathSciNet  Google Scholar 

  58. Messinger, S.M., Mott, K.A., Peak, D.: Task-performing dynamics in irregular, biomimetic networks: Research articles. Complexity 12(6), 14–21 (2007), http://dx.doi.org/10.1002/cplx.v12:6

    Article  Google Scholar 

  59. Minoofam, S.A.H., Bastanfard, A.: Square kufic pattern formation by asynchronous cellular automata. In: Bandini, S., Manzoni, S., Umeo, H., Vizzari, G. (eds.) ACRI 2010. LNCS, vol. 6350, pp. 79–82. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  60. Muscholl, A.: On the complementation of bchi asynchronous cellular automata. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol. 820, pp. 142–153. Springer, Heidelberg (1994), http://dx.doi.org/10.1007/3-540-58201-0_64

    Chapter  Google Scholar 

  61. Nakamura, K.: Asynchronous cellular automata and their computational ability. Systems, Computers, Controls 5(5), 58–66 (1974)

    MathSciNet  Google Scholar 

  62. Nehaniv, C.L.: Evolution in asynchronous cellular automata. In: Proceedings of the Eighth International Conference on Artificial Life, pp. 65–73. MIT Press (2003)

    Google Scholar 

  63. Nehaniv, C.L.: Asynchronous automata networks can emulate any synchronous automata network. International Journal of Algebra and Computation 14(5-6), 719–739 (2004), http://dx.doi.org/10.1142/S0218196704002043

    Article  MathSciNet  MATH  Google Scholar 

  64. Newth, D., Cornforth, D.: Asynchronous spatial evolutionary games. Biosystems 95(2), 120–129 (2009), http://dx.doi.org/10.1016/j.biosystems.2008.09.003

    Article  Google Scholar 

  65. Noual, M.: Synchronism vs asynchronism in boolean networks. CoRR abs/1104.4039 (2011), http://arxiv.org/abs/1104.4039

  66. Overeinder, B.J., Sloot, P.M.A.: Application of time warp to parallel simulations with asynchronous cellular automata. In: Proceedings of the 1993 European Simulation Symposium, pp. 397–402 (1993)

    Google Scholar 

  67. Peper, F., Adachi, S., Lee, J.: Variations on the game of life. In: Adamatzky, A. (ed.) Game of Life Cellular Automata, pp. 235–255. Springer, London (2010), http://dx.doi.org/10.1007/978-1-84996-217-9_13

    Chapter  Google Scholar 

  68. Pighizzini, G.: Asynchronous automata versus asynchronous cellular automata. Theoretical Computer Science 132(2), 179–207 (1994), http://dx.doi.org/10.1016/0304-39759490232-1

    Article  MathSciNet  MATH  Google Scholar 

  69. Priese, L.: A note on asynchronous cellular automata. Journal of Computer and System Sciences 17(2), 237–252 (1978), http://www.sciencedirect.com/science/article/pii/0022000078900077

    Article  MathSciNet  MATH  Google Scholar 

  70. Radicchi, F., Vilone, D., Meyer-Ortmanns, H.: Phase transition between synchronous and asynchronous updating algorithms. Journal of Statistical Physics 129(3), 593–603 (2007), http://dx.doi.org/10.1007/s10955-007-9416-8

    Article  MathSciNet  MATH  Google Scholar 

  71. Rajewsky, N., Santen, L., Schadschneider, A., Schreckenberg, M.: The asymmetric exclusion process: Comparison of update procedures. Journal of Statistical Physics 92(1-2), 151–194 (1998), http://dx.doi.org/10.1023/A%3A1023047703307

    Google Scholar 

  72. Regnault, D.: Proof of a phase transition in probabilistic cellular automata. In: Béal, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 433–444. Springer, Heidelberg (2013), http://dx.doi.org/10.1007/978-3-642-38771-5

    Chapter  Google Scholar 

  73. Regnault, D., Schabanel, N., Thierry, E.: Progresses in the analysis of stochastic 2D cellular automata: A study of asynchronous 2D minority. Theoretical Computer Science 410(47-49), 4844–4855 (2009), http://dx.doi.org/10.1016/j.tcs.2009.06.024

    Article  MathSciNet  MATH  Google Scholar 

  74. Rolf, J., Bohr, T., Jensen, M.H.: Directed percolation universality in asynchronous evolution of spatiotemporal intermittency. Physical Review E. 57(3), R2503–R2506 (1998)

    Google Scholar 

  75. Rouquier, J.B., Morvan, M.: Coalescing cellular automata: Synchronization by common random source for asynchronous updating. Journal of Cellular Automata 4(1), 55–78 (2009), http://www.oldcitypublishing.com/JCA/JCAabstracts/JCA4.1abstracts/JCAv4n1p55-77Rouquier.html

    Google Scholar 

  76. Rouquier, J.B., Regnault, D., Thierry, É.: Stochastic minority on graphs. Theoretical Computer Science 412(30), 3947–3963 (2011), http://dx.doi.org/10.1016/j.tcs.2011.02.028

    Article  MathSciNet  MATH  Google Scholar 

  77. Ruxton, G., Saravia, L.: The need for biological realism in the updating of cellular automata models. Ecological Modelling 107(2), 105–112 (1998)

    Article  Google Scholar 

  78. Saif, M.A., Gade, P.M.: The prisoner’s dilemma with semi-synchronous updates: evidence for a first-order phase transition. Journal of Statistical Mechanics: Theory and Experiment 2009(7), P07023 (2009), http://dx.doi.org/10.1088/1742-5468/2009/07/P07023

    Article  Google Scholar 

  79. Sarkar, A., Mukherjee, A., Das, S.: Reversibility in asynchronous cellular automata. Complex Systems 21(1), 71 (2012), http://www.complex-systems.com/abstracts/v21_i01_a05.html

    MathSciNet  Google Scholar 

  80. Schneider, O., Worsch, T.: A 3-state asynchronous CA for the simulation of delay-insensitive circuits. In: Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2012. LNCS, vol. 7495, pp. 565–574. Springer, Heidelberg (2012), http://dx.doi.org/10.1007/978-3-642-33350-7_58

    Chapter  Google Scholar 

  81. Schönfisch, B., de Roos, A.: Synchronous and asynchronous updating in cellular automata. BioSystems 51, 123–143 (1999)

    Article  Google Scholar 

  82. Sharifulina, A., Elokhin, V.: Simulation of heterogeneous catalytic reaction by asynchronous cellular automata on multicomputer. In: Malyshkin, V. (ed.) PaCT 2011. LNCS, vol. 6873, pp. 204–209. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  83. Silva, F., Correia, L.: A study of stochastic noise and asynchronism in elementary cellular automata. In: Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2012. LNCS, vol. 7495, pp. 679–688. Springer, Heidelberg (2012), http://dx.doi.org/10.1007/978-3-642-33350-7_70

    Chapter  Google Scholar 

  84. Spicher, A., Fatès, N., Simonin, O.: Translating discrete multi-agents systems into cellular automata: Application to diffusion-limited aggregation. In: Filipe, J., Fred, A., Sharp, B. (eds.) ICAART 2009. CCIS, vol. 67, pp. 270–282. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  85. Stark, W.R., Hughes, W.H.: Asynchronous, irregular automata nets: the path not taken. BioSystems 55, 107–117 (2000)

    Article  Google Scholar 

  86. Suzudo, T.: Searching for pattern-forming asynchronous cellular automata – an evolutionary approach. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds.) ACRI 2004. LNCS, vol. 3305, pp. 151–160. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  87. Suzudo, T.: Spatial pattern formation in asynchronous cellular automata with mass conservation. Physica A: Statistical Mechanics and its Applications 343, 185–200 (2004), http://dx.doi.org/10.1016/j.physa.2004.06.067

    MathSciNet  Google Scholar 

  88. Takada, Y., Isokawa, T., Peper, F., Matsui, N.: Construction universality in purely asynchronous cellular automata. Journal of Computer and System Sciences 72(8), 1368–1385 (2006), http://dx.doi.org/10.1016/j.jcss.2006.04.006

    Article  MathSciNet  MATH  Google Scholar 

  89. Taouali, W., Viéville, T., Rougier, N.P., Alexandre, F.: No clock to rule them all. Journal of Physiology-Paris 105(1-3), 83–90 (2011), http://www.sciencedirect.com/science/article/pii/S092842571100026X

    Article  Google Scholar 

  90. Toffoli, T.: Integration of the phase-difference relations in asynchronous sequential networks. In: Ausiello, G., Böhm, C. (eds.) ICALP 1978. LNCS, vol. 62, pp. 457–463. Springer, Heidelberg (1978), http://dx.doi.org/10.1007/3-540-08860-1_34

    Chapter  Google Scholar 

  91. Tomassini, M., Venzi, M.: Artificially evolved asynchronous cellular automata for the density task. In: Bandini, S., Chopard, B., Tomassini, M. (eds.) ACRI 2002. LNCS, vol. 2493, pp. 44–55. Springer, Heidelberg (2002), http://dx.doi.org/10.1007/3-540-45830-1_5

    Chapter  Google Scholar 

  92. Tošić, P.T.: On modeling large-scale multi-agent systems with parallel, sequential and genuinely asynchronous cellular automata. Acta Physica Polonica B - Proceedings Supplement 4(2), 217–235 (2011), http://doi.org/10.5506/APhysPolBSupp.4.217

    Article  Google Scholar 

  93. Vanneschi, L., Mauri, G.: A study on learning robustness using asynchronous 1D cellular automata rules. Natural Computing 11(2), 289–302 (2012), http://dx.doi.org/10.1007/s11047-012-9311-3

    Article  MathSciNet  Google Scholar 

  94. Vielhaber, M.: Computation of functions on n bits by asynchronous clocking of cellular automata. Natural Computing (to appear, available for download “online first”, 2013), http://dx.doi.org/10.1007/s11047-013-9376-7

  95. von Neumann, J.: Theory of self-reproducing automata. University of Illinois press Urbana (1966); Burks, A. (ed.)

    Google Scholar 

  96. Wacker, S., Worsch, T.: Phase space invertible asynchronous cellular automata. In: Formenti, E. (ed.) Proceedings of AUTOMATA & JAC. EPTCS, vol. 90, pp. 236–254 (2012), http://dx.doi.org/10.4204/EPTCS.90.19

  97. Worsch, T. (Intrinsically?) universal asynchronous CA. In: Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2012. LNCS, vol. 7495, pp. 689–698. Springer, Heidelberg (2012), http://dx.doi.org/10.1007/978-3-642-33350-7_70

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LORIA UMR 7503, Inria Nancy Grand-Est, 54 600, Villers-lès-Nancy, France

    Nazim Fatès

Authors
  1. Nazim Fatès
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Turku, Department of Mathematics, 20014, Turku, Finland

    Jarkko Kari

  2. Institut für Informatik, Universität Giessen, Arndtstr. 2, 35392, Giessen, Germany

    Martin Kutrib  & Andreas Malcher  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fatès, N. (2013). A Guided Tour of Asynchronous Cellular Automata. In: Kari, J., Kutrib, M., Malcher, A. (eds) Cellular Automata and Discrete Complex Systems. AUTOMATA 2013. Lecture Notes in Computer Science, vol 8155. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40867-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40867-0_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40866-3

  • Online ISBN: 978-3-642-40867-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation