Skip to main content

A Local Behavior Identification Algorithm for Generative Network Automata Configurations

  • Conference paper
  • 1675 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5778))

Abstract

Relation between the part and the whole is investigated in the context of complex discrete dynamical systems. For that purpose, an algorithm for local behavior identification from global data described as Generative Network Automata model configurations is developed. It is shown that one can devise a procedure to simulate finite GNA configurations via Automata Networks having static rule-space setting. In practice, the algorithm provides an automated approach to model construction and it can suitably be used in GNA based system modeling effort.

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. Garzon, M.: Models of Massive Parallelism Analysis of Cellular Automata and Neural Networks. Texts in Theoretical Computer Science. Springer, Heidelberg (1995)

    MATH  Google Scholar 

  2. Wolfram, S.: Universality and Complexity in Cellular Automata. Physica D 10, 1–35 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  3. Langton, C.: Studying Artificial Life with Cellular Automata. Physica D 22, 120–149 (1986)

    Article  MathSciNet  Google Scholar 

  4. Sayama, H.: Generative Network Automata: A Generalized Framework for Modeling Complex Dynamical Systems with Autonomously Varying Topologies. In: Proc. of the 2007 IEEE Symposium on Artificial Life (CI-Alife 2007), pp. 214–221 (2007)

    Google Scholar 

  5. Goles, E., Martinez, S.: Neural and Automata Networks: Dynamical Behavior and Applications. Kluwer Academic Publishers, The Netherlands (1990)

    Book  MATH  Google Scholar 

  6. Von Neumann, J.: Theory of Self-Reproducing Automata, edited by A.W. Burks. University of Illinois, Urbana (1966)

    Google Scholar 

  7. Kılıç, H.: A Methodology for Reverse Engineering Automata Networks, Ph.D. Dissertation, Middle East Technical University, Department of Computer Engineering, 135 pages, Ankara, Turkey (1998), http://www.atilim.edu.tr/~hurevren/PHDTHESIS_HUR.rar

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Özdemir, B., Kılıç, H. (2011). A Local Behavior Identification Algorithm for Generative Network Automata Configurations. In: Kampis, G., Karsai, I., Szathmáry, E. (eds) Advances in Artificial Life. Darwin Meets von Neumann. ECAL 2009. Lecture Notes in Computer Science(), vol 5778. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21314-4_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21314-4_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21313-7

  • Online ISBN: 978-3-642-21314-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics