Cellular automata machines: a new environment for modeling
Cellular automata machines: a new environment for modeling
An asynchronous two-dimensional self-correcting cellular automaton
An asynchronous two-dimensional self-correcting cellular automaton
Asynchronous mappings and asynchronous cellular automata
Information and Computation
Approaches to design of circuits for low-power computation
Approaches to design of circuits for low-power computation
Global Synchronization of Asynchronous Arrays in Logical Time
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
Evolution in asynchronous cellular automata
ICAL 2003 Proceedings of the eighth international conference on Artificial life
Cellular Automata
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
Towards a Theory of Universal Speed-Independent Modules
IEEE Transactions on Computers
Universality in cellular automata
SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
Universal delay-insensitive circuits with bidirectional and buffering lines
IEEE Transactions on Computers
Hi-index | 0.00 |
Asynchronous Cellular Automata (ACA) are cellular automata which allow cells to be updated at times that are random and independent of each other. Due to their unpredictable behavior, ACA are usually dealt with by simulating a timing mechanism that forces all cells into synchronicity. Though this allows the use of well-established synchronous methods to conduct computations, it comes at the price of an increased number of cell states. This paper presents a more effective approach based on a 5-state ACA with von Neumann neighborhood that uses rotation- and reflection-symmetric transition rules to describe the interactions between cells. We achieve efficient computation on this model by embedding so-called Delay-Insensitive circuits in it, a type of asynchronous circuits in which signals may be subject to arbitrary delays, without this being an obstacle to correct operation. Our constructions not only imply the computational universality of the proposed cellular automaton, but also allow the efficient use of its massive parallelism, in the sense that the circuits operate in parallel and there are no signals running around indefinitely in the circuits in the absence of input.