{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T16:30:42Z","timestamp":1691166642087},"reference-count":42,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2014,6,26]],"date-time":"2014-06-26T00:00:00Z","timestamp":1403740800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2014,8]]},"abstract":"<jats:p>Triple 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.<\/jats:p><jats:p>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<jats:italic>forward translation rule<\/jats:italic>. 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.<\/jats:p>","DOI":"10.1017\/s0960129512000370","type":"journal-article","created":{"date-parts":[[2014,6,26]],"date-time":"2014-06-26T14:22:13Z","timestamp":1403792533000},"source":"Crossref","is-referenced-by-count":6,"title":["Formal analysis of model transformations based on triple graph grammars"],"prefix":"10.1017","volume":"24","author":[{"given":"FRANK","family":"HERMANN","sequence":"first","affiliation":[]},{"given":"HARTMUT","family":"EHRIG","sequence":"additional","affiliation":[]},{"given":"ULRIKE","family":"GOLAS","sequence":"additional","affiliation":[]},{"given":"FERNANDO","family":"OREJAS","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2014,6,26]]},"reference":[{"key":"S0960129512000370_ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88643-3_10"},{"key":"S0960129512000370_ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87405-8_28"},{"key":"S0960129512000370_ref39","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-59071-4_45"},{"key":"S0960129512000370_ref38","doi-asserted-by":"publisher","DOI":"10.1142\/3303"},{"key":"S0960129512000370_ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03741-2_26"},{"key":"S0960129512000370_ref34","doi-asserted-by":"publisher","DOI":"10.2307\/1968867"},{"key":"S0960129512000370_ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863573"},{"key":"S0960129512000370_ref27","first-page":"1","article-title":"Specification and verification of model transformations.","volume":"30","author":"Hermann","year":"2010","journal-title":"Electronic Communications of the EASST"},{"key":"S0960129512000370_ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15928-2_11"},{"key":"S0960129512000370_ref23","doi-asserted-by":"crossref","unstructured":"Hermann F. , Ehrig H. , Golas U. and Orejas F. (2010a) Efficient Analysis and Execution of Correct and Complete Model Transformations Based on Triple Graph Grammars. In: Proceedings MDI'10 \u2013 Model Driven Interoperability, ACM 22\u201331.","DOI":"10.1145\/1866272.1866277"},{"key":"S0960129512000370_ref21","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129508007202"},{"key":"S0960129512000370_ref19","unstructured":"Guerra E. and de Lara J. (2006a) Attributed typed triple graph transformation with inheritance in the double pushout approach. Technical Report UC3M-TR-CS-2006-00, Universidad Carlos III, Madrid, Spain."},{"key":"S0960129512000370_ref18","first-page":"1","article-title":"Formal Specification of Model Transformations by Triple Graph Grammars with Application Conditions","volume":"39","author":"Golas","year":"2011","journal-title":"Electronic Communications of the EASST"},{"key":"S0960129512000370_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10270-008-0089-9"},{"key":"S0960129512000370_ref16","doi-asserted-by":"crossref","unstructured":"Giese H. , Hildebrandt S. and Lambers L. (2010) Toward bridging the gap between formal semantics and implementation of triple graph grammars. Technical Report 37, Hasso Plattner Institute at the University of Potsdam.","DOI":"10.1109\/MoDeVVa.2010.14"},{"key":"S0960129512000370_ref15","unstructured":"Giese H. and Hildebrandt S. (2009) Efficient Model Synchronization of Large-Scale Models. Technical Report 28, Hasso Plattner Institute at the University of Potsdam."},{"key":"S0960129512000370_ref14","volume-title":"Bidirectional Programming Languages","author":"Foster","year":"2009"},{"key":"S0960129512000370_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87405-8_13"},{"key":"S0960129512000370_ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1973.11"},{"key":"S0960129512000370_ref11","article-title":"Completeness and Correctness of Model Transformations based on Triple Graph Grammars with Negative Application Conditions","volume":"18","author":"Ehrig","year":"2009","journal-title":"Electronic Communications of the EASST"},{"key":"S0960129512000370_ref10","first-page":"111","article-title":"Categorical Frameworks for Graph Transformation and HLR Systems based on the DPO Approach.","volume":"102","author":"Ehrig","year":"2010","journal-title":"Bulletin of the EATCS"},{"key":"S0960129512000370_ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1402947.1402950"},{"key":"S0960129512000370_ref33","unstructured":"Lambers L. (2009) Certifying Rule-Based Models using Graph Transformation, Ph.D. thesis, Technische Universit\u00e4t Berlin."},{"key":"S0960129512000370_ref7","volume-title":"Fundamentals of Algebraic Graph Transformation","author":"Ehrig","year":"2006"},{"key":"S0960129512000370_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71289-3_7"},{"key":"S0960129512000370_ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142399"},{"key":"S0960129512000370_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16145-2_9"},{"key":"S0960129512000370_ref1","unstructured":"AGG (2011) AGG. TFS-Group, TU Berlin. Homepage: www.tfs.tu-berlin.de\/agg."},{"key":"S0960129512000370_ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24485-8_49"},{"key":"S0960129512000370_ref36","first-page":"201","volume-title":"Term Graph Rewriting: Theory and Practice","author":"Plump","year":"1993"},{"key":"S0960129512000370_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04425-0_18"},{"key":"S0960129512000370_ref3","article-title":"Verification of architectural refactorings: Rule extraction and tool support","volume":"16","author":"Bisztray","year":"2009","journal-title":"Electronic Communications of the EASST"},{"key":"S0960129512000370_ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.12.015"},{"key":"S0960129512000370_ref32","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2005028"},{"key":"S0960129512000370_ref42","unstructured":"Taentzer G. et al. (2005) Model Transformation by Graph Transformation: A Comparative Study. In: Proceedings \u2013 Workshop Model Transformation in Practice."},{"key":"S0960129512000370_ref24","doi-asserted-by":"crossref","unstructured":"Hermann F. , Ehrig H. , Golas U. and Orejas F. (2010b) Efficient Analysis and Execution of Correct and Complete Model Transformations Based on Triple Graph Grammars \u2013 Extended Version. Technical Report 2010\/13, FAk. IV, TU Berlin.","DOI":"10.1145\/1866272.1866277"},{"key":"S0960129512000370_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87405-8_29"},{"key":"S0960129512000370_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/11841883_25"},{"key":"S0960129512000370_ref29","unstructured":"Kindler E. and Wagner R. (2007) Triple Graph Grammars: Concepts, Extensions, Implementations, and Application Scenarios. Technical Report tr-ri-07-284, Department of Computer Science, University of Paderborn, Germany."},{"key":"S0960129512000370_ref30","first-page":"144","article-title":"Extended Triple Graph Grammars with Efficient and Compatible Graph Translators","volume":"5765","author":"Klar","year":"2010","journal-title":"Springer-Verlag Lecture Notes in Computer Science"},{"key":"S0960129512000370_ref22","doi-asserted-by":"crossref","unstructured":"Hermann F. , Corradini A. and Ehrig H. (2014) Analysis of permutation equivalence in $\\mathcal{M}$ -adhesive transformation systems with negative application conditions. Mathematical Structures in Computer Science (this volume).","DOI":"10.1017\/S0960129512000382"},{"key":"S0960129512000370_ref37","doi-asserted-by":"publisher","DOI":"10.1007\/11601548_16"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129512000370","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T23:22:28Z","timestamp":1565565748000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129512000370\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,26]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["S0960129512000370"],"URL":"https:\/\/doi.org\/10.1017\/s0960129512000370","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,26]]},"article-number":"240408"}}