research
∙
04/26/2023
Nominal Topology for Data Languages
We propose a novel topological perspective on data languages recognizabl...
share
research
∙
03/20/2023
On Kripke, Vietoris and Hausdorff Polynomial Functors
The Vietoris space of compact subsets of a given Hausdorff space yields ...
research
∙
02/16/2023
Weak Similarity in Higher-Order Mathematical Operational Semantics
Higher-order abstract GSOS is a recent extension of Turi and Plotkin's f...
research
∙
10/24/2022
Towards a Higher-Order Mathematical Operational Semantics
Compositionality proofs in higher-order languages are notoriously involv...
research
∙
04/13/2022
Distributed Coalgebraic Partition Refinement
Partition refinement is a method for minimizing automata and transition ...
research
∙
03/29/2022
Graded Monads and Behavioural Equivalence Games
The framework of graded semantics uses graded monads to capture behaviou...
research
∙
03/21/2022
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
We provide a generic algorithm for constructing formulae that distinguis...
research
∙
02/22/2022
Stateful Structural Operational Semantics
Compositionality of denotational semantics is an important concern in pr...
research
∙
02/14/2022
Coalgebraic Semantics for Nominal Automata
This paper provides a coalgebraic approach to the language semantics of ...
research
∙
05/03/2021
Explaining Behavioural Inequivalence Generically in Quasilinear Time
We provide a generic algorithm for constructing formulae that distinguis...
research
∙
04/20/2021
An Initial Algebra Theorem Without Iteration
The Initial Algebra Theorem by Trnková et al. states, under mild assumpt...
research
∙
02/25/2021
Coalgebra Encoding for Efficient Minimization
Recently, we have developed an efficient generic partition refinement al...
research
∙
11/29/2020
Behavioural Preorders via Graded Monads
Like notions of process equivalence, behavioural preorders on processes ...
research
∙
10/21/2020
Harnessing LTL With Freeze Quantification
Logics and automata models for languages over infinite alphabets, such a...
research
∙
04/02/2020
From Generic Partition Refinement to Weighted Tree Automata Minimization
Partition refinement is a method for minimizing automata and transition ...
research
∙
11/14/2019
On the Behaviour of Coalgebras with Side Effects and Algebras with Effectful Iteration
For every finitary monad T on sets and every endofunctor F on the catego...
research
∙
10/21/2019
On Well-Founded and Recursive Coalgebras
This paper studies fundamental questions concerning category-theoretic m...
research
∙
12/05/2018
Equational Axiomatization of Algebras with Structure
This paper proposes a new category theoretic account of equationally axi...
research
∙
12/04/2018
Graded Monads for the Linear Time - Branching Time Spectrum
State-based models of concurrent systems are traditionally considered un...
research
∙
11/21/2018
CoPaR: An Efficient Generic Partition Refiner
Partition refinement is a method for minimizing automata and transition ...
research
∙
06/14/2018
Efficient and Modular Coalgebraic Partition Refinement
We present a generic partition refinement algorithm that quotients coalg...
research
∙
05/14/2018
Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages
We introduce a generic expression language describing behaviours of fini...
research
∙
04/06/2018
A Categorical Approach to Syntactic Monoids
The syntactic monoid of a language is generalized to the level of a symm...
research
∙
02/21/2018