The paper shows how to use partitioning techniques to generate abstract state spaces (models) preserving similarity and injectivity.
Since these relations are weaker than bisimilarity and surjectivity, our algorithms generate smaller models. This method can
be applied for improving several existing partitioning algorithms used for generating finite models of concurrent programs,
Time Petri Nets and Timed Automata.