A self-stabilizing system is one that guarantees reaching a set of legitimate states from any arbitrary initial state. Designing distributed self-stabilizing protocols is often a complex task and developing their proof of correctness is known to be significantly more tedious. In this paper, we propose an SMT-based method that automatically synthesizes a self-stabilizing protocol, given the network topology of distributed processes and description of the set of legitimate states. We also report successful automated synthesis of Dijkstra’s token ring and distributed maximal matching.
CITATION STYLE
Faghih, F., & Bonakdarpour, B. (2014). SMT-based synthesis of distributed self-stabilizing systems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8756, 165–179. https://doi.org/10.1007/978-3-319-11764-5_12
Mendeley helps you to discover research relevant for your work.