Minimizing Bounded Bisimulation Contractions for Efficient Modal Logic Reasoning

The authors introduce a novel definition of bounded bisimulation contractions, called rooted k-contractions, that preserve k-bisimilarity and are minimal in terms of the number of worlds. They also define a stronger notion of edge minimality for these contractions.