11 citations · 37 across the 18 of their papers we have counts for
5 papers · 1 filter
Coalgebra Encoding for Efficient Minimization
Hans-Peter Deifel, Stefan Milius, Thorsten Wißmann
Recently, we have developed an efficient generic partition refinement algorithm, which computes behavioural equivalence on a state-based system given as an encoded coalgebra, and i…
From Generic Partition Refinement to Weighted Tree Automata Minimization
Thorsten Wißmann, Hans-Peter Deifel, Stefan Milius +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…
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…
Efficient Coalgebraic Partition Refinement
Ulrich Dorsch, Stefan Milius, Lutz Schröder +1
We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in reactive verification; coalgebraic generalit…