7 papers
Tree Automata Acceptance up to Measurable Defect
Anita Moyasari, Harsh Beohar, Charles Grellois +1
Automata acceptance can, in several situations of interest, be captured game-theoretically via acceptance games. The existence of a winning strategy for Verifier then captures the…
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…
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…
Relative fixed points of functors
Ezra Schoen, Jade Master, Clemens Kupke
We show how the relatively initial or relatively terminal fixed points for a well-behaved functor form a pair of adjoint functors between -coalgebras and -algebras. We us…
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…
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…