In this paper we introduce sand automata in order to give a common and useful framework for the study of most of the models of sandpiles. Moreover we give the possibility to have sources and sinks of "sand grains". We prove a result which shows that the class of sand automata is rich enough to simulate any reasonable model of sandpiles based on local interaction rules. We also give an algorithm to find the fixed points of the evolutions of the sandpiles. Finally we prove that reversibility is equivalent to bijectivity. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Cervelle, J., & Formenti, E. (2003). On sand automata. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2607, 642–653. https://doi.org/10.1007/3-540-36494-3_56
Mendeley helps you to discover research relevant for your work.