11 citations · 37 across the 18 of their papers we have counts for
5 papers · 1 filter
Path category for free - Open morphisms from coalgebras with non-deterministic branching
Thorsten Wißmann, Jérémy Dubut, Shin-ya Katsumata +1
There are different categorical approaches to variations of transition systems and their bisimulations. One is coalgebra for a functor G, where a bisimulation is defined as a span…
Generic Partition Refinement and Weighted Tree Automata
Hans-Peter Deifel, Stefan Milius, Lutz Schröder +1
Partition refinement is a method for minimizing automata and transition systems of various types. Recently, we have developed a partition refinement algorithm that is generic in th…
Efficient and Modular Coalgebraic Partition Refinement
Thorsten Wißmann, Ulrich Dorsch, Stefan Milius +1
We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification. Coalgebrai…
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…