Partition graphs can be transformed using two algorithms -- coarsening and refinement. This class implements refinement using the Bisim algorithm ( Bisimulation.splitUntilAllInvsSatisfied). Coarsening is implemented with a modified version of the kTails algorithm ( {@code Bisimulation.mergeP
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected