A general notion of bisimulation is studied for dynamical systems. An algebraic characterization of bisimulation together with an algorithm for computing the maximal bisimulation relation is derived using geometric control theory. Bisimulation of dynamical systems is shown to be a concept which unifies the system-theoretic concepts of state space equivalence and state space reduction, and which...

Open bisimulation is the greatest bisimulation congruence for the π-calculus. In open bisimulation, free names in processes are treated as variables that may be instantiated; in contrast to late bisimulation where free names are constants. An established modal logic due to Milner, Parrow, and Walker characterises late bisimulation, that is, two processes satisfy the same set of formulae if and ...

In TCS 146, Bard Bloom presented rule formats for four main notions of bisimulation with silent moves. He proved that weak bisimulation equivalence is a congruence for any process algebra defined by WB cool rules, and established similar results for rooted weak bisimulation (Milner’s “observational congruence”), branching bisimulation and rooted branching bisimulation. This study reformulates B...