research
∙
07/27/2023
Graded Semantics and Graded Logics for Eilenberg-Moore Coalgebras
Coalgebra, as the abstract study of state-based systems, comes naturally...
share
research
∙
06/02/2023
Quantitative Graded Semantics and Spectra of Behavioural Metrics
Behavioural metrics provide a quantitative refinement of classical two-v...
research
∙
05/30/2023
The Alternating-Time μ-Calculus With Disjunctive Explicit Strategies
Alternating-time temporal logic (ATL) and its extensions, including the ...
research
∙
05/18/2023
COOL 2 – A Generic Reasoner for Modal Fixpoint Logics
There is a wide range of modal logics whose semantics goes beyond relati...
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
∙
12/21/2022
Coalgebraic Satisfiability Checking for Arithmetic μ-Calculi
The coalgebraic μ-calculus provides a generic semantic framework for fix...
research
∙
11/29/2022
Common Knowledge of Abstract Groups
Epistemic logics typically talk about knowledge of individual agents or ...
research
∙
10/24/2022
Towards a Higher-Order Mathematical Operational Semantics
Compositionality proofs in higher-order languages are notoriously involv...
research
∙
07/19/2022
Quantitative Hennessy-Milner Theorems via Notions of Density
The classical Hennessy-Milner theorem is an important tool in the analys...
research
∙
05/01/2022
Uniform Interpolation in Coalgebraic Modal Logic
A logic has uniform interpolation if its formulas can be projected down ...
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
Quantalic Behavioural Distances
Behavioural distances measure the deviation between states in quantitati...
research
∙
12/23/2021
A Point-free Perspective on Lax extensions and Predicate liftings
In this paper we have a fresh look at the connection between lax extensi...
research
∙
05/03/2021
Explaining Behavioural Inequivalence Generically in Quasilinear Time
We provide a generic algorithm for constructing formulae that distinguis...
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
∙
09/02/2020
Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics
We establish a generic upper bound ExpTime for reasoning with global ass...
research
∙
07/02/2020
Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions
Behavioural distances provide a fine-grained measure of equivalence in s...
research
∙
06/09/2020
Non-iterative Modal Logics are Coalgebraic
A modal logic is non-iterative if it can be defined by axioms that do no...
research
∙
04/02/2020
From Generic Partition Refinement to Weighted Tree Automata Minimization
Partition refinement is a method for minimizing automata and transition ...
research
∙
02/26/2020
Explaining Non-Bisimilarity in a Coalgebraic Approach: Games and Distinguishing Formulas
Behavioural equivalences can be characterized via bisimulation, modal lo...
research
∙
02/12/2020
NP Reasoning in the Monotone μ-Calculus
Satisfiability checking for monotone modal logic is known to be (only) N...
research
∙
11/03/2019
Automata Learning: An Algebraic Approach
We propose a generic categorical framework for learning unknown formal l...
research
∙
07/16/2019
Computing Nested Fixpoints in Quasipolynomial Time
It is well known that the winning region of a parity game with n nodes a...
research
∙
05/31/2019
A Modal Characterization Theorem for a Probabilistic Fuzzy Description Logic
The fuzzy modality `probably` is interpreted over probabilistic type spa...
research
∙
01/15/2019
Optimal Satisfiability Checking for Arithmetic μ-Calculi
The coalgebraic μ-calculus provides a generic semantic framework for fix...
research
∙
12/17/2018
Trichotomic Argumentation Representation
The Aristotelian trichotomy distinguishes three aspects of argumentation...
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
∙
10/10/2018
A van Benthem Theorem for Quantitative Probabilistic Modal Logic
In probabilistic transition systems, behavioural metrics provide a more ...
research
∙
07/30/2018
A Metalanguage for Guarded Iteration
Notions of guardedness serve to delineate admissible recursive definitio...
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
∙
02/23/2018
Guarded Traced Categories
Notions of guardedness serve to delineate the admissibility of cycles, e...
research
∙
02/01/2018
A van Benthem Theorem for Fuzzy Modal Logic
We present a fuzzy (or quantitative) version of the van Benthem theorem,...
research
∙
12/27/2017
Guarded and Unguarded Iteration for Generalized Processes
Models of iterated computation, such as (completely) iterative monads, o...
research
∙
10/24/2017
Permutation Games for the Weakly Aconjunctive mu-Calculus
We introduce a natural notion of limit-deterministic parity automata and...
research
∙
07/06/2011
