4452 articles – 13148 references  [version française]
HAL: hal-00310905, version 1

Detailed view  Export this paper
Theoretical Computer Science 381 (2007) 1-28
From sandpiles to sand automata
Enrico Formenti 1, Julien Cervelle 2, Benoît Masson 1, 3
(2007)

We introduce a new model for simulating natural phenomena. We address several issues: topology, basic set properties like injectivity and surjectivity, reversibility, and decidability questions about a special kind of conservation law called grain conservation and ultimate periodicity.
1:  Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe MC3
Université Nice Sophia Antipolis [UNS] – CNRS : UMR7271
2:  Laboratoire d'Informatique Gaspard-Monge (LIGM)
Université Paris-Est Marne-la-Vallée (UPEMLV) – ESIEE – Ecole des Ponts ParisTech – Fédération de Recherche Bézout – CNRS : UMR8049
3:  Laboratoire d'informatique Fondamentale de Marseille (LIF)
CNRS : UMR6166 – Université de la Méditerranée - Aix-Marseille II – Université de Provence - Aix-Marseille I
Computer Science/Modeling and Simulation

Computer Science/Discrete Mathematics

Mathematics/Dynamical Systems

Nonlinear Sciences/Adaptation and Self-Organizing Systems
Sandpiles – Sand automata – Reversibility – Undecidability – Grain conservation – Ultimate periodicity.