Abstract
PROGRES is one of the most mature graph transformation languages currently available. It offers many language features, also some for non-homomorphic transformations, e.g. set-nodes. Nevertheless, the language does not offer a comfortable possibility to work with complex set-valued structures. However, these are often useful when modeling complex systems, e.g. simulation systems, models-of-computation, or product lines using multiplicity variation points. We introduce the notion of set-valued transformations to PROGRES, define their syntax and semantics and show how they can be simulated using basic language constructs offered by most algorithmic graph transformation languages with a rich set of control structures.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, A., Karsai, G., Neema, S., Shi, F., Vizhanyo, A.: The design of a language for model transformations. Journal on Software and System Modeling 5(3), 261–288 (2006)
Balasubramanian, D., Narayanan, A., Neema, S., Ness, B., Shi, F., Thibodeaux, R., Karsai, G.: Applying a grouping operator in model transformations. In: Schürr, A., Nagl, M., Zündorf, A. (eds.) AGTIVE 2007. LNCS, vol. 5088. Springer, Heidelberg (2008)
Balasubramanian, D., Narayanan, A., Neema, S., Shi, F., Thibodeaux, R., Karsai, G.: A subgraph operator for graph transformation languages. In: Margaria, et al. (eds.) [18], pp. 95–106
Bardohl, R., Taentzer, G., Minas, M., Schürr, A.: Application of Graph Transformation to Visual Languages, vol. 2, pp. 105–180. World Scientific, Singapore (1999)
Bauderon, M., Courcelle, B.: Graph expressions and graph rewritings. Technical report, University Bordeaux, Department of Mathematics and Informatics, TRÂ 8525 (1985)
Corradini, A., Ehrig, H., Heckel, R., Korff, M., Löwe, M., Ribeiro, L., Wagner, A.: Algebraic Approaches to Graph Transformation – Part I: Basic Concepts and Double Pushout Approach, vol. 1, pp. 163–245. World Scientific, Singapore (1997)
Courcelle, B.: A representation of graphs by algebraic expressions and its use for graph rewriting systems. In: Ehrig, et al. (eds.) [8], pp. 112–132
Ehrig, H., Nagl, M., Rosenfeld, A., Rozenberg, G. (eds.): Graph Grammars 1986. LNCS, vol. 291. Springer, Heidelberg (1987)
Engels, G., Lewerentz, C., Schäfer, W.: Graph grammar engineering: A software specification method. In: Ehrig, et al. (eds.) [8], pp. 186–201
Fischer, T., Niere, J., Torunski, L., Zündorf, A.: Story Diagrams: A new graph rewrite language based on the Unified Modeling Language. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 296–309. Springer, Heidelberg (2000)
Fujaba – From UML to Java and Back Again (1999), http://www.fujaba.de/
Fuss, C., Mosler, C., Ranger, U., Schultchen, E.: The jury is still out: A comparison of agg, fujaba, and progres. In: Margaria, et al. (eds.) [18], pp. 183–195
Guerra, E., de Lara, J.: Adding recursion to graph transformation. In: Margaria, et al. (eds.) [18], pp. 107–120
Karsai, G., Agrawal, A., Shi, F., Sprinkle, J.: On the use of graph transformation in the formal specification of model interpreters. Journal of Universal Computer Science 9(11), 1296–1321 (2003)
Körtgen, A.-T.: Modeling successively connected repetitive subgraphs. In: Schürr, A., Nagl, M., Zündorf, A. (eds.) AGTIVE 2007. LNCS, vol. 5088. Springer, Heidelberg (2008)
Lewerentz, C.: Interaktives Entwerfen großer Programmsysteme. PhD-Thesis, RWTH Aachen, IFB 194 (1988)
Lindqvist, J., Lundkvist, T., Porres, I.: A query language with the star operator. In: Margaria, et al. (eds.) [18], pp. 69–80
Margaria, T., Padberg, J., Taentzer, G. (eds.): Proc. of the 6th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2007), Braga, Portugal. Electronic Communications of the EASST, vol. 6 (March 2007)
Nagl, M.: Graph-Grammatiken: Theorie, Anwendungen, Implementierung. Vieweg Verlag (1979)
Schürr, A.: Operationales Spezifizieren mit programmierten Graphersetzungssystemen. Deutscher Universitätsverlag, Wiesbaden, Doctoral Dissertation (1991)
Taentzer, G.: Parallel and distributed graph transformation: Formal description and application to communication-based systems. Doctoral dissertation, Technische Universität Berlin (1996)
Taentzer, G.: AGG: A tool environment for algebraic graph transformation. In: Münch, M., Nagl, M. (eds.) AGTIVE 1999. LNCS, vol. 1779, pp. 481–488. Springer, Heidelberg (2000)
Taentzer, G., Beyer, M.: Amalgamated graph transformations and their use for specifying agg - an algebraic graph grammar system. In: Dagstuhl Seminar on Graph Transformations in Computer Science, pp. 380–394 (1993)
Taentzer, G., Ehrig, K., Guerra, E., de Lara, J., Lengyel, L., Levendovszky, T., Prange, U., Varró, D., Varró-Gyapay, S.: Model Transformation by Graph Transformation: A Comparative Study. In: Proceedings of the International Workshop on Model Transformations in Practice, MTiP 2005 (Satellite Event of MoDELS 2005), Montego Bay, Jamaica (2005)
Varró, G., Schürr, A., Varró, D.: Benchmarking for graph transformation. In: 2005 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC), pp. 79–88. IEEE Computer Society, Los Alamitos (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fuss, C., Tuttlies, V.E. (2008). Simulating Set-Valued Transformations with Algorithmic Graph Transformation Languages. In: Schürr, A., Nagl, M., Zündorf, A. (eds) Applications of Graph Transformations with Industrial Relevance. AGTIVE 2007. Lecture Notes in Computer Science, vol 5088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89020-1_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-89020-1_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89019-5
Online ISBN: 978-3-540-89020-1
eBook Packages: Computer ScienceComputer Science (R0)