Abstract
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.
Author supplied keywords
Cite
CITATION STYLE
Mazurkiewicz, A., & Wróblewski, D. (2002). Messages, clocks, and gravitation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2296, pp. 187–196). Springer Verlag. https://doi.org/10.1007/3-540-45941-3_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
