4 results
Sergey Goncharov ; Lutz Schröder ; Christoph Rauch ; Maciej Piróg.
Models of iterated computation, such as (completely) iterative monads, often depend on a notion of guardedness, which guarantees unique solvability of recursive equations and requires roughly that recursive calls happen only under certain guarding operations. On the other hand, many models of […]
Published on July 4, 2019
Paul Wild ; Lutz Schröder.
In systems involving quantitative data, such as probabilistic, fuzzy, or metric systems, behavioural distances provide a more fine-grained comparison of states than two-valued notions of behavioural equivalence or behaviour inclusion. Like in the two-valued case, the wide variation found in system […]
Published on June 15, 2022
Thorsten Wißmann ; Stefan Milius ; Lutz Schröder.
We provide a generic algorithm for constructing formulae that distinguish behaviourally inequivalent states in systems of various transition types such as nondeterministic, probabilistic or weighted; genericity over the transition type is achieved by working with coalgebras for a set functor in the […]
Published on November 17, 2022
Daniel Hausmann ; Lutz Schröder.
The coalgebraic $\mu$-calculus provides a generic semantic framework for fixpoint logics over systems whose branching type goes beyond the standard relational setup, e.g. probabilistic, weighted, or game-based. Previous work on the coalgebraic $\mu$-calculus includes an exponential-time upper bound […]
Published on July 23, 2024