On path-based coalgebras and weak notions of bisimulation

DOI10.4230/LIPICS.CALCO.2017.6zbMATH Open1433.68237arXiv1705.08715MaRDI QIDQ4580201FDOQ4580201

Authors: Harsh Beohar, Sebastian Küpper 

Publication date: 13 August 2018

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

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

zbMATH Keywords

pathscoalgebrasbranching bisimulationexecutions

Mathematics Subject Classification ID

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

Cited In (11)

• From transitions to executions
• Bisimulation as a logical relation
• Bisimulation maps in presheaf categories
• Title not available (Why is that?)
• From branching to linear time, coalgebraically
• Bisimulation proof methods in a path-based specification language for polynomial coalgebras
• On coalgebras with internal moves
• An exercise on transition systems
• From branching to linear time, coalgebraically
• Title not available (Why is that?)
• Behavioural equivalences for coalgebras with unobservable moves

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)