Abstract
An approach to analyzing self-stabilization based on the finite-state machine model is presented. A finite-state machine is used to model the behavior of each node in a distributed system. when the self-stabilizing algorithms are applied. The approach is useful for analyzing the correctness of self-stabilizing algorithms and their time complexity. A self-stabilizing algorithm for finding maximal matching is used as an example to show how the finite-state machine model is applied. A simpler proof for the correctness and an upper bound of the time complexity tighter than the one proved by a variant function are attained. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
