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. © 2011 Springer-Verlag.
CITATION STYLE
Özdemir, B., & Kiliç, H. (2011). A local behavior identification algorithm for generative network automata configurations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5778 LNAI, pp. 191–199). https://doi.org/10.1007/978-3-642-21314-4_24
Mendeley helps you to discover research relevant for your work.