zbMATH — the first resource for mathematics

Combining graph transformation and algebraic specification into model transformation. (English) Zbl 1312.68144
Mossakowski, Till (ed.) et al., Recent trends in algebraic development techniques. 20th international workshop, WADT 2010, Etelsen, Germany, July 1–4, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-28411-3/pbk). Lecture Notes in Computer Science 7137, 193-208 (2012).
Summary: In this paper, we propose a new framework of model transformation that combines graph transformation with algebraic specification. While graph transformation is well-suited to describe the transformation of visual models, one can observe that models are often composite structures with visual, graphical and diagrammatic components accompanied by all kinds of data objects like strings, sets, numbers, etc. that are not adequately represented by graphs. We advocate algebraic specification to cover these parts of models and tupling to combine the graph and the data components.
For the entire collection see [Zbl 1236.68008].
68Q65 Abstract data types; algebraic specification
68Q42 Grammars and rewriting systems
AToM3; GReAT; Maude; VIATRA2
Full Text: DOI
[1] Astesiano, E., Kreowski, H.-J., Krieg-Brückner, B. (eds.): Algebraic Foundations of Systems Specification. Springer, Heidelberg (1999) · Zbl 0973.68002
[2] Balasubramanian, D., Narayanan, A., van Buskirk, C.P., Karsai, G.: The graph rewriting and transformation language: GReAT. Electronic Comunications of the EASST 1 (2006)
[3] Bisztray, D., Heckel, R.: Combining Termination Criteria by Isolating Deletion. In: Ehrig, H., Rensink, A., Rozenberg, G., Schürr, A. (eds.) ICGT 2010. LNCS, vol. 6372, pp. 203–217. Springer, Heidelberg (2010) · Zbl 1306.68063 · doi:10.1007/978-3-642-15928-2_14
[4] Bisztray, D., Heckel, R., Ehrig, H.: Compositionality of model transformations. Electr. Notes Theor. Comput. Sci. 236, 5–19 (2009) · doi:10.1016/j.entcs.2009.03.011
[5] Boronat, A., Meseguer, J.: An algebraic semantics for MOF. Formal Asp. Comput. 22(3-4), 269–296 (2010) · Zbl 1213.68358 · doi:10.1007/s00165-009-0140-9
[6] Bottoni, P., Hoffmann, K., Parisi-Presicce, F., Taentzer, G.: High-level replacement units and their termination properties. J. Vis. Lang. Comput. 16(6), 485–507 (2005) · Zbl 05696099 · doi:10.1016/j.jvlc.2005.07.001
[7] Bottoni, P., Parisi-Presicce, F.: A termination criterion for graph transformations with negative application conditions. Electronic Communications of the EASST 30 (2010)
[8] Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Bevilacqua, V., Talcott, C.: All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic. LNCS, vol. 4350. Springer, Heidelberg (2007) · Zbl 1115.68046
[9] Ehrig, H., Ehrig, K., Ermel, C., Hermann, F., Taentzer, G.: Information Preserving Bidirectional Model Transformations. In: Dwyer, M.B., Lopes, A. (eds.) FASE 2007. LNCS, vol. 4422, pp. 72–86. Springer, Heidelberg (2007) · Zbl 05270464 · doi:10.1007/978-3-540-71289-3_7
[10] Ehrig, H., Ehrig, K., Hermann, F.: From model transformation to model integration based on the algebraic approach to triple graph grammars. Electronic Communications of the EASST 10 (2008) · Zbl 1169.68507
[11] Ehrig, H., Ehrig, K., de Lara, J., Taentzer, G., Varró, D., Varró-Gyapay, S.: Termination Criteria for Model Transformation. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol. 3442, pp. 49–63. Springer, Heidelberg (2005) · Zbl 1119.68344 · doi:10.1007/978-3-540-31984-9_5
[12] Ehrig, H., Ermel, C.: Semantical Correctness and Completeness of Model Transformations Using Graph and Rule Transformation. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 194–210. Springer, Heidelberg (2008) · Zbl 1175.68221 · doi:10.1007/978-3-540-87405-8_14
[13] Frankel, D.S.: Model Driven Architecture. Applying MDA to Enterprise Computing. Wiley, Indianapolis (2003)
[14] Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman (1979) · Zbl 0411.68039
[15] Heckel, R., Küster, J.M., Taentzer, G.: Confluence of Typed Attributed Graph Transformation Systems. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol. 2505, pp. 161–176. Springer, Heidelberg (2002) · Zbl 1028.68031 · doi:10.1007/3-540-45832-8_14
[16] Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to automata theory, languages, and computation, 3rd edn. Addison-Wesley Longman (2007) · Zbl 0980.68066
[17] Königs, A., Schürr, A.: Tool integration with triple graph grammars - a survey. Electr. Notes Theor. Comput. Sci. 148(1), 113–150 (2006) · doi:10.1016/j.entcs.2005.12.015
[18] Kreowski, H.-J., Kuske, S.: Graph transformation units with interleaving semantics. Formal Aspects of Computing 11(6), 690–723 (1999) · Zbl 0966.68114 · doi:10.1007/s001659970005
[19] Kreowski, H.-J., Kuske, S., von Totth, C.: Stepping from graph transformation units to model transformation units. Electronic Communications of the EASST 30 (2010)
[20] Küster, J.M.: Definition and validation of model transformations. Software and System Modeling 5(3), 233–259 (2006) · Zbl 05672213 · doi:10.1007/s10270-006-0018-8
[21] de Lara, J., Taentzer, G.: Automated Model Transformation and Its Validation Using AToM3 and AGG. In: Blackwell, A.F., Marriott, K., Shimojima, A. (eds.) Diagrams 2004. LNCS (LNAI), vol. 2980, pp. 182–198. Springer, Heidelberg (2004) · Zbl 1091.68667 · doi:10.1007/978-3-540-25931-2_18
[22] de Lara, J., Vangheluwe, H., Alfonseca, M.: Meta-modelling and graph grammars for multi-paradigm modelling in AToM3. Software and System Modeling 3(3), 194–209 (2004) · Zbl 02243150 · doi:10.1007/s10270-003-0047-5
[23] Plump, D.: Hypergraph rewriting: Critical pairs and undecidability of confluence. In: Sleep, M.R., Plasmeijer, R., van Eekelen, M. (eds.) Term Graph Rewriting. Theory and Practice, pp. 201–213. Wiley & Sons (1993)
[24] Plump, D.: Termination of graph rewriting is undecidable. Fundamenta Informaticae 33(2), 201–209 (1998) · Zbl 0903.68108
[25] Plump, D.: Checking graph-transformation systems for confluence. Electronic Communications of the EASST 26 (2010)
[26] Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol. 1. World Scientific, Singapore (1997) · Zbl 0908.68095
[27] Schürr, A.: Specification of Graph Translators with Triple Graph Grammars. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds.) WG 1994. LNCS, vol. 903, pp. 151–163. Springer, Heidelberg (1995) · doi:10.1007/3-540-59071-4_45
[28] Schürr, A., Klar, F.: 15 years of Triple Graph Grammars. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 411–425. Springer, Heidelberg (2008) · Zbl 1175.68233 · doi:10.1007/978-3-540-87405-8_28
[29] Varró, D., Balogh, A.: The model transformation language of the VIATRA2 framework. Sci. Comput. Program. 68(3), 214–234 (2007) · Zbl 1131.68040 · doi:10.1016/j.scico.2007.05.004
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.