Incremental model transformations with triple graph grammars for multi-version models and multi-version pattern matching.
Saved in:
| Title: | Incremental model transformations with triple graph grammars for multi-version models and multi-version pattern matching. |
|---|---|
| Authors: | Barkowsky, Matthias1 (AUTHOR) matthias.barkowsky@hpi.de, Giese, Holger1 (AUTHOR) holger.giese@hpi.de |
| Source: | Software & Systems Modeling. Dec2025, Vol. 24 Issue 6, p1699-1736. 38p. |
| Subjects: | Graph grammars, Pattern matching, Software engineering, Time complexity, Synchronization |
| Abstract: | Like conventional software projects, projects in model-driven software engineering require adequate management of multiple versions of development artifacts, importantly allowing living with temporary inconsistencies. In previous work, we have introduced multi-version models for model-driven software engineering, which allow checking well-formedness and finding merge conflicts for multiple versions of the same model at once. However, situations where different models are linked via automatic model transformations also have to be handled for multi-version models. In this paper, we propose a technique for jointly handling the transformation of multiple versions of a source model into corresponding versions of a target model. This enables the use of a more compact representation that may afford improved execution time of both the transformation and further analysis. Our approach is based on the well-known formalism of triple graph grammars and the aforementioned encoding of model version histories called multi-version models. In addition to batch transformation of an entire history, the technique covers incremental synchronization of changes in the framework of multi-version models. Our solution is complemented by a dedicated pattern matching technique for multi-version models. We show the correctness of our approach with respect to the standard semantics of triple graph grammars and conduct an empirical evaluation to investigate the performance of our technique regarding execution time and memory consumption. Our results indicate that the proposed solution affords lower memory consumption and may improve execution time for batch transformation of large version histories, but can also come with computational overhead in unfavorable cases. [ABSTRACT FROM AUTHOR] |
| Copyright of Software & Systems Modeling is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| FullText | Links: – Type: pdflink Text: Availability: 1 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 189358298 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Incremental model transformations with triple graph grammars for multi-version models and multi-version pattern matching. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Barkowsky%2C+Matthias%22">Barkowsky, Matthias</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> matthias.barkowsky@hpi.de</i><br /><searchLink fieldCode="AR" term="%22Giese%2C+Holger%22">Giese, Holger</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> holger.giese@hpi.de</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Software+%26+Systems+Modeling%22">Software & Systems Modeling</searchLink>. Dec2025, Vol. 24 Issue 6, p1699-1736. 38p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Graph+grammars%22">Graph grammars</searchLink><br /><searchLink fieldCode="DE" term="%22Pattern+matching%22">Pattern matching</searchLink><br /><searchLink fieldCode="DE" term="%22Software+engineering%22">Software engineering</searchLink><br /><searchLink fieldCode="DE" term="%22Time+complexity%22">Time complexity</searchLink><br /><searchLink fieldCode="DE" term="%22Synchronization%22">Synchronization</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Like conventional software projects, projects in model-driven software engineering require adequate management of multiple versions of development artifacts, importantly allowing living with temporary inconsistencies. In previous work, we have introduced multi-version models for model-driven software engineering, which allow checking well-formedness and finding merge conflicts for multiple versions of the same model at once. However, situations where different models are linked via automatic model transformations also have to be handled for multi-version models. In this paper, we propose a technique for jointly handling the transformation of multiple versions of a source model into corresponding versions of a target model. This enables the use of a more compact representation that may afford improved execution time of both the transformation and further analysis. Our approach is based on the well-known formalism of triple graph grammars and the aforementioned encoding of model version histories called multi-version models. In addition to batch transformation of an entire history, the technique covers incremental synchronization of changes in the framework of multi-version models. Our solution is complemented by a dedicated pattern matching technique for multi-version models. We show the correctness of our approach with respect to the standard semantics of triple graph grammars and conduct an empirical evaluation to investigate the performance of our technique regarding execution time and memory consumption. Our results indicate that the proposed solution affords lower memory consumption and may improve execution time for batch transformation of large version histories, but can also come with computational overhead in unfavorable cases. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Software & Systems Modeling is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=189358298 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s10270-024-01238-1 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 38 StartPage: 1699 Subjects: – SubjectFull: Graph grammars Type: general – SubjectFull: Pattern matching Type: general – SubjectFull: Software engineering Type: general – SubjectFull: Time complexity Type: general – SubjectFull: Synchronization Type: general Titles: – TitleFull: Incremental model transformations with triple graph grammars for multi-version models and multi-version pattern matching. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Barkowsky, Matthias – PersonEntity: Name: NameFull: Giese, Holger IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 12 Text: Dec2025 Type: published Y: 2025 Identifiers: – Type: issn-print Value: 16191366 Numbering: – Type: volume Value: 24 – Type: issue Value: 6 Titles: – TitleFull: Software & Systems Modeling Type: main |
| ResultId | 1 |
