Visualization of Distributed Algorithms Based on Graph Relabelling Systems1 1This work has been supported by the European TMR research network GETGRATS, and by the “Conseil Régional d' Aquitane”.

AbstractIn this paper, we present a uniform approach to simulate and visualize distributed algorithms encoded by graph relabelling systems. In particular, we use the distributed applications of local relabelling rules to automatically display the execution of the whole distributed algorithm. We have developed a Java prototype tool for implementing and visualizing distributed algorithms. We illustrate the different aspects of our framework using various distributed algorithms including election and spanning trees

Graph Relabelling Systems A Tool for Encoding, Proving, Studying and Visualizing Distributed Algorithms

International audienc

Graph rewriting systems with priorities

International audienc

Computing with graph rewriting systems with priorities

International audienc

Computing trees with graph rewriting systems with priorities

International audienc

ANIGRAF: An Interactive System for the Animation of Graph Rewriting Systems with Priorities

International audienc