Adhesive Subcategories of Functor Categories with Instantiation to Partial Triple Graphs

Kosiol, Jens; Fritsche, Lars; Schürr, Andy; Taentzer, Gabriele

doi:10.1007/978-3-030-23611-3_3

Cited by 6 publications

(11 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The result of the first stage are the comprehensive metamodel and global consistency rules imposed upon it, and metamodel element commonalities, which are stored persistently to avoid expensive re-computation and possible information loss, cf. motivation in [25]. These commonalities are then used to compute the comprehensive system under consideration, e.g.…”

Section: Comprehensive Systemsmentioning

confidence: 99%

“…Hence, we proposed comprehensive systems that mitigate issues with the former and represent a generalization of graph diagrams and triple graphs-alternatives to our approach. Comprehensive systems stress the utility of partial mappings in commonality specifications, which have been promoted in [46] and were also picked up in [25].…”

Section: Conclusion Related Work and Future Plansmentioning

confidence: 99%

“…if ν and µ are arbitrarily given, then M 3 in fig. 7 may not be admissible for M because the mapping M 3 (−j) may fail to be monic, an effect already studied in [25,Example 6]…”

mentioning

confidence: 99%

See 2 more Smart Citations

Towards Multiple Model Synchronization with Comprehensive Systems

Stünkel

König

Lamo

et al. 2020

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Model management is a central activity in Software Engineering. The most challenging aspect of model management is to keep models consistent with each other while they evolve. As a consequence, there has been increasing activity in this area, which has produced a number of approaches to address this synchronization challenge. The majority of these approaches, however, is limited to a binary setting; i.e. the synchronization of exactly two models with each other. A recent Dagstuhl seminar on multidirectional transformations made it clear that there is a need for further investigations in the domain of general multiple model synchronization simply because not every multiary consistency relation can be factored into binary ones. However, with the help of an auxiliary artifact, which provides a global view over all models, multiary synchronization can be achieved by existing binary model synchronization means. In this paper, we propose a novel comprehensive system construction to produce such an artifact using the same underlying base modelling language as the one used to define the models. Our approach is based on the definition of partial commonalities among a set of aligned models. Comprehensive systems can be shown to generalize the underlying categories of graph diagrams and triple graph grammars and can efficiently be implemented in existing tools.

show abstract

Section: Comprehensive Systemsmentioning

confidence: 99%

Section: Conclusion Related Work and Future Plansmentioning

confidence: 99%

See 1 more Smart Citation

Towards Multiple Model Synchronization with Comprehensive Systems

Stünkel

König

Lamo

et al. 2020

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

show abstract

“…Finally, we mention some unidirectional approaches that are closely related to incremental model transformation and model repair. Work that is related to our use of partial triple graphs but not to model synchronization is considered in [37].…”

Section: Related Workmentioning

confidence: 99%

Avoiding unnecessary information loss: correct and efficient model synchronization based on triple graph grammars

Fritsche

Kosiol

Schürr

et al. 2020

Int J Softw Tools Technol Transfer

Self Cite

View full text Add to dashboard Cite

Model synchronization, i.e., the task of restoring consistency between two interrelated models after a model change, is a challenging task. Triple graph grammars (TGGs) specify model consistency by means of rules that describe how to create consistent pairs of models. These rules can be used to automatically derive further rules, which describe how to propagate changes from one model to the other or how to change one model in such a way that propagation is guaranteed to be possible. Restricting model synchronization to these derived rules, however, may lead to unnecessary deletion and recreation of model elements during change propagation. This is inefficient and may cause unnecessary information loss, i.e., when deleted elements contain information that is not represented in the second model, this information cannot be recovered easily. Short-cut rules have recently been developed to avoid unnecessary information loss by reusing existing model elements. In this paper, we show how to automatically derive (short-cut) repair rules from short-cut rules to propagate changes such that information loss is avoided and model synchronization is accelerated. The key ingredients of our rule-based model synchronization process are these repair rules and an incremental pattern matcher informing about suitable applications of them. We prove the termination and the correctness of this synchronization process and discuss its completeness. As a proof of concept, we have implemented this synchronization process in eMoflon, a state-of-the-art model transformation tool with inherent support of bidirectionality. Our evaluation shows that repair processes based on (short-cut) repair rules have considerably decreased information loss and improved performance compared to former model synchronization processes based on TGGs.

show abstract

“…Proof. Componentwise validity of monomorphy and componentwise construction of pullbacks have been proved in [11] for so-called S-cartesian functor categories. We showed in [21] (see also [22]) that -for a certain schema category -this functor category is equivalent to CS.…”

Section: Important Propertiesmentioning

confidence: 99%

Single Pushout Rewriting in Comprehensive Systems

König

Stünkel

2020

Graph Transformation

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

Adhesive Subcategories of Functor Categories with Instantiation to Partial Triple Graphs

Cited by 6 publications

References 27 publications

Towards Multiple Model Synchronization with Comprehensive Systems

Towards Multiple Model Synchronization with Comprehensive Systems

Avoiding unnecessary information loss: correct and efficient model synchronization based on triple graph grammars

Single Pushout Rewriting in Comprehensive Systems

Contact Info

Product

Resources

About