Local reasoning for global convergence of parameterized rings
This paper presents a method that can generate Self-Stabilizing (SS) parameterized protocols that are generalizable; i.e., correct for arbitrary number of finite-state processes. Specifically, we present necessary and sufficient conditions specified in the local state space of the representative process of parameterized rings for deadlock-freedom in their global state space. Moreover, we introduce sufficient conditions that guarantee livelock-freedom in arbitrary-sized unidirectional rings. We illustrate the proposed approach in the context of several classic examples including a maximal matching protocol and an agreement protocol. More importantly, the proposed method lays the foundation of an approach for automated design of global convergence in the local state space of the representative process. © 2012 IEEE.
Proceedings - International Conference on Distributed Computing Systems
Local reasoning for global convergence of parameterized rings.
Proceedings - International Conference on Distributed Computing Systems, 496-505.
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/10570