|   | 
Details
   web
Records
Author Ruivo, E.L.P.; Montalva-Medel, M.; de Oliveira, P.P.B.; Perrot, K.
Title Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates Type
Year 2018 Publication Chaos Solitons & Fractals Abbreviated Journal Chaos Solitons Fractals
Volume 113 Issue (up) Pages 209-220
Keywords Cellular automaton; Asynchronous update; Update digraph; Discrete dynamics; One-step maximum sensitivity
Abstract Cellular automata are fully-discrete dynamical systems with global behaviour depending upon their locally specified state transitions. They have been extensively studied as models of complex systems as well as objects of mathematical and computational interest. Classically, the local rule of a cellular automaton is iterated synchronously over the entire configuration. However, the question of how asynchronous updates change the behaviour of a cellular automaton has become a major issue in recent years. Here, we analyse the elementary cellular automata rule space in terms of how many different one-step trajectories a rule would entail when taking into account all possible deterministic ways of updating the rule, for one time step, over all possible initial configurations. More precisely, we provide a characterisation of the elementary cellular automata, by means of their one-step maximum sensitivity to all possible update schedules, that is, the property that any change in the update schedule causes the rule's one-step trajectories also to change after one iteration. Although the one-step maximum sensitivity does not imply that the remainder of the time-evolutions will be distinct, it is a necessary condition for that. (C) 2018 Elsevier Ltd. All rights reserved.
Address [Ruivo, Eurico L. P.; de Oliveira, Pedro P. B.] Univ Presbiteriana Mackenzie, Fac Comp & Informat, Sao Paulo, SP, Brazil, Email: eurico.ruivo@mackenzie.br
Corporate Author Thesis
Publisher Pergamon-Elsevier Science Ltd Place of Publication Editor
Language English Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 0960-0779 ISBN Medium
Area Expedition Conference
Notes WOS:000442101600024 Approved
Call Number UAI @ eduardo.moreno @ Serial 910
Permanent link to this record
 

 
Author Goles, E.; Salinas, L.
Title Comparison between parallel and serial dynamics of Boolean networks Type
Year 2008 Publication Theoretical Computer Science Abbreviated Journal Theor. Comput. Sci.
Volume 396 Issue (up) 1-3 Pages 247-253
Keywords Boolean network; synchronous update; asynchronous update; attractor; dynamical cycle; fixed point
Abstract In this article we study some aspects about the graph associated with parallel and serial behavior of a Boolean network. We conclude that the structure of the associated graph can give some information about the attractors of the network. We show that the length of the attractors of Boolean networks with a graph by layers is a power of two and under certain conditions the only attractors are fixed points. Also, we show that, under certain conditions, dynamical cycles are not the same for parallel and serial updates of the same Boolean network. (C) 2007 Elsevier B.V. All rights reserved.
Address [Salinas, L.] Univ Chile, Dept Engn Math, Santiago, Chile, Email: eric.chacc@uai.cl
Corporate Author Thesis
Publisher Elsevier Science Bv Place of Publication Editor
Language English Summary Language Original Title
Series Editor Series Title Abbreviated Series Title
Series Volume Series Issue Edition
ISSN 0304-3975 ISBN Medium
Area Expedition Conference
Notes WOS:000256199100019 Approved
Call Number UAI @ eduardo.moreno @ Serial 32
Permanent link to this record