1 citations · 2 across the 4 of their papers we have counts for
13 papers · 1 filter
GKAT with Hoare Hypotheses
Jurriaan Rot, Todd Schmid, Jana Wagemaker
Guarded Kleene Algebra with Tests (GKAT) is a variant of Kleene algebra which allows for reasoning about simple imperative programs, and which features a decision procedure for pro…
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…
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…
Initial Algebra Correspondence under Reachability Conditions
Mayuko Kori, Kazuki Watanabe, Jurriaan Rot
Suitable reachability conditions can make two different fixed point semantics of a transition system coincide. For instance, the total and partial expected reward semantics on Mark…
A Unifying Approach to Product Constructions for Quantitative Temporal Inference
Kazuki Watanabe, Sebastian Junges, Jurriaan Rot +1
Probabilistic programs are a powerful and convenient approach to formalise distributions over system executions. A classical verification problem for probabilistic programs is temp…
Relational Connectors and Heterogeneous Bisimulations
Pedro Nora, Jurriaan Rot, Lutz Schröder +1
While behavioural equivalences among systems of the same type, such as Park/Milner bisimilarity of labelled transition systems, are an established notion, a systematic treatment of…