Bisimulation
= Bisimulation
{title2=$Z\subseteq G\times H$}
{wiki}
A bisimulation relates the roots of two <rooted directed graphs> and matches every successor move in either graph with a successor move in the other leading to related vertices. Multiple successors may be related to the same vertex. This local matching is weaker than graph isomorphism.