The derivation of distributed termination detection algorithms from garbage collection schemes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computing with graph rewriting systems with priorities
Theoretical Computer Science
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Terminating iterative solution of simultaneous equations in distributed message passing systems
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Self-stabilization
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Graph Rewriting Systems with Priorities
WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Terminability and compensatibility of cycles in business processes with a process-oriented trigger
Data & Knowledge Engineering
Graph Multiset Transformation as a Framework for Massively Parallel Computation
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Natural Computing: an international journal
Characterizing topological assumptions of distributed algorithms in dynamic networks
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |
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.