Type Annotation for Adaptive Systems

We introduce type annotations as a flexible typing mechanism for graph systems and discuss their advantages with respect to classical typing based on graph morphisms. In this approach the type system is incorporated with the graph and elements can adapt to changes in context by changing their type annotations. We discuss some case studies in which this mechanism is relevant.Comment: In Proceedings GaM 2016, arXiv:1612.0105

Ludo: A Case Study for Graph Transformation Tools

In this paper we describe the Ludo case, one of the case studies of the AGTIVE 2007 Tool Contest (see [22]). After summarising the case description, we give an overview of the submitted solutions. In particular, we propose a number of dimensions along which choices had to be made when solving the case, essentially setting up a solution space; we then plot the spectrum of solutions actually encountered into this solution space. In addition, there is a brief description of the special features of each of the submissions, to do justice to those aspects that are not distinguished in the general solution space

Hacia la definición de lenguajes específicos de dominio con sintaxis gráfica y textual

Also published online by CEUR Workshop Proceedings (CEUR-WS.org, ISSN 1613-0073) En este artículo describimos nuestro enfoque para la asignación de sintaxis concreta tanto gráfica como textual a Lenguajes Específicos de Dominio (LEDs). Nuestra aproximación consiste en definir un meta-modelo que describe la sintaxis abstracta del LED, a cuyos elementos se puede asignar una visualización gráfica. Para asignarles una sintaxis textual se ha construido un meta-modelo con conceptos relevantes para la descripción de programas textuales (por ejemplo, operador, expresión, secuencia, etc). Se han definido una serie de transformaciones que, a partir del meta-modelo de la sintaxis abstracta del LED, generan un modelo conforme al meta-modelo para la sintaxis textual, que el diseñador del LED puede posteriormente refinar. A partir de este modelo, es posible generar un parser que crea instancias válidas del meta-modelo del LED a partir de programas textuales conformes a la gramática.Este trabajo ha sido subvencionado en parte por el Ministerio de Educación y Ciencia, proyecto MOSAIC (TSI2005-08225-C07-06), y por la Consejería de Educación de la Comunidad de Madrid y el Fondo Social Europeo (F.S.E.), mediante una beca FP

Satisfaction, Restriction and Amalgamation of Constraints in the Framework of M-Adhesive Categories

Application conditions for rules and constraints for graphs are well-known in the theory of graph transformation and have been extended already to M-adhesive transformation systems. According to the literature we distinguish between two kinds of satisfaction for constraints, called general and initial satisfaction of constraints, where initial satisfaction is defined for constraints over an initial object of the base category. Unfortunately, the standard definition of general satisfaction is not compatible with negation in contrast to initial satisfaction. Based on the well-known restriction of objects along type morphisms, we study in this paper restriction and amalgamation of application conditions and constraints together with their solutions. In our main result, we show compatibility of initial satisfaction for positive constraints with restriction and amalgamation, while general satisfaction fails in general. Our main result is based on the compatibility of composition via pushouts with restriction, which is ensured by the horizontal van Kampen property in addition to the vertical one that is generally satisfied in M-adhesive categories.Comment: In Proceedings ACCAT 2012, arXiv:1208.430

Translating model simulators to analysis models

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-78743-3_6Proceedings of 11th International Conference, FASE 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008.We present a novel approach for the automatic generation of model-to-model transformations given a description of the operational semantics of the source language by means of graph transformation rules. The approach is geared to the generation of transformations from Domain-Specific Visual Languages (DSVLs) into semantic domains with an explicit notion of transition, like for example Petri nets. The generated transformation is expressed in the form of operational triple graph grammar rules that transform the static information (initial model) and the dynamics (source rules and their execution control structure). We illustrate these techniques with a DSVL in the domain of production systems, for which we generate a transformation into Petri nets.Work sponsored by the Spanish Ministry of Science and Education, project MOSAIC (TSI2005-08225-C07-06

A UML/OCL framework for the analysis of fraph transformation rules

In this paper we present an approach for the analysis of graph transformation rules based on an intermediate OCL representation. We translate different rule semantics into OCL, together with the properties of interest (like rule applicability, conflicts or independence). The intermediate representation serves three purposes: (i) it allows the seamless integration of graph transformation rules with the MOF and OCL standards, and enables taking the meta-model and its OCL constraints (i.e. well-formedness rules) into account when verifying the correctness of the rules; (ii) it permits the interoperability of graph transformation concepts with a number of standards-based model-driven development tools; and (iii) it makes available a plethora of OCL tools to actually perform the rule analysis. This approach is especially useful to analyse the operational semantics of Domain Specific Visual Languages. We have automated these ideas by providing designers with tools for the graphical specification and analysis of graph transformation rules, including a backannotation mechanism that presents the analysis results in terms of the original language notation