57 citations · 208 across the 27 of their papers we have counts for
4 papers · 1 filter
Unambiguous Acceptance of Thin Coalgebras
Anton Chernev, Corina Cîrstea, Helle Hvid Hansen +1
Automata admitting at most one accepting run per structure, known as unambiguous automata, find applications in verification of reactive systems as they extend the class of determi…
Expressivity of bisimulation pseudometrics over analytic state spaces
Daniel Luckhardt, Harsh Beohar, Clemens Kupke
A Markov decision process (MDP) is a state-based dynamical system capable of describing probabilistic behaviour with rewards. In this paper, we view MDPs as coalgebras living in th…
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…
Thin Coalgebraic Behaviours Are Inductive
Anton Chernev, Corina Cîrstea, Helle Hvid Hansen +1
Coalgebras for analytic functors uniformly model graph-like systems where the successors of a state may admit certain symmetries. Examples of successor structure include ordered tu…