59 citations · 185 across the 53 of their papers we have counts for
Showing 2018 · cs.DSShow all
2 papers · 2 filters
cs.DS2018
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…
cs.DS2018★ 8 cited
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…