Skip to main content
SpringerLink
Log in

Evolution of Asynchronous Cellular Automata

  • Conference paper
  • First Online:
Parallel Problem Solving from Nature — PPSN VII (PPSN 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2439))

Included in the following conference series:

Abstract

One of the prominent features of the Cellular Automata (CA) model is its synchronous mode of operation, meaning that all cells are updated simultaneously. But this feature is far from being realistic from a biological point of view as well as from a computational point of view. Past research has mainly concentrated on studying Asynchronous CAs in themselves, trying to determine what behaviors were an “artifact” of the global clock. In this paper, I propose to evolve Asynchronous CAs that compute successfully one of the well-studied task for regular CAs: The synchronization task. As I will show evolved solutions are both unexpected and best for certain criteria.

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

Access this chapter

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hugues Bersini and Vincent Detours. Asynchrony induces stability in cellular automata based models. In R.A. Brooks and P. Maes, editors, Proceedings of the Artificial Life IV conference, pages 382–387, Cambridge, MA, 1994. MIT Press.

    Google Scholar 

  2. Mathieu S. Capcarrere. Cellular Automata and Other Cellular Systems: Design & Evolution. Phd Thesis No 2541, Swiss Federal Institute of Technology, Lausanne, 2002.

    Google Scholar 

  3. Mathieu S. Capcarrere and Moshe Sipper. Necessary conditions for density classi fication by cellular automata. Physical Review E, 64(3):036113/1–4, December 2001.

    Article  Google Scholar 

  4. Mathieu S. Capcarrere, Moshe Sipper, and Marco Tomassini. Two-state, r=1 cellular automaton that classifies density. Physical Review Letters, 77(24):4969–4971, December 1996.

    Article  Google Scholar 

  5. Robert Cori, Yves Métivier, and Wieslaw Zielonka. Asynchronous mappings and asynchronous cellular automata. Information and Computation, 106:159–202, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  6. Rajarshi Das, James P. Crutchfield, Melanie Mitchell, and James E. Hanson. Evolving globally synchronized cellular automata. In L. J. Eshelman, editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 336–343, San Francisco, CA, 1995. Morgan Kaufmann.

    Google Scholar 

  7. Peter Gács. Self-correcting two-dimensionnal arrays. In Silvio Micali, editor, Randomness in computation, volume 5 of Advances in Computing Research, pages 223–326, Greenwich, Conn, 1989. JAI Press.

    Google Scholar 

  8. Peter Gács. Reliable cellular automata with self-organization. In Proceedings of the 38th IEEE Symposium on the Foundation of Computer Science, pages 90–99, 1997.

    Google Scholar 

  9. H. Hartman and Gérard Y. Vichniac. Inhomogeneous cellular automata (inca). In E. Bienenstock et al., editor, Disordered Systems and Biological Organization, volume F 20, pages 53–57. Springer-Verlag, Berlin, 1986.

    Google Scholar 

  10. Wim Hordijk. The structure of the synchonizing-ca landscape. Technical Report 96-10-078, Santa Fe Institute, Santa Fe, NM (USA), 1996.

    Google Scholar 

  11. T. E. Ingerson and R. L. Buvel. Structures in asynchronous cellular automata. Physica D, 10:59–68, 1984.

    Article  MathSciNet  Google Scholar 

  12. Yasusi Kanada. Asynchronous 1d cellular automata and the effects of fluctuation and randomness. In R.A. Brooks and P. Maes, editors, A-Life IV: Proceedings of the Fourth Conference on Artificial Life, page Poster, Cambridge, MA, 1994. MIT Press.

    Google Scholar 

  13. Dietrich Kuske. Emptiness is decidable for asynchronous cellular machines. In C. Palamidessi, editor, CONCUR 2000, Lecture Notes in Computer Science, LNCS 1877, pages 536–551, Berlin, 2000.

    Chapter  Google Scholar 

  14. Martin A. Nowak, Sebastian Bonhoeffer, and Robert M. May. Spatial games and the maintenance of cooperation. Proceedings of the National Academic of Sciences USA, 91:4877–4881, May 1994.

    Google Scholar 

  15. Giovanni Pighizzini. Asynchronous automata versus asynchronous cellular automata. Theoretical Computer Science, 132:179–207, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  16. Birgitt Schönfisch and André de Roos. Synchronous and asynchronous updating in cellular automata. BioSystems, 51:123–143, 1999.

    Article  Google Scholar 

  17. Moshe Sipper. Evolution of Parallel Cellular Machines: The Cellular Programming Approach. Springer-Verlag, Heidelberg, 1997.

    Google Scholar 

  18. Moshe Sipper, Marco Tomassini, and Mathieu S. Capcarrere. Evolving asynchronous and scalable non-uniform cellular automata. In Icannga 1997: Proceedings of the Third Bi-Annual Conference, pages 66–70, Wien, Austria, 1998. Springer-Verlag.

    Google Scholar 

  19. W. Richard Stark. Dynamics for fundamental problem of biological information processing. International Journal of Artificial Intelligence Tools, 4(4):471–488, 1995.

    Article  Google Scholar 

  20. Stephen Wolfram. Approaches to complexity engineering. Physica D, 22:385–399, 1986.

    MathSciNet  Google Scholar 

  21. Wieslaw Zielonka. Notes on finite asynchronous automata. Informatique théorique et Applications/Theoretical Infomatics and Applications, 21(2):99–135, 1987.

    MathSciNet  MATH  Google Scholar 

  22. Wieslaw Zielonka. Safe executions of recognizable trace languages by asynchronous automata. In Albert R. Meyer and Michael A. Taitslin, editors, Logic at Botik’89, Lecture Notes in Computer Science, LNCS 363, pages 278–289, Berlin, 1989. Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Logic Systems Laboratory School of Computer anc Communication Sciences, Swiss Federal Institute of Technology, Lausanne, CH-1015, Lausanne, Switzerland

    Mathieu S. Capcarrere

Authors
  1. Mathieu S. Capcarrere
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Escuela Técnica Superior de Ingeniería Informática, 18071, Granada, Spain

    Juan Julián Merelo Guervós

  2. Department of Informatics, Technological Educational Institute of Thessaloniki, 54101, Thessaloniki, Greece

    Panagiotis Adamidis

  3. Department of Informatics XI, University of Dortmund, 44221, Dortmund, Germany

    Hans-Georg Beyer  & Hans-Paul Schwefel  & 

  4. Department of Signal Theory and Communications, Universidad Carlos III, Madrid, Spain

    José-Luis Fernández-Villacañas

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Capcarrere, M.S. (2002). Evolution of Asynchronous Cellular Automata. In: Guervós, J.J.M., Adamidis, P., Beyer, HG., Schwefel, HP., Fernández-Villacañas, JL. (eds) Parallel Problem Solving from Nature — PPSN VII. PPSN 2002. Lecture Notes in Computer Science, vol 2439. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45712-7_87

Download citation

  • DOI: https://doi.org/10.1007/3-540-45712-7_87

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45712-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation