Learn More
A bidirectional transformation (BX) keeps a pair of interrelated models synchronized. Symmetric BXs are those for which neither model in the pair fully determines the other. We build two algebraic frameworks for symmetric BXs, with one correctly implementing the other, and both being delta-based generalizations of known state-based frameworks. We identify(More)
A distributed graph (N, D) consists of a network graph N and a commutative diagram D over the scheme N which associates local graphs D(ni) and graph morphisms D(e) : D(n1) → D(n2) to nodes n1, n2 and edges e : n1 → n2 in N. Although there are several interesting applications of distributed graphs and transformations, even the basic pushout constructions for(More)
In this paper we present a new approach to deal with attributed graphs and attributed graph transformation. This approach is based on working with what we call symbolic graphs, which are graphs labelled with variables together with a formula that constrains the possible values that we may assign to these variables. In particular, in this paper we will(More)
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are required properties. Only under these two conditions, existence and uniqueness of the outcoming model is ensured. Verifying confluence of a graph transformation system is equivalent to checking both local confluence(More)
This paper is based on two general ideas. The first one is the integration paradigm for data type and process modeling techniques developed by the first two authors within the last five years. The second one is a transformation-based component framework for system modeling presented at ETAPS 2002 in Grenoble. The aim of this paper is to join both ideas(More)