7. The method of claim 6 , wherein the determining of the third double push-out graph rewriting rule comprises: decomposing: the first double push-out graph rewriting rule into first connected components, wherein each first connected component gathers elements of the first part, the first interface and the first replacement, which are all connected through the first morphisms, the second double push-out graph rewriting rule into second connected components, wherein each second connected component gathers elements of the second part, the second interface and the second replacement, which are all connected through the second morphisms; computing maximal cliques comprised of a first set of first connected components and a second set of second connected components, wherein the intersection between elements of the first set coming from the first part and elements of the second set coming from the second part is equal to the intersection between elements of the first set coming from the first interface and elements of the second set coming from the second interface; and allowing for user selection of at least one of the cliques, the selected clique constituting the third rewriting rule.
7. The method of claim 6 , wherein the determining of the third double push-out graph rewriting rule comprises: decomposing: the first double push-out graph rewriting rule into first connected components, wherein each first connected component gathers elements of the first part, the first interface and the first replacement, which are all connected through the first morphisms, the second double push-out graph rewriting rule into second connected components, wherein each second connected component gathers elements of the second part, the second interface and the second replacement, which are all connected through the second morphisms; computing maximal cliques comprised of a first set of first connected components and a second set of second connected components, wherein the intersection between elements of the first set coming from the first part and elements of the second set coming from the second part is equal to the intersection between elements of the first set coming from the first interface and elements of the second set coming from the second interface; and allowing for user selection of at least one of the cliques, the selected clique constituting the third rewriting rule. 8. The method of claim 7 , wherein the method further comprises, after the user selection of a clique, highlighting on the initial modeled object the elements of the selected clique coming from the first part and from the second part, and obtaining a confirmation by the user of the selected clique.