Formal analysis of model transformations based on triple graph grammars

Simple item page
dc.contributor.authorHermann, Frank
dc.contributor.authorEhrig, Hartmut
dc.contributor.authorGolas, Ulrike
dc.contributor.authorOrejas, Fernando
dc.date.accessioned2017-11-23T12:53:31Z
dc.date.available2017-11-23T12:53:31Z
dc.date.issued2014
dc.descriptionDieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG geförderten) Allianz- bzw. Nationallizenz frei zugänglich.de
dc.descriptionThis publication is with permission of the rights owner freely accessible due to an Alliance licence and a national licence (funded by the DFG, German Research Foundation) respectively.en
dc.description.abstractTriple graph grammars (TGGs) are a well-established concept for the specification and execution of bidirectional model transformations within model driven software engineering. Their main advantage is an automatic generation of operational rules for forward and backward model transformations, which simplifies specification and enhances usability as well as consistency. In this paper we present several important results for analysing model transformations based on the formal categorical foundation of TGGs within the framework of attributed graph transformation systems. Our first main result shows that the crucial properties of correctness and completeness are ensured for model transformations. In order to analyse functional behaviour, we generate a new kind of operational rule, called a forward translation rule. We apply existing results for the analysis of local confluence for attributed graph transformation systems. As additional main results, we provide sufficient criteria for the verification of functional behaviour as well as a necessary and sufficient condition for strong functional behaviour. In fact, these conditions imply polynomial complexity for the execution of the model transformation. We also analyse information and complete information preservation of model transformations, that is, whether a source model can be reconstructed (uniquely) from the target model computed by the model transformation. We illustrate the results for the well-known model transformation example from class diagrams to relational database models.en
dc.identifier.eissn1469-8072
dc.identifier.issn0960-1295
dc.identifier.urihttps://depositonce.tu-berlin.de/handle/11303/7166
dc.identifier.urihttp://dx.doi.org/10.14279/depositonce-6441
dc.language.isoen
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.subject.ddc004 Datenverarbeitung; Informatik
dc.titleFormal analysis of model transformations based on triple graph grammarsen
dc.typeArticle
dc.type.versionpublishedVersion
dcterms.bibliographicCitation.articlenumbere240408
dcterms.bibliographicCitation.doi10.1017/s0960129512000370
dcterms.bibliographicCitation.issue4
dcterms.bibliographicCitation.journaltitleMathematical structures in computer science
dcterms.bibliographicCitation.originalpublishernameCambridge University Press
dcterms.bibliographicCitation.originalpublisherplaceCambridge
dcterms.bibliographicCitation.volume24
tub.accessrights.dnbdomain
tub.affiliationFak. 4 Elektrotechnik und Informatik::Inst. Softwaretechnik und Theoretische Informatikde
tub.affiliation.facultyFak. 4 Elektrotechnik und Informatikde
tub.affiliation.instituteInst. Softwaretechnik und Theoretische Informatikde
tub.publisher.universityorinstitutionTechnische Universität Berlin

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
formal_analysis_of_model_transformations.pdf
Size:
846.87 KB
Format:
Adobe Portable Document Format
Download

Collections

Publications