Model synchronization based on triple graph grammars: correctness, completeness and invertibility

Triple graph grammars (TGGs) have been used successfully to analyze correctness and completeness of bidirectional model transformations, but a corresponding formal approach to model synchronization has been missing. This paper closes this gap by providing a formal synchronization framework with bidi...

Descripción completa

Detalles Bibliográficos
Autores: Hermann, Frank, Ehrig, Hartmut, Orejas Valdés, Fernando|||0000-0002-3023-4006, Czarnecki, Krzysztof, Diskin, Zinovy, Xiong, Yingfei, Gottmann, Susann, Engel, Thomas
Tipo de recurso: artículo
Fecha de publicación:2015
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/76970
Acceso en línea:https://hdl.handle.net/2117/76970
https://dx.doi.org/10.1007/s10270-012-0309-1
Access Level:acceso abierto
Palabra clave:Formal languages
Graph theory
Model synchronization
Correctness
Bidirectional model transformation
Triple graph grammars
Llenguatges formals
Grafs, Teoria de
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
id ES_ce2581c4e2fe1b3c55e1b06aa2fddd2c
oai_identifier_str oai:upcommons.upc.edu:2117/76970
network_acronym_str ES
network_name_str España
repository_id_str
spelling Model synchronization based on triple graph grammars: correctness, completeness and invertibilityHermann, FrankEhrig, HartmutOrejas Valdés, Fernando|||0000-0002-3023-4006Czarnecki, KrzysztofDiskin, ZinovyXiong, YingfeiGottmann, SusannEngel, ThomasFormal languagesGraph theoryModel synchronizationCorrectnessBidirectional model transformationTriple graph grammarsLlenguatges formalsGrafs, Teoria deÀrees temàtiques de la UPC::Informàtica::Informàtica teòricaTriple graph grammars (TGGs) have been used successfully to analyze correctness and completeness of bidirectional model transformations, but a corresponding formal approach to model synchronization has been missing. This paper closes this gap by providing a formal synchronization framework with bidirectional update propagation operations. They are generated from a given TGG, which specifies the language of all consistently integrated source and target models. As our main result, we show that the generated synchronization framework is correct and complete, provided that forward and backward propagation operations are deterministic. Correctness essentially means that the propagation operations preserve and establish consistency while completeness ensures that the operations are defined for all possible inputs. Moreover, we analyze the conditions under which the operations are inverse to each other. All constructions and results are motivated and explained by a running example, which leads to a case study, using concrete visual syntax and abstract syntax notation based on typed attributed graphs.Peer Reviewed20152015-02-0120152015-09-21journal articlehttp://purl.org/coar/resource_type/c_6501AMhttp://purl.org/coar/version/c_ab4af688f83e57aainfo:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/2117/76970https://dx.doi.org/10.1007/s10270-012-0309-1reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/769702026-05-27T15:37:01Z
dc.title.none.fl_str_mv Model synchronization based on triple graph grammars: correctness, completeness and invertibility
title Model synchronization based on triple graph grammars: correctness, completeness and invertibility
spellingShingle Model synchronization based on triple graph grammars: correctness, completeness and invertibility
Hermann, Frank
Formal languages
Graph theory
Model synchronization
Correctness
Bidirectional model transformation
Triple graph grammars
Llenguatges formals
Grafs, Teoria de
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
title_short Model synchronization based on triple graph grammars: correctness, completeness and invertibility
title_full Model synchronization based on triple graph grammars: correctness, completeness and invertibility
title_fullStr Model synchronization based on triple graph grammars: correctness, completeness and invertibility
title_full_unstemmed Model synchronization based on triple graph grammars: correctness, completeness and invertibility
title_sort Model synchronization based on triple graph grammars: correctness, completeness and invertibility
dc.creator.none.fl_str_mv Hermann, Frank
Ehrig, Hartmut
Orejas Valdés, Fernando|||0000-0002-3023-4006
Czarnecki, Krzysztof
Diskin, Zinovy
Xiong, Yingfei
Gottmann, Susann
Engel, Thomas
author Hermann, Frank
author_facet Hermann, Frank
Ehrig, Hartmut
Orejas Valdés, Fernando|||0000-0002-3023-4006
Czarnecki, Krzysztof
Diskin, Zinovy
Xiong, Yingfei
Gottmann, Susann
Engel, Thomas
author_role author
author2 Ehrig, Hartmut
Orejas Valdés, Fernando|||0000-0002-3023-4006
Czarnecki, Krzysztof
Diskin, Zinovy
Xiong, Yingfei
Gottmann, Susann
Engel, Thomas
author2_role author
author
author
author
author
author
author
dc.subject.none.fl_str_mv Formal languages
Graph theory
Model synchronization
Correctness
Bidirectional model transformation
Triple graph grammars
Llenguatges formals
Grafs, Teoria de
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
topic Formal languages
Graph theory
Model synchronization
Correctness
Bidirectional model transformation
Triple graph grammars
Llenguatges formals
Grafs, Teoria de
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
description Triple graph grammars (TGGs) have been used successfully to analyze correctness and completeness of bidirectional model transformations, but a corresponding formal approach to model synchronization has been missing. This paper closes this gap by providing a formal synchronization framework with bidirectional update propagation operations. They are generated from a given TGG, which specifies the language of all consistently integrated source and target models. As our main result, we show that the generated synchronization framework is correct and complete, provided that forward and backward propagation operations are deterministic. Correctness essentially means that the propagation operations preserve and establish consistency while completeness ensures that the operations are defined for all possible inputs. Moreover, we analyze the conditions under which the operations are inverse to each other. All constructions and results are motivated and explained by a running example, which leads to a case study, using concrete visual syntax and abstract syntax notation based on typed attributed graphs.
publishDate 2015
dc.date.none.fl_str_mv 2015
2015-02-01
2015
2015-09-21
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
AM
http://purl.org/coar/version/c_ab4af688f83e57aa
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/76970
https://dx.doi.org/10.1007/s10270-012-0309-1
url https://hdl.handle.net/2117/76970
https://dx.doi.org/10.1007/s10270-012-0309-1
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869419964005351425
score 15,300719

Similares en LA Referencia