Synchronous and asynchronous updating in cellular automata.

We analyze the properties of a synchronous and of various asynchronous methods to iterate cellular automata. 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. 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. We also analyse a time-driven method in which the state transitions of single cells are governed by a probability per unit time that determines an exponential distribution of the waiting time until the next transition. The statistical properties of this method are completely independent of the size of the grid. Consecutive updating steps therefore show no correlation at all. The stationary states of a cellular automaton do not depend on whether a synchronous or asynchronous updating method is used. Their basins of attraction might, however, be vastly different under synchronous and asynchronous iteration. Cyclic dynamics occur only with synchronous updating.