Fully asynchronous behavior of double-quiescent elementary cellular automata

Theoretical Computer Science

Volumn 362, Issue 1-3, 2006, Pages 1-16

  Fatès, Nazim ^a   Thierry, Éric ^a   Morvan, Michel ^a,b   Schabanel, Nicolas ^a  

^a UNIVERSITÉ DE LYON   (France)

^b ÉCOLE DES HAUTES ÉTUDES EN SCIENCES SOCIALES   (France)

Author keywords

Asynchronous cellular automata; Convergence predictions; Stochastic process

Indexed keywords

ASYNCHRONOUS SEQUENTIAL LOGIC; CODES (SYMBOLS); CONVERGENCE OF NUMERICAL METHODS; FUNCTION EVALUATION; PROBABILISTIC LOGICS; RANDOM PROCESSES;

ASYNCHRONOUS CELLULAR AUTOMATA; CONVERGENCE PREDICTIONS; GLOBAL FUNCTION; PROBABILISTIC ANALYSIS;

AUTOMATA THEORY;

EID: 33748576886     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.05.036     Document Type: Article

References (14)

1. H. Bersini, V. Detours, Asynchrony induces stability in cellular automata based models, in: Brooks, P. Maes (Eds.), Proc. Fourth Internat. Workshop on the Synthesis and Simulation of Living Systems Artificial Life IV, MIT Press, Cambridge, MA, 1994, pp. 382-387.
2. Brémaud P. Markov Chains, Gibbs Fileds, Monte Carlo Simulation, and Queues (1999), Springer, Berlin
3. Buvel R., and Ingerson T. Structure in asynchronous cellular automata. Physica D 1 (1984) 59-68
4. N. Fatès, Robustesse de la dynamique des systèmes discrets: le cas de l'asychronisme dans les automates cellualires, Ph.D. Thesis, Ecole Normale Supérieure de Lyon, 2004.
5. N. Fatès, M. Morvan, An experimental study of robustness to asynchronism for elementary cellular automata, Complex Systems, 16 (1) (2005) 1-27.
6. N. Fatès, M. Morvan, Perturbing the topology of the game of life increases its robustness to asynchrony, in: LNCS Proc. Sixth Internat. Conf. on Cellular Automata for Research and Industry (ACRI 2004), Vol. 3305, Amsterdam, The Netherlands, 2004, pp. 111-120.
7. P. Gács, Deterministic computations whose history is independent of the order of asynchronous updating, 2003, 〈http://arXiv.org/abs/cs/0101026〉.
8. Grimmet G., and Stirzaker D. Probability and Random Process. third ed. (2001), Oxford University Press, Oxford
9. Huberman B.A., and Glance N. Evolutionary games and computer simulations. Proc. Nat. Acad. Sci. U.S.A. 90 (1993) 7716-7718
10. P.-Y. Louis, Automates cellulaires probabilistes: mesures stationnaires, mesures de gibbs associées et ergodicité, Ph.D. Thesis, Univ. des Sciences et Technologies de Lille, September 2002.
11. M. Mattera, Annihilating random walks and perfect matchings of planar graphs, Discrete Mathematics and Theoretical Computer Science AC (2003) 173-180.
12. Nowak M.A., and May R.M. Evolutionary games and spatial chaos. Nature (London) 359 (1992) 826-829
13. Schönfisch B., and de Roos A. Synchronous and asynchronous updating in cellular automata. Biosystems 51 (1999) 123-143
14. Wolfram S. Universality and complexity in cellular automata. Physica D 10 (1984) 1-35