
Explaining Behavioural Inequivalence Generically in Quasilinear Time
We provide a generic algorithm for constructing formulae that distinguis...
read it

Behavioural Preorders via Graded Monads
Like notions of process equivalence, behavioural preorders on processes ...
read it

Harnessing LTL With Freeze Quantification
Logics and automata models for languages over infinite alphabets, such a...
read it

Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics
We establish a generic upper bound ExpTime for reasoning with global ass...
read it

Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions
Behavioural distances provide a finegrained measure of equivalence in s...
read it

Noniterative Modal Logics are Coalgebraic
A modal logic is noniterative if it can be defined by axioms that do no...
read it

From Generic Partition Refinement to Weighted Tree Automata Minimization
Partition refinement is a method for minimizing automata and transition ...
read it

Explaining NonBisimilarity in a Coalgebraic Approach: Games and Distinguishing Formulas
Behavioural equivalences can be characterized via bisimulation, modal lo...
read it

NP Reasoning in the Monotone μCalculus
Satisfiability checking for monotone modal logic is known to be (only) N...
read it

Automata Learning: An Algebraic Approach
We propose a generic categorical framework for learning unknown formal l...
read it

Computing Nested Fixpoints in Quasipolynomial Time
It is well known that the winning region of a parity game with n nodes a...
read it

A Modal Characterization Theorem for a Probabilistic Fuzzy Description Logic
The fuzzy modality `probably` is interpreted over probabilistic type spa...
read it

Optimal Satisfiability Checking for Arithmetic μCalculi
The coalgebraic μcalculus provides a generic semantic framework for fix...
read it

Trichotomic Argumentation Representation
The Aristotelian trichotomy distinguishes three aspects of argumentation...
read it

Graded Monads for the Linear Time  Branching Time Spectrum
Statebased models of concurrent systems are traditionally considered un...
read it

CoPaR: An Efficient Generic Partition Refiner
Partition refinement is a method for minimizing automata and transition ...
read it

A van Benthem Theorem for Quantitative Probabilistic Modal Logic
In probabilistic transition systems, behavioural metrics provide a more ...
read it

A Metalanguage for Guarded Iteration
Notions of guardedness serve to delineate admissible recursive definitio...
read it

Efficient and Modular Coalgebraic Partition Refinement
We present a generic partition refinement algorithm that quotients coalg...
read it

Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages
We introduce a generic expression language describing behaviours of fini...
read it

Guarded Traced Categories
Notions of guardedness serve to delineate the admissibility of cycles, e...
read it

A van Benthem Theorem for Fuzzy Modal Logic
We present a fuzzy (or quantitative) version of the van Benthem theorem,...
read it

Guarded and Unguarded Iteration for Generalized Processes
Models of iterated computation, such as (completely) iterative monads, o...
read it

Permutation Games for the Weakly Aconjunctive muCalculus
We introduce a natural notion of limitdeterministic parity automata and...
read it

Integrating Generic Sensor Fusion Algorithms with Sound State Representations through Encapsulation of Manifolds
Common estimation algorithms, such as least squares estimation or the Ka...
read it
Lutz Schröder
is this you? claim profile