Self-Stabilizing Gellular Automata

Gellular automata are a class of cellular automata having the features: asynchrony, Boolean totality, and non-camouflage. Gellular automata have been introduced as models of smart materials made of porous gels and chemical solutions, which are expected to have abilities such as self-repair. Therefore investigating gellular automata that are self-stable is an important research topic as self-stability implies convergence to a target configuration even under external disturbances. In this paper, we present gellular automata which solve maze problems self-stably. We also briefly describe gellular automata that solve the leader election problem. We thus discuss the possibility of implementing self-stable distributed algorithms by gellular automata.