首页|Asynchronous communicating cellular automata: Formalization, robustness and equivalence
Asynchronous communicating cellular automata: Formalization, robustness and equivalence
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
This paper attempts at formalizing a novel type of cellular automata (CAs) in the framework of distributed systems under asynchronous communication. Called asynchronous communicating cellular automata (ACCAs), our models allow each cell to exchange states with its neighboring cells independently at random times, via a specific protocol for asynchronous communication. This can actually facilitate the separation of communication between cells from the cells state transitions in an ACCA. The effect of asynchronous communication on dynamical behavior will be analyzed on the well-studied elementary class of cellular automata, especially on their robustness. Despite the unpredictable randomness in both communication and state transitions, computational equivalence between ACCAs and conventional CAs can be achieved, based on effective methods for transforming every synchronous CA into an equivalent ACCA. (C) 2021 Elsevier Inc. All rights reserved.
NSTL
Elsevier
