On Coalgebras with Internal Moves - Coalgebraic Methods in Computer Science Access content directly
Conference Papers Year : 2014

On Coalgebras with Internal Moves

Tomasz Brengos
  • Function : Author
  • PersonId : 995261


In the first part of the paper we recall the coalgebraic approach to handling the so-called invisible transitions that appear in different state-based systems semantics. We claim that these transitions are always part of the unit of a certain monad. Hence, coalgebras with internal moves are exactly coalgebras over a monadic type. The rest of the paper is devoted to supporting our claim by studying two important behavioural equivalences for state-based systems with internal moves, namely: weak bisimulation and trace semantics. We continue our research on weak bisimulations for coalgebras over order enriched monads. The key notions used in this paper and proposed by us in our previous work are the notions of an order saturation monad and a saturator. A saturator operator can be intuitively understood as a reflexive, transitive closure operator. There are two approaches towards defining saturators for coalgebras with internal moves. Here, we give necessary conditions for them to yield the same notion of weak bisimulation. Finally, we propose a definition of trace semantics for coalgebras with silent moves via a uniform fixed point operator. We compare strong and weak bisimilation together with trace semantics for coalgebras with internal steps.
Fichier principal
Vignette du fichier
328263_1_En_5_Chapter.pdf (488.92 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01408753 , version 1 (05-12-2016)





Tomasz Brengos. On Coalgebras with Internal Moves. 12th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Apr 2014, Grenoble, France. pp.75-97, ⟨10.1007/978-3-662-44124-4_5⟩. ⟨hal-01408753⟩
46 View
83 Download



Gmail Facebook X LinkedIn More