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. © 2008 Springer-Verlag Berlin Heidelberg.