Skip to main content

On the Collision-Propagation and Gather-Update Formulations of a Cellular Automata Rule

  • Conference paper

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

Abstract

We consider two formulations of a cellular automata: the first one uses a gather-update paradigm and the second one a collision-propagation paradigm. We show the equivalence of both descriptions and, using the latter paradigm, we propose a simple way to define a Cellular Automata on a graph with arbitrary topology. Finally, we exploit the duality of formulation to reconsider the problem of characterizing invertible cellular automata.

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

Buying options

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   54.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. Caiazzo, A., Falcone, J.-L., Chopard, B., Hoekstra, A.: Error investigations in complex automata models for reaction-diffusion systems. In: Umeo, H., et al. (eds.) ACRI 2008. LNCS, vol. 5191, pp. 260–267. Springer, Heidelberg (2008)

    Google Scholar 

  2. Caldarelli, G.: Scale-Free Networks. Oxford University Press, Oxford (2007)

    MATH  Google Scholar 

  3. Chopard, B., Droz, M.: Cellular Automata Modeling of Physical Systems. Cambridge University Press, Cambridge (1998)

    MATH  Google Scholar 

  4. Durand-Lose, J.: Representing reversible cellular automata with reversible block cellular automata. In: Discrete Mathematics and Theoretical Computer Sciences Proceedings AA (DM-CCG), pp. 145–154 (2001)

    Google Scholar 

  5. Hoekstra, A., Lorenz, E., Falcone, J.-L., Chopard, B.: Towards a complex automata formalism for multuscale modeling. Int. J. Multiscale Computational Engineering 5(6), 491–502 (2008)

    Article  Google Scholar 

  6. Hoekstra, A.G., Falcone, J.-L., Caiazzo, A., Chopard, B.: Multi-scale modeling with cellular automata: The complex automata approach. In: Umeo, H., et al. (eds.) ACRI 2008. LNCS, vol. 5191, pp. 192–199. Springer, Heidelberg (2008)

    Google Scholar 

  7. Marconi, S., Chopard, B.: Discrete physics, cellular automata and cryptography. In: El Yacoubi, S., Chopard, B., Bandini, S. (eds.) ACRI 2006. LNCS, vol. 4173, pp. 617–626. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Razakanirina, R.M.: Cellular automata on graphs applied to financial flow simulation. Master’s thesis, University of Geneva, Computer Science department, Master thesis (2007)

    Google Scholar 

  9. Toffoli, T., Margolus, N.: Cellular Automata Machines: a New Environment for Modeling. MIT Press, Cambridge (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hiroshi Umeo Shin Morishita Katsuhiro Nishinari Toshihiko Komatsuzaki Stefania Bandini

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chopard, B., Falcone, JL., Razakanirina, R., Hoekstra, A., Caiazzo, A. (2008). On the Collision-Propagation and Gather-Update Formulations of a Cellular Automata Rule. In: Umeo, H., Morishita, S., Nishinari, K., Komatsuzaki, T., Bandini, S. (eds) Cellular Automata. ACRI 2008. Lecture Notes in Computer Science, vol 5191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79992-4_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-79992-4_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-79991-7

  • Online ISBN: 978-3-540-79992-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics