%0 Conference Proceedings
%T Self-stabilizing Distributed Algorithms by Gellular Automata
%+ The University of Tokyo (UTokyo)
%A Hongu, Taiga
%A Hagiya, Masami
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 26th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA)
%C Stockholm, Sweden
%Y Hector Zenil
%I Springer International Publishing
%3 Cellular Automata and Discrete Complex Systems
%V LNCS-12286
%P 86-98
%8 2020-08-10
%D 2020
%R 10.1007/978-3-030-61588-8_7
%K Gellular automata
%K Solving a maze
%K Distance-2 coloring
%K Spanning tree construction
%K Self-Stability
%Z Computer Science [cs]Conference papers
%X Gellular automata are cellular automata with the properties of asynchrony, Boolean totality, and non-camouflage. In distributed computing, it is essential to determine whether problems can be solved by self-stable gellular automata. From any initial configuration, self-stable gellular automata converge to desired configurations, as self-stability implies the ability to recover from temporary malfunctions in transitions or states. In this paper, we show that three typical problems in distributed computing, namely, solving a maze, distance-2 coloring, and spanning tree construction, can be solved with self-stable gellular automata.
%G English
%Z TC 1
%Z WG 1.5
%2 https://inria.hal.science/hal-03659466/document
%2 https://inria.hal.science/hal-03659466/file/496967_1_En_7_Chapter_OnlinePDF.PDF
%L hal-03659466
%U https://inria.hal.science/hal-03659466
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG1-5
%~ IFIP-AUTOMATA
%~ IFIP-LNCS-12286