Network Applications of Graph Bisimulation

Abstract

Synchronising Graphs is a system of parallel graph transformation designed for modeling process interaction in a network environment. We propose a theory of context-free synchronising graphs and a novel notion of bisimulation equivalence which is shown to be a congruence with respect to graph composition and node restriction. We use this notion of equivalence to study some sample network applications, and show that our bisimulation equivalence captures notions like functional equivalence of logical switches, equivalence of channel implementations and level of fault tolerance of a network

Depletable Channels: Dynamics and Behaviour

“…However, we do not have a process syntax and just write networks via their physical topology, assuming that some suitable software is hardcoded into every node of the net to properly implement some routing strategy. A somehow similar approach has been followed by some of the authors in a previous paper [7], where the framework was based on (hyper)graph rewriting. There, apart from functional equivalence, other network measures (e.g., robustness) were related to bisimulation in the model.…”