Synchronous and asynchronous updating in cellular automata

Stronger correlations between consecutive steps in the updating order result in more, artificial structure in the patterns.

Among these step–driven methods, using random choice with replacement to pick the next cell for updating, yields results that are least influenced by the updating method.

The synchronous approach assumes the presence of a global clock to ensure all cells are updated together. Nehaniv in 1998) allows one to emulate exactly the behaviour of a synchronous cellular automaton via an asynchronous one constructed as a simple modification of the synchronous cellular automaton (Nehaniv 2002).Asynchronous methods in which the time variable is not explicitly defined, operate by specifying an updating order of the cells.The statistical properties of this order have significant consequences for the dynamics and the patterns generated by the cellular automata.We analyze the properties of synchronous and various asynchronous methods to iterate cellular automata.Here we give just a brief summary of the results presented in [5].

Leave a Reply