Skip to Main content Skip to Navigation
Conference papers

Synthesizing Parameterized Self-stabilizing Rings with Constant-Space Processes

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Friday, April 6, 2018 - 5:20:43 PM
Last modification on : Saturday, February 27, 2021 - 3:52:02 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



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⟩



Record views


Files downloads