4 papers
Constructing Witnesses for Lower Bounds on Behavioural Distances
Ruben Turkenburg, Harsh Beohar, Franck van Breugel +2
Behavioural distances provide a robust alternative to notions of equivalence such as bisimilarity in the context of probabilistic transition systems. They can be defined as least f…
Trees in Coalgebra from Generalized Reachability
Thorsten Wißmann, Bálint Kocsis, Jurriaan Rot +1
An automaton is called reachable if every state is reachable from the initial state. This notion has been generalized coalgebraically in two ways: first, via a universal property o…
A Categorical Approach to Coalgebraic Fixpoint Logic
Ezra Schoen, Clemens Kupke, Jurriaan Rot +1
We define a framework for incorporating alternation-free fixpoint logics into the dual-adjunction setup for coalgebraic modal logics. We achieve this by using order-enriched catego…
Proving Behavioural Apartness
Ruben Turkenburg, Harsh Beohar, Clemens Kupke +1
Bisimilarity is a central notion for coalgebras. In recent work, Geuvers and Jacobs suggest to focus on apartness, which they define by dualising coalgebraic bisimulations. This yi…