4 citations · 5 across the 2 of their papers we have counts for
3 papers · 1 filter
Explaining Behavioural Inequivalence Generically in Quasilinear Time
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, probabi…
Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages
Ulrich Dorsch, Stefan Milius, Lutz Schröder +1
We introduce a generic expression language describing behaviours of finite coalgebras over sets; besides relational systems, this covers, e.g., weighted, probabilistic, and neighbo…
A New Foundation for Finitary Corecursion and Iterative Algebras
Stefan Milius, Dirk Pattinson, Thorsten Wißmann
This paper contributes to a theory of the behaviour of "finite-state" systems that is generic in the system type. We propose that such systems are modelled as coalgebras with a fin…