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.
Bisimulation is a concept in the field of concurrency theory and formal methods, particularly in the study of transition systems and processes. It is a relationship between state-transition systems that allows us to determine if two systems behave similarly in a formal sense. The idea is to compare two systems based on their ability to mimic each other's behavior, particularly in terms of their possible state transitions.
New to topics? Read the docs here!