Abstract
A unified and general scheme for detecting the termination of distributed computations is proposed. This scheme uses the encoding of distributed algorithms in form of graph rewriting systems to transform the problem of adding termination detection to a distributed computation into an operation on graph rewriting systems. Various examples are used to illustrate this approach.
Cite
CITATION STYLE
Godard, E., Mètivier, Y., Mosbah, M., & Sellami, A. (2002). Termination detection of distributed algorithms by graph relabelling systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2505, pp. 106–119). Springer Verlag. https://doi.org/10.1007/3-540-45832-8_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
