Coalgebraic Weak Bisimulation from Recursive Equations over Monads

DOI10.1007/978-3-662-43951-7_17zbMath1409.68188arXiv1404.1215OpenAlexW1518679248MaRDI QIDQ5167838

Dirk Pattinson, Sergei S. Goncharov

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categories of machines, automata (18B20) Eilenberg-Moore and Kleisli constructions for monads (18C20)

Related Items (6)

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 ⋮ A general account of coinduction up-to ⋮ Unnamed Item

This page was built for publication: Coalgebraic Weak Bisimulation from Recursive Equations over Monads