Multiple model synchronization with multiary delta lenses with amendment andK-Putput

Diskin, Zinovy; König, Harald; Lawford, Mark

doi:10.1007/s00165-019-00493-0

Cited by 8 publications

(17 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The topic of consistency maintenance between more than two models has been gaining attention in the MDD community [11], especially from theoretically minded MDD researchers including Trollmann and Albayrak from a graph transformation perspective [12] and Diskin and collaborators from a more purely categorical one [13]. It is conceptually challenging, and increasingly acknowledged as an essential part of what must be mastered for MDD to achieve its full potential.…”

Section: Related Work From the Mdd Communitymentioning

confidence: 99%

“…or traceability links (a.k.a corrs, or correspondence graphs: "which part(s) of that model are relevant to this part of this one?"). When such information is available, it is often possible to use it to make more intelligent decisions about how to restore consistency than are possible without it [13,29,30]. However, as mentioned in Sect.…”

Section: State-based Versus Delta-based Approachmentioning

confidence: 99%

See 1 more Smart Citation

Connecting software build with maintaining consistency between models: towards sound, optimal, and flexible building from megamodels

Stevens

2020

Softw Syst Model

View full text Add to dashboard Cite

Software build systems tackle the problem of building software from sources in a way which is sound (when a build completes successfully, the relations between the generated and source files are as specified) and optimal (only genuinely required rebuilding steps are done). In this paper, we explain and exploit the connection between software build and the megamodel consistency problem. The model-driven development of systems involves multiple models, metamodels and transformations. Transformations-which may be bidirectional-specify, and provide means to enforce, desired "consistency" relationships between models. We can describe the whole configuration using a megamodel. As development proceeds, and various models are modified, we need to be able to restore consistency in the megamodel, so that the consequences of decisions first recorded in one model are appropriately reflected in the others. At the same time, we need to minimise the amount of recomputation needed; in particular, we would like to avoid reapplying a transformation when no relevant changes have occurred in the models it relates. The megamodel consistency problem requires flexibility beyond what is found in conventional software build, because different results are obtained depending on which models are allowed to be modified and on the order and direction of transformation application. In this paper, we propose using an orientation model to make important choices explicit. We show how to extend the formalised build system pluto to provide a means of restoring consistency in a megamodel, that is, in appropriate senses, flexible, sound and optimal.

show abstract

Section: Related Work From the Mdd Communitymentioning

confidence: 99%

Section: State-based Versus Delta-based Approachmentioning

confidence: 99%

Connecting software build with maintaining consistency between models: towards sound, optimal, and flexible building from megamodels

Stevens

2020

Softw Syst Model

View full text Add to dashboard Cite

show abstract

“…In Fig. 1 we employ grey-coloured "tentacles" to visualise three commonalities: (1) The three person records, (2) the two home addresses, and also (3) the two assignments of the home address to the person. Note that A 1/2/3 formally represent directed graphs.…”

Section: Fig 1 Comprehensive Systemmentioning

confidence: 99%

“…For now and the rest of the paper, we fix a sufficiently large number n ∈ N. i.e. of an n-tuple of partial graph morphisms (a j ) 1≤j≤n , which we call projections 3 .…”

Section: Comprehensive Systemsmentioning

confidence: 99%

See 1 more Smart Citation

Single Pushout Rewriting in Comprehensive Systems

König

Stünkel

2020

Graph Transformation

Self Cite

View full text Add to dashboard Cite

The elegance of the single-pushout (SPO) approach to graph transformations arises from substituting total morphisms by partial ones in the underlying category. Thus, SPO's applicability depends on the durability of pushouts after this transition. There is a wide range of work on the question when pushouts exist in categories with partial morphisms starting with the pioneering work of Löwe and Kennaway and ending with an essential characterisation in terms of an exactness property (for the interplay between pullbacks and pushouts) and an adjointness condition (w.r.t. inverse image functions) by Hayman and Heindel. Triple graphs and graph diagrams are frameworks to synchronize two or more updatable data sources by means of internal mappings, which identify common sub-structures. Comprehensive systems generalise these frameworks, treating the network of data sources and their structural interrelations as a homogeneous comprehensive artifact, in which partial maps identify commonalities. Although this inherent partiality produces amplified complexity, Heindel's characterisation still yields cocompleteness of the category of comprehensive systems equipped with closed partial morphisms and thus enables computing by SPO graph transformation.

show abstract

General Supervised Learning as Change Propagation with Delta Lenses

Diskin¹

2020

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Delta lenses are an established mathematical framework for modelling and designing bidirectional model transformations (Bx). Following the recent observations by Fong et al, the paper extends the delta lens framework with a a new ingredient: learning over a parameterized space of model transformations seen as functors. We will define a notion of an asymmetric learning delta lens with amendment (ala-lens), and show how ala-lens can be organized into a symmetric monoidal category. We also show that sequential and parallel composition of well-behaved (wb) ala-lenses is also wb so that wb ala-lenses constitute a full subcategory of ala-lenses. 4 Formally, schema S A is a graph consisting of three arrows named Name, Expr., Depart., having the common source named OID and the targets String String String, Integer Integer Integer, String String String resp. This graph freely generates a category (just add four identity arrows) that we denote by S A again. We assume that a general model of such a schema is a functor X: S A → Rel Rel Rel that maps arrows to relations. If we need some of these relations to be functions, we label the arrows in the schema with a special constraint symbol, say, [fun], so that schema becomes a generalized sketch in the sense of Makkai (see [10,11]). In S A , all three arrows are labelled by [fun] so that a legal model must map them to functions. For example, model A in the figure is given by functor _ A : S A → Rel Rel Rel with the following values: OID A = {#A, #J, #M }, sets String String String A and Integer Integer Integer A actually do not depend on A-they are the predefined sets of strings and integers resp., and Name A (#A) = Ann, Name A (#J) = John, Expr. A (#A) = 10, etc.

show abstract

Multiple model synchronization with multiary delta lenses with amendment andK-Putput

Cited by 8 publications

References 31 publications

Connecting software build with maintaining consistency between models: towards sound, optimal, and flexible building from megamodels

Connecting software build with maintaining consistency between models: towards sound, optimal, and flexible building from megamodels

Single Pushout Rewriting in Comprehensive Systems

General Supervised Learning as Change Propagation with Delta Lenses

Contact Info

Product

Resources

About