Weak bisimulation for coalgebras over order enriched monads

Abstract

The paper introduces the notion of a weak bisimulation for coalgebras whose type is a monad satisfying some extra properties. In the first part of the paper we argue that systems with silent moves should be modelled coalgebraically as coalgebras whose type is a monad. We show that the visible and invisible part of the functor can be handled internally inside a monadic structure. In the second part we introduce the notion of an ordered saturation monad, study its properties, and show that it allows us to present two approaches towards defining weak bisimulation for coalgebras and compare them. We support the framework presented in this paper by two main examples of models: labelled transition systems and simple Segala systems.

44 pages

References in corpus (1)

• Relating coalgebraic notions of bisimulation

Cited by in corpus (7)

• Behavioural equivalences for coalgebras with unobservable moves
• Relating Apartness and Bisimulation
• How to Kill Epsilons with a Dagger -- A Coalgebraic Take on Systems with Algebraic Label Structure
• Up-to Techniques for Branching Bisimilarity
• Behavioural equivalences for timed systems
• Lax functors and coalgebraic weak bisimulation
• A coalgebraic take on regular and $\omega$-regular behaviours