Tomasz Brengos - Weak bisimulation for coalgebras over order enriched monads

lmcs:1574 - Logical Methods in Computer Science, June 25, 2015, Volume 11, Issue 2 - https://doi.org/10.2168/LMCS-11(2:14)2015
Weak bisimulation for coalgebras over order enriched monadsArticle

Authors: Tomasz Brengos ORCID

    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.


    Volume: Volume 11, Issue 2
    Published on: June 25, 2015
    Submitted on: October 14, 2013
    Keywords: Computer Science - Logic in Computer Science

    6 Documents citing this article

    Consultation statistics

    This page has been seen 1082 times.
    This article's PDF has been downloaded 335 times.