Computing maximal weak and other bisimulations
We present and compare several algorithms for computing the maximal strong bisimulation, the maximal divergence-respecting delay bisimulation, and the maximal divergence-respecting weak bisimulation of a generalised labelled transition system. These bisimulation relations preserve CSP semantics, as...
Main Authors: | Roscoe, A, Boulgakov, A, Gibson-Robinson, T |
---|---|
Format: | Journal article |
Published: |
Springer London
2015
|
Similar Items
-
Computing maximal bisimulations
by: Bougakov, A, et al.
Published: (2014) -
Coalgebraic Weak Bisimulation for Action-Type Systems
by: A. Sokolova, et al.
Published: (2009-12-01) -
Bisimulation and refinement reconciled
by: Roscoe, A, et al.
Published: (2003) -
Weak bisimulation for coalgebras over order enriched monads
by: Tomasz Brengos
Published: (2015-06-01) -
Design Research in Cyber-Physical Systems through Weak-Bisimulation
by: Roy Mccann, et al.
Published: (2011-12-01)