Self-stabilizing Distributed Algorithms by Gellular Automata - Cellular Automata and Discrete Complex Systems Access content directly
Conference Papers Year : 2020

Self-stabilizing Distributed Algorithms by Gellular Automata

Taiga Hongu
  • Function : Author
  • PersonId : 1133887
Masami Hagiya
  • Function : Author
  • PersonId : 1066769

Abstract

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.
Fichier principal
Vignette du fichier
496967_1_En_7_Chapter_OnlinePDF.PDF (957.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03659466 , version 1 (05-05-2022)

Licence

Attribution

Identifiers

Cite

Taiga Hongu, Masami Hagiya. Self-stabilizing Distributed Algorithms by Gellular Automata. 26th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Aug 2020, Stockholm, Sweden. pp.86-98, ⟨10.1007/978-3-030-61588-8_7⟩. ⟨hal-03659466⟩
31 View
10 Download

Altmetric

Share

Gmail Facebook X LinkedIn More