Weak bisimulation for coalgebras over order enriched monads

DOI10.2168/LMCS-11(2:14)2015zbMath1391.68083arXiv1310.3656OpenAlexW2166514831MaRDI QIDQ2941763

Tomasz Brengos

Publication date: 25 August 2015

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.3656

zbMATH Keywords

coalgebratopologybisimulationlogicsaturationmonadweak bisimulationsilent transitioninternal transitionKleisli algebraordered saturation monad

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Eilenberg-Moore and Kleisli constructions for monads (18C20)

Related Items (9)

Bisimulation as a logical relation ⋮ Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure ⋮ Behavioural equivalences for coalgebras with unobservable moves ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Up-to Techniques for Branching Bisimilarity ⋮ A general account of coinduction up-to ⋮ Unnamed Item ⋮ Unnamed Item

Uses Software

• Prover9
• Mace4

This page was built for publication: Weak bisimulation for coalgebras over order enriched monads