On path-based coalgebras and weak notions of bisimulation

DOI10.4230/LIPICS.CALCO.2017.6MaRDI QIDQ4580201zbMATH OpenFDO

Authors Harsh Beohar, Sebastian Küpper

Publication date 13 August 2018

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

zbMATH Keywords

pathscoalgebrasbranching bisimulationexecutions

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Weak bisimulation for action-type coalgebras (extended abstract)
• Coalgebraic weak bisimulation for action-type systems
• Bisimulation for probabilistic transition systems: a coalgebraic approach
• Weak bisimulations for coalgebras over ordered functors
• Coalgebraic Weak Bisimulation from Recursive Equations over Monads

Cited in

(12)

• scientific article; zbMATH DE number 7407787 (Why is no real title available?)
• Bisimulation as a logical relation
• An exercise on transition systems
• From branching to linear time, coalgebraically
• On coalgebras with internal moves
• From transitions to executions
• Behavioural equivalences for coalgebras with unobservable moves
• From branching to linear time, coalgebraically
• scientific article; zbMATH DE number 6864542 (Why is no real title available?)
• Bisimulation proof methods in a path-based specification language for polynomial coalgebras
• Path category for free. Open morphisms from coalgebras with non-deterministic branching
• Bisimulation maps in presheaf categories

This page was built for publication: On path-based coalgebras and weak notions of bisimulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580201)