Abstract Classically, cellular automata and, in fact, automata networks in general, have synchronous dynamics defined by a local function. But the interest on asynchronous versions of both systems has grown, since it provides an extra degree of freedom. The standard way to define deterministic asynchronism is to set an update priority to each node. It has been shown that these networks can solve problems that were not previously solvable with synchronous systems. However, such a way to define asynchronism depends totally on the relative position of the node in the network. Here, we propose a new way to look at asynchronism in such systems, in that the priority now relies on the state transitions of the system’s underlying local function. This leads to a scalable way to add deterministic asynchronism in such networks. Taking the elementary cellular automata space as a baseline, we carry out a complete characterisation of its dynamics using the proposed asynchronism update scheme.
Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates
P. Oliveira,Thiago Gomes De Mattos,Eurico L. P. Ruivo
Published 2022 in Communications in nonlinear science & numerical simulation
ABSTRACT
PUBLICATION RECORD
- Publication year
2022
- Venue
Communications in nonlinear science & numerical simulation
- Publication date
2022-01-01
- Fields of study
Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-25 of 25 references · Page 1 of 1
CITED BY
Showing 1-3 of 3 citing papers · Page 1 of 1