Y. [. Amoroso and . Patt, Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures, Journal of Computer and System Sciences, vol.6, issue.5, pp.448-464, 1972.
DOI : 10.1016/S0022-0000(72)80013-8

C. Barrett, M. Wolinsky, and M. Olesen, Emergent Local Properties in Particle Hopping Traffic Simulations, Proc. Traffic and Granular Flow Los Alamos Unclassified Internal Report, pp.95-4368, 1995.

H. [. Barrett, I. Hunt, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz et al., Dichotomy Results for Sequential Dynamical Systems, 2000.

C. Barrett, H. B. Hunt, I. , M. V. Marathe, S. S. Ravi et al., Predecessor and Permutation Existence Problems for Sequential Dynamical Systems, 2001.
URL : https://hal.archives-ouvertes.fr/hal-01183322

C. [. Barrett and . Reidys, Elements of a theory of computer simulation I: Sequential CA over random graphs, Applied Mathematics and Computation, vol.98, issue.2-3, pp.241-259, 1999.
DOI : 10.1016/S0096-3003(97)10166-7

C. Barrett, H. Mortveit, and C. Reidys, Elements of a theory of simulation II: sequential dynamical systems, Applied Mathematics and Computation, vol.107, issue.2-3, pp.2-3, 1999.
DOI : 10.1016/S0096-3003(98)10114-5

H. [. Barrett, C. Mortveit, and . Reidys, Elements of a theory of computer simulation III: equivalence of SDS, 2000.

]. R. Be+99 and . Beckman, TRANSIMS: Case Study, pp.97-4502, 1999.

C. [. Buss, J. Papadimitriou, and . Tsitsiklis, On the predictability of coupled automata: an allegory about chaos, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pp.525-539, 1990.
DOI : 10.1109/FSCS.1990.89601

]. B. Du94 and . Durand, Inversion of 2D cellular automata: some complexity results, Theoretical Computer Science, vol.134, issue.2, pp.387-401, 1994.

D. [. Garey and . Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, 1979.

]. P. Ga97 and . Gacs, Deterministic computations whose history is independent of the order of asynchronous updating, 1997.

C. [. Gouda and . Chang, Proving liveness for networks of communicating finite state machines, ACM Transactions on Programming Languages and Systems, vol.8, issue.1, pp.154-182, 1986.
DOI : 10.1145/5001.5002

]. F. Gr87 and . Green, NP-Complete Problems in Cellular Automata, Complex Systems, vol.1, issue.3, pp.453-474, 1987.

G. Manzini and L. Margara, Invertible Linear Cellular Automata over m J. of Computer and System Sciences (JCSS), Ma98] B. Martin. A Geometrical Hierarchy of Graphs via Cellular Automata. Proc. MFCS'98, pp.60-67, 1998.

C. [. Mortveit, Reidys: Discrete sequential dynamical systems, Discrete Mathematics, 2000.
DOI : 10.1016/s0012-365x(00)00115-1
URL : http://doi.org/10.1016/s0012-365x(00)00115-1

E. [. Nichitiu and . Remila, Simulations of Graph Automata, Proc. MFCS'98 Satellite Workshop on Cellular Automata, 1998.

]. Z. Rk94 and . Roka, One-way cellular automata on Cayley graphs, Theoretical Computer Science, vol.132, issue.1 2, pp.259-290, 1994.

]. D. Ri72 and . Richardson, Tessellations with local transformations, J. of Computer and System Sciences (JCSS), vol.6, pp.373-388, 1972.

]. C. Re00a and . Reidys, Sequential dynamical systems: phase space properties, Advances in Applied Mathematics

]. C. Ro99 and . Robinson, Dynamical systems: stability, symbolic dynamics and chaos, 1999.

]. K. Su95 and . Sutner, On the computational complexity of finite cellular automata, Journal of Computer and System Sciences, vol.50, issue.1, pp.87-97, 1995.

]. K. Su98 and . Sutner, Computation theory of cellular automata, MFCS'98 Satellite Workshop on Cellular Automata Bruno, Czech Republic, 1998.

G. [. Schittenkopf, W. Deco, and . Brauer, Finite automata-models for the investigation of dynamical systems, Information Processing Letters, vol.63, issue.3, pp.137-141, 1997.
DOI : 10.1016/S0020-0190(97)00110-5

H. [. Toffoli and . Margolus, Invertible cellular automata: A review, Theory and applications of cellular automata, 1987.
DOI : 10.1016/0167-2789(90)90185-R