A Survey of Petri Net Methods for Controlled Discrete EventSystems
Discrete Event Dynamic Systems
Regular biosequence pattern matching with cellular automata
Information Sciences—Applications: An International Journal
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Universality and decidability of number-conserving cellular automata
Theoretical Computer Science - Algorithms,automata, complexity and games
Number-conserving cellular automata I: decidability
Theoretical Computer Science
On conservative and monotone one-dimensional cellular automata and their particle representation
Theoretical Computer Science - Special issue: Theoretical aspects of cellular automata
Delay-insensitive computation in asynchronous cellular automata
Journal of Computer and System Sciences
Towards a Theory of Universal Speed-Independent Modules
IEEE Transactions on Computers
Non-uniform cellular automata based associative memory: Evolutionary design and basins of attraction
Information Sciences: an International Journal
Reversible computing and cellular automata—A survey
Theoretical Computer Science
On behavior of two-dimensional cellular automata with an exceptional rule
Information Sciences: an International Journal
Cellular particle swarm optimization
Information Sciences: an International Journal
Fault-tolerance in nanocomputers: a cellular array approach
IEEE Transactions on Nanotechnology
Analysis of the Petri net model of parallel manufacturing processes with shared resources
Information Sciences: an International Journal
Number-conserving cellular automaton rules
Fundamenta Informaticae - Cellular Automata
Invertible behavior in elementary cellular automata with memory
Information Sciences: an International Journal
Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements
Theoretical Computer Science
A novel bio-inspired approach based on the behavior of mosquitoes
Information Sciences: an International Journal
Hi-index | 0.07 |
A number-conserving cellular automaton (NCCA) is a cellular automaton in which the states of cells are denoted by integers, and the sum of all of the numbers in a configuration is conserved throughout its evolution. NCCAs have been widely used to model physical systems that are ruled by conservation laws of mass or energy. Imai et al. [13] showed that the local transition function of NCCA can be effectively translated into the sum of a binary flow function over pairs of neighboring cells. In this paper, we explore the computability of NCCAs in which the pairwise number flows are performed at fully asynchronous timings. Despite the randomness that is associated with asynchronous transitions, useful computation still can be accomplished efficiently in the cellular automata through the active exploitation of fluctuations [18]. Specifically, certain numbers may flow randomly fluctuating between forward and backward directions in the cellular space, as if they were subject to Brownian motion. Because random fluctuations promise a powerful resource for searching through a computational state space, the Brownian-like flow of the numbers allows for efficient embedding of logic circuits into our novel asynchronous NCCA.