Asynchronous cellular automaton

Effect of asynchronous updating on the stability of cellular automata

By building simplified models, new insights can be learned. The time-state diagrams below show the differences that are caused by changing the update scheme of the cellular automata model without changing any other parameters.

The second phase updates state values by copying the new states to the cells. The self-clocked scheme - each cell has an independent timer, initialised to a random period and phase. Updating is autonomous and proceeds at different rates for different cells.

In contrast, an asynchronous cellular automaton is able to update individual cells independently, in such a way that the new state of a cell affects the calculation of states in neighbouring cells. Any interesting behaviour disappears in the asynchronous case. The schemes shown in the images below are as follows Cornforth et al. All of the schemes described above have their part in real life.

The selfsync schemeThe timestate diagrams

In their models, nodes were organised into blocks. When the period has expired, the cell is updated and the timer reset. Toffoli in the s, and by C.

The synchronous approach assumes the presence of a global clock to ensure all cells are updated together. The random independent scheme - at each time step, a cell is chosen at random with replacement, and updated.

State values are

These models relax the normal requirement of all nodes having the same update rule. There is always a question of how simple these models should be in order to adequately describe what is being modelled. The synchronous scheme - all cells are updated in parallel at each time step.

The use of asynchronous models can allow an extra level of realism in the model. Attractors in Asynchronous Boolean Networks. Implementations of synchronous updating can be analysed in two phases. The cyclic scheme - at each time step a node is chosen according to a fixed update order, which was decided at random during initialisation of the model.

The state of every cell in the model is updated together, before any of the new states influence other cells. The first, interaction, calculates the new state of each cell based on the neighbourhood and the update rule. There are different types of asynchronous updating, and different authors have described these in different ways. Nodes within a block were updated synchronously, but blocks were updated asynchronously.

By building simplified models new insights

The self-sync scheme - the same as the clocked scheme, but the phase of the timers are affected by local coupling to neighbours, and so are able to achieve local synchrony. State values are held in a temporary store.

As a consequence, it follows immediately from results on synchronous cellular automata that asynchronous cellular automata are capable of emulating, e. The random order scheme - at each time step, all nodes are updated, but in random order. The random independent scheme could be appropriate for modelling social networks or communication in computer networks. In Husbands and Harvey eds. This is the conventional model, stated here for comparison.

Effect of asynchronous updating on the stability of cellular automata