Synthesizing Parameterized Self-stabilizing Rings with Constant-Space Processes - Fundamentals of Software Engineering Access content directly
Conference Papers Year : 2017

Synthesizing Parameterized Self-stabilizing Rings with Constant-Space Processes

Alex P. Klinkhamer
  • Function : Author
  • PersonId : 1007024
Ali Ebnenasir
  • Function : Author
  • PersonId : 999411


This paper investigates the problem of synthesizing parameterized rings that are “self-stabilizing by construction”. While it is known that the verification of self-stabilization for parameterized unidirectional rings is undecidable, we present a counterintuitive result that synthesizing such systems is decidable! This is surprising because it is known that, in general, the synthesis of distributed systems is harder than their verification. We also show that synthesizing self-stabilizing bidirectional rings is an undecidable problem. To prove the decidability of synthesis for unidirectional rings, we propose a sound and complete algorithm that performs the synthesis in the local state space of processes. We also generate strongly stabilizing rings where no fairness assumption is made. This is particularly noteworthy because most existing verification and synthesis methods for parameterized systems assume a fair scheduler.
Fichier principal
Vignette du fichier
459025_1_En_7_Chapter.pdf (316.7 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01760852 , version 1 (06-04-2018)





Alex P. Klinkhamer, Ali Ebnenasir. Synthesizing Parameterized Self-stabilizing Rings with Constant-Space Processes. 7th International Conference on Fundamentals of Software Engineering (FSEN), Apr 2017, Teheran, Iran. pp.100-115, ⟨10.1007/978-3-319-68972-2_7⟩. ⟨hal-01760852⟩
72 View
66 Download



Gmail Facebook X LinkedIn More