5 papers
Distributed Coalgebraic Partition Refinement
Fabian Birkmann, Hans-Peter Deifel, Stefan Milius
Partition refinement is a method for minimizing automata and transition systems of various types. Recently, a new partition refinement algorithm and associated tool CoPaR were deve…
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…
Permutation Games for the Weakly Aconjunctive -Calculus
Daniel Hausmann, Lutz Schröder, Hans-Peter Deifel
We introduce a natural notion of limit-deterministic parity automata and present a method that uses such automata to construct satisfiability games for the weakly aconjunctive frag…