In this paper, we are interested in transformations of selfstabilizing algorithms from one model to another that preserve stabilization. We propose an easy technique for proving correctness of a natural class of transformations of self-stabilizing algorithms from any model to any other. We present a new transformation of self-stabilizing algorithms from a message passing model to a shared memory model with a finite number of registers of bounded size and processors of bounded memory and prove it correct using our technique. This transformation is not wait-free, but we prove that no such transformation can be wait-free. For our transformation, we use a new self-stabilizing token-passing algorithm for the shared memory model. This algorithm stabilizes in O(n log2 n) rounds, which improves existing algorithms.
CITATION STYLE
Ioannidou, K. (2002). Transformations of self-stabilizing algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2508, pp. 103–117). Springer Verlag. https://doi.org/10.1007/3-540-36108-1_7
Mendeley helps you to discover research relevant for your work.