Fully asynchronous behavior of double-quiescent elementary cellular automata

Lecture Notes in Computer Science

Volumn 3618, Issue , 2005, Pages 316-327

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

^a UNIVERSITÉ DE LYON   (France)

^b INSTITUT UNIVERSITAIRE DE FRANCE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; PERTURBATION TECHNIQUES; PROBABILITY;

ASYNCHRONOUS BEHAVIOR; AUTOMATONS; CELLULAR AUTOMATA; TRANSITION RULE;

AUTOMATA THEORY;

EID: 26844497660     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11549345_28     Document Type: Conference Paper

References (14)

1. H. Bersini and V. Detours. Asynchrony induces stability in cellular automata based models. In Brooks, Maes, and Pattie, editors, Proceedings of the 4th International Workshop on the Synthesis and Simulation of Living Systems Artificial LifeIV, pages 382-387. MIT Press, July 1994.
2. P. Brémaud. Markov chains, Gibbs fileds, Monte Carlo simulation, and queues. Springer, 1999.
3. R.L. Buvel and T.E. Ingerson. Structure in asynchronous cellular automata. Physica D, 1:59-68, 1984.
4. N. Fatès and M. Morvan. An experimental study of robustness to asynchronism for elementary cellular automata. Submitted, arxiv:nlin.CG/0402016, 2004.
5. N. Fatès and M. Morvan. Perturbing the topology of the game of life increases its robustness to asynchrony. In LNCS Proc. of 6th Int. Conf. on Cellular Automata for Research and Industry (ACRI 2004), volume 3305, pages 111-120, Oct. 2004.
6. N. Fatès, M. Morvan, N. Schabanel, and E. Thierry. Fully asynchronous behavior of double-quiescent elementary cellular automata. Research report LIP RR2005-04, ENS Lyon, 2005.
7. G. Grimmet and D. Stirzaker. Probability and Random Process. Oxford University Press, 3rd edition, 2001.
8. P. Gács. Deterministic computations whose history is independent of the order of asynchronous updating. http://arXiv.org/abs/cs/0101026, 2003.
9. B. A. Huberman and N. Glance. Evolutionary games and computer simulations. Proceedings of the National Academy of Sciences, USA, 90:7716-7718, Aug. 1993.
10. P.-Y. Louis. Automates Cellulaires Probabilistes: mesures stationnaires, mesures de Gibbs associées et ergodicité. PhD thesis, Université de Lille I, Sep. 2002.
11. M. Mattera. Annihilating random walks and perfect matchings of planar graphs. Discrete Mathematics and Theoretical Computer Science, AC:173-180, 2003.
12. M. A. Nowak and R. M. May. Evolutionary games and spatial chaos. Nature (London), 359:826-829, 1992.
13. B. Schönfisch and A. de Roos. Synchronous and asynchronous updating in cellular automata. BioSystems, 51:123-143, 1999.
14. S. Wolfram. Universality and complexity in cellular automata. Physica D, 10:1-35, 1984.