On the Limits and Practice of Automatically Designing Self-Stabilization

The Distributed Complexity of Locally Checkable Problems on Paths is Decidable

“…While algorithm synthesis problems are typically undecidable, there are areas of theoretical computer science in which we can make use of computational techniques in algorithm design-at least in principle, and sometimes also in practice. One such area is the theory of distributed computing; see [3,5,6,9,11,17,19,26] for examples of recent success stories. In this work we bring yet another piece of good news: Consider this setting: there is a computer network that consists of a path with n nodes, the nodes are labeled with inputs from a constant-sized set, and the task is to find output labels from a constant-sized set subject to some local constraints.…”