6 papers
A coalgebraic higher-order modal fixed-point logic
Ryan Tay, Harsh Beohar, Charles Grellois
We introduce a coalgebraic extension of the higher-order modal fixed-point logic (HFL) which subsumes both HFL and its probabilistic extension. We show that the emptiness problem f…
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…
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…
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…
On Kleisli liftings and decorated trace semantics
Daniel Luckhardt, Harsh Beohar, Sebastian Küpper
It is well known that Kleisli categories provide a natural language to model side effects. For instance, in the theory of coalgebras, behavioural equivalence coincides with languag…
Relating Apartness and Branching Bisimulation Games
Jurriaan Rot, Sebastian Junges, Harsh Beohar
Geuvers and Jacobs (LMCS 2021) formulated the notion of apartness relation on state-based systems modelled as coalgebras. In this context apartness is formally dual to bisimilarity…