A lightweight method for automated design of convergence
Design and verification of Self-Stabilizing (SS) network protocols are difficult tasks in part because of the requirement that a SS protocol must recover to a set of legitimate states from any state in its state space (when perturbed by transient faults). Moreover, distribution issues exacerbate the design complexity of SS protocols as processes should take local actions that result in global recovery/convergence of a network protocol. As such, most existing design techniques focus on protocols that are locally-correctable. To facilitate the design of finite-state SS protocols (that may not necessarily be locally-correctable), this paper presents a lightweight formal method supported by a software tool that automatically adds convergence to non-stabilizing protocols. We have used our method/tool to automatically generate several SS protocols with up to 40 processes (and 340 states) in a few minutes on a regular PC. Surprisingly, our tool has automatically synthesized both protocols that are the same as their manually-designed versions as well as new solutions for well-known problems in the literature (e.g., Dijkstra's token ring ). Moreover, the proposed method has helped us reveal flaws in a manually designed SS protocol. © 2011 IEEE.
Proceedings - 25th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2011
A lightweight method for automated design of convergence.
Proceedings - 25th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2011, 219-230.
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/10655