1,006 research outputs found
Event-driven grammars: Relating abstract and concrete levels of visual languages
The final publication is available at Springer via http://dx.doi.org/10.1007/s10270-007-0051-2In this work we introduce event-driven grammars, a kind of graph grammars that are especially suited for visual modelling environments generated by meta-modelling. Rules in these grammars may be triggered by user actions (such as creating, editing or connecting elements) and in their turn may trigger other user-interface events. Their combination with triple graph transformation systems allows constructing and checking the consistency of the abstract syntax graph while the user is building the concrete syntax model, as well as managing the layout of the concrete syntax representation. As an example of these concepts, we show the definition of a modelling environment for UML sequence diagrams. A discussion is also presented of methodological aspects for the generation of environments for visual languages with multiple views, its connection with triple graph grammars, the formalization of the latter in the double pushout approach and its extension with an inheritance concept.This work has been partially sponsored by the Spanish Ministry of Education and Science with projects MOSAIC (TSI2005-08225-C07-06) and MODUWEB (TIN 2006-09678)
An algebraic semantics for QVT-relations check-only transformations
Fundamenta Informaticae, 114 1, Juan de Lara, Esther Guerra, An algebraic semantics for QVT-relations check-only transformations, 73-101, Copyright 2012, with permission from IOS PressQVT is the standard for model transformation defined by the OMG in the context of the Model-Driven Architecture. It is made of several transformation languages. Among them, QVT-Relations is the one with the highest level of abstraction, as it permits developing bidirectional transformations in a declarative, relational style. Unfortunately, the standard only provides a semiformal description of its semantics, which hinders analysis and has given rise to ambiguities in existing tool implementations. In order to improve this situation, we propose a formal, algebraic semantics for QVT-Relations check-only transformations, defining a notion of satisfaction of QVT-Relations specifications by models.This work has been supported by the Spanish Ministry of Science and Innovation with projects METEORIC (TIN2008-02081) and Go Lite (TIN2011-24139), and by the R&D program of the Community of Madrid with project “e-Madrid” (S2009/TIC-1650)
From types to type requirements: Genericity for model-driven engineering
The final publication is available at Springer via http://dx.doi.org/10.1007/s10270-011-0221-0Model-driven engineering (MDE) is a software engineering paradigm that proposes an active use of models during the development process. This paradigm is inherently type-centric, in the sense that models and their manipulation are defined over the types of specific meta-models. This fact hinders the reuse of existing MDE artefacts with other meta-models in new contexts, even if all these meta-models share common characteristics. To increase the reuse opportunities of MDE artefacts, we propose a paradigm shift from type-centric to requirement-centric specifications by bringing genericity into models, meta-models and model management operations. For this purpose, we introduce so-called concepts gathering structural and behavioural requirements for models and meta-models. In this way, model management operations are defined over concepts, enabling the application of the operations to any meta-model satisfying the requirements imposed by the concept. Model templates rely on concepts to define suitable interfaces, hence enabling the definition of reusable model components. Finally, similar to mixin layers, templates can be defined at the meta-model level as well, to define languages in a modular way, as well as layers of functionality to be plugged-in into other meta-models. These ideas have been implemented in MetaDepth, a multi-level meta-modelling tool that integrates action languages from the Epsilon family for model management and code generation.This work has been sponsored by the Spanish Ministry of Science and Innovation with projects METEORIC (TIN2008-02081) and Go Lite (TIN2011-24139), and by the R&D program of the Community of Madrid with project “e-Madrid” (S2009/TIC-1650)
Towards the uniform manipulation of visual and textual languages in AToM3
This is an electronic version of the paper presented at the III Jornadas de ProgramaciĂłn y Lenguajes, held in Alicante on 2003This paper presents the approach taken in the multi-paradigm tool
AToM3 for the integration of textual and visual languages in a uniform framework.
The tool is used for the modelling, analysis and simulation of complex
(physical or software) systems, where each system component may have to be
described using a different formalism. The different visual or textual formalisms
can be described in the form of meta-models using graphical, high-level notations
such as Entity Relationship or UML class diagrams. From these descriptions,
AToM3 is able to generate a customized modelling tool for the specified
formalism. Models at any meta-level are stored as attributed, typed graphs and
thus can be manipulated (simulated, transformed, optimized, etc.) by attributed
graph grammars.
In the case of a textual notation, from the meta-model description a front-end
parser is semi-automatically generated that transforms the textual models into
abstract syntax graphs (instances of the meta-model), and thus can be manipulated
in a uniform way with the other visual notations. To illustrate these concepts,
we present an example in which we define a meta-model for Computational Tree
Logic and generate visual and textual parsers for the formalism.We would like to aknowledge the Spanish Ministry of Science and Technology (project
TIC2002-01948) for partially supporting this work
A framework for the verification of UML models. Examples using Petri Nets
This is an electronic version of the paper presented at the VIII Jornadas de IngenierĂa del Software y Bases de Datos, held in Alicante on 2003This paper presents a framework for the verification of UML
models. Our approach is to build meta-models for the different UML
diagrams and translate them into formalisms (whose syntax is also specified
with a meta-model) in which properties of interest can be proved.
The translation (denotational semantics) as well as the formalisms operational
semantics are formally described by means of graph grammars.
We show the implementation of these concepts in the Multi-Paradigm
tool AToM3 together with an example in which we translate a UML design
(composed of Statecharts, Class and Sequence diagrams) into Petri
nets for subsequent verification using model checkingPartially sponsored by the Spanish Ministry of Science and Technology (TIC2002-01948
Towards the flexible reuse of model transformations: A formal approach based on Graph Transformation
This is the author’s version of a work that was accepted for publication in Journal of Logical and Algebraic Methods in Programming. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Journal of Logical and Algebraic Methods in Programming 83.5-6 (2014) , DOI:10.1016/j.jlamp.2014.08.005This special issue of the Journal of Logic and Algebraic Methods in Programming (JLAMP) includes full revised versions of selected papers that were presented at the 24th Nordic Workshop on Programming Theory (NWPT 2012). The workshop took place in Bergen, Norway, during 31 October–2 November 2012 and was organized by the Department of Informatics, University of Bergen, and the Bergen University College.Model transformations are the heart and soul of Model Driven Engineering (MDE). However, in
order to increase the adoption of MDE by industry, techniques for developing model transformations
in the large and raising the quality and productivity in their construction, like reusability,
are still needed.
In previous works, we developed a reutilization approach for graph transformations based
on the definition of concepts, which gather the structural requirements needed by meta-models
to qualify for the transformations. Reusable transformations are typed by concepts, becoming
transformation templates. Transformation templates are instantiated by binding the concept to a
concrete meta-model, inducing a retyping of the transformation for the given meta-model.
This paper extends the approach allowing heterogeneities between the concept and the metamodel,
thus increasing the reuse opportunities of transformation templates. Heterogeneities are
resolved by using algebraic adapters which induce both a retyping and an adaptation of the
transformation. As an alternative, the adapters can also be employed to induce an adaptation of
the meta-model, and in this work we show the conditions for equivalence of both approaches to
transformation reuse.We thank the referees for their detailed comments, which helped to greatly
improve the paper. This work has been supported by the Spanish Ministry of Economy and
Competitivity with project Go-Lite (TIN2011-24139)
Robust Viable Analysis of an Ecosystem Model
URL des Documents de travail : http://centredeconomiesorbonne.univ-paris1.fr/documents-de-travail/International audienceThe World Summit on Sustainable Development (Johannesburg, 2002) encouraged the adoption of an ecosystem approach. In this perspective, we propose a theoretical management framework that deals jointly with three issues: i) ecosystem dynamics, ii) conflicting issues of production and preservation and iii) robustness with respect to dynamics uncertainties. We consider a discrete-time two-species dynamic model, where states are biomasses, and where two controls act as harvesting efforts of each species. Uncertainties take the form of disturbance affecting each species growth factors, and are assumed to take their values in a known given set. We define the robust viability kernel as the set of initial species biomasses such that at least one harvesting strategy guarantees minimal production and preservation levels for all times, whatever the uncertainties. We apply our approach to the anchovy-hake couple in the Peruvian upwelling ecosystem. We find that accounting for uncertainty sensibly shrinks the deterministic viability kernel (without uncertainties). We comment on the management implications of comparing robust viability kernels (with uncertainties) and the deterministic one (without uncertainties).Le Sommet Mondial pour le Développement Mondial (Johannesburg, 2002) a encouragé l'adoption d'une gestion écosystémique des ressources halieutiques. Dans cette perspective, nous proposons un cadre d'analyse qui traite à la fois i) les dynamiques des écosystèmes, ii) les conflits entre objectifs de production et préservation et iii) se veut robuste en environnement incertain. Précisément, l'incertitude prend la forme de perturbations affectant les taux de croissance de chaque espèce et sont supposées prendre leurs valeurs dans un ensemble connu. Nous définissons le concept de noyau robuste viable comme l'ensemble des biomasses initiales des différentes espèces, tel qu'il existe au moins une stratégie de pêche capable de garantir les niveaux minimums de production et de préservation en tout temps et pour toutes incertitudes. Nous appliquons notre approche au couple anchois-merlu de l'upwelling péruvien. Nous constatons que l'introduction d'incertitudes réduit significativement le noyau robuste viable relativement au cas déterministe (sans incertitudes). Nous discutons alors des mesures de gestion qu'impliquent la comparaison des noyaux robustes viables (avec incertitudes) et du noyau déterministe (sans incertitudes)
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
- …