On the computational power of self-stabilizing systems
Theoretical Computer Science
A self-stabilizing algorithm for the maximum flow problem
Distributed Computing
Self-stabilizing token circulation in uniform networks
Distributed Computing
| Hi-index | 0.00 |
The message system considered in the paper consists of a finite set of places, each of them capable to store a fixed number of messages. Places can be joined by links and then they are called neighbours. Messages are created and moved from neighbour to neighbour until reaching their destinations, and then disappear. The aim of this paper is to define a rule of message moving, which ensures responsiveness of the system, i.e. a rule that guarantees any message appearing in the system to eventually reach its destination. Such a rule, based on so-called "potential function" of messages, is found and its adequacy is proved.