We present a way to implement refinement relations over transition systems, useful for incremental model development. The extension relation, which preserves already modelled functionalities, is suited for refinements. The calculability of this relation relies on the generalization of a bisimulation relation applied on acceptance graphs. It is formally demonstrated and illustrated through an example whose analysis is performed by a Java prototype we have developed. This method can be adapted to UML state machines, which lack evaluation means.