activity
20122026
most citedCoinduction up to in a fibrational setting

40 citations · 156 across the 43 of their papers we have counts for

collaborators
Showing 2024 · cs.LOShow all

10 papers · 2 filters

cs.LO2024★ 1 cited

Intrinsically Correct Sorting in Cubical Agda

Cass Alexandru, Vikraman Choudhury, Jurriaan Rot +1

The paper "Sorting with Bialgebras and Distributive Laws" by Hinze et al. uses the framework of bialgebraic semantics to define sorting algorithms. From distributive laws between f…

cs.LO2024

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…

cs.LO2024★ 1 cited

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…

cs.LO2024

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…

cs.LO2024

State Matching and Multiple References in Adaptive Active Automata Learning

Loes Kruger, Sebastian Junges, Jurriaan Rot

Active automata learning (AAL) is a method to infer state machines by interacting with black-box systems. Adaptive AAL aims to reduce the sample complexity of AAL by incorporating…

cs.LO2024

Composing Codensity Bisimulations

Mayuko Kori, Kazuki Watanabe, Jurriaan Rot +1

Proving compositionality of behavioral equivalence on state-based systems with respect to algebraic operations is a classical and widely studied problem. We study a categorical for…

cs.LO2024

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…

cs.LO2024

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…

cs.LO2024

Small Test Suites for Active Automata Learning

Loes Kruger, Sebastian Junges, Jurriaan Rot

A bottleneck in modern active automata learning is to test whether a hypothesized Mealy machine correctly describes the system under learning. The search space for possible counter…

cs.LO2024

Pareto Curves for Compositionally Model Checking String Diagrams of MDPs

Kazuki Watanabe, Marck van der Vegt, Ichiro Hasuo +2

Computing schedulers that optimize reachability probabilities in MDPs is a standard verification task. To address scalability concerns, we focus on MDPs that are compositionally de…