Abstract Partition refinement is a method for minimizing automata and transition systems of various types. Recently, we have developed partition algorithm that generic in the type given system matches run time best known algorithms many concrete types systems, e.g. deterministic as well ordinary, weighted, probabilistic (labelled) systems. Genericity achieved by modelling functors on sets, coal...