Bridging WebML to model-driven engineering: from document type definitions to meta object facility

IET Software ◽  
2007 ◽  
Vol 1 (3) ◽  
pp. 81-97 ◽  
Author(s):  
A. Schauerhuber ◽  
E. Kapsammer ◽  
W. Schwinger ◽  
W. Retschitzegger ◽  
M. Wimmer
Keyword(s):  
Model Driven Engineering ◽  
Document Type ◽  
Model Driven ◽  
Meta Object Facility

scholarly journals On the automation-supported derivation of domain-specific UML profiles considering static semantics

2021 ◽  
Author(s):  
Alexander Kraas
Keyword(s):  
Model Driven Engineering ◽  
Description Language ◽  
Uml Profile ◽  
Model Driven ◽  
Domain Specific ◽  
Static Semantics ◽  
Uml Profiles ◽  
Meta Object Facility ◽  
Grammar Formalisms ◽  
Traditional Approaches

AbstractIn the light of standardization, the model-driven engineering (MDE) is becoming increasingly important for the development of DSLs, in addition to traditional approaches based on grammar formalisms. Metamodels define the abstract syntax and static semantics of a DSL and can be created by using the language concepts of the Meta Object Facility (MOF) or by defining a UML profile.Both metamodels and UML profiles are often provided for standardized DSLs, and the mappings of metamodels to UML profiles are usually specified informally in natural language, which also applies for the static semantics of metamodels and/or UML profiles, which has the disadvantage that ambiguities can occur, and that the static semantics must be manually translated into a machine-processable language.To address these weaknesses, we propose a new automated approach for deriving a UML profile from the metamodel of a DSL. One novelty is that subsetting or redefining metaclass attributes are mapped to stereotype attributes whose values are computed at runtime via automatically created OCL expressions. The automatic transfer of the static semantics of a DSL to a UML profile is a further contribution of our approach. Our DSL Metamodeling and Derivation Toolchain (DSL-MeDeTo) implements all aspects of our proposed approach in Eclipse. This enabled us to successfully apply our approach to the two DSLs Test Description Language (TDL) and Specification and Description Language (SDL).

Model-driven engineering and run-time model-usage in service robotics

2012 ◽  
Vol 47 (3) ◽  
pp. 73-82 ◽  
Author(s):  
Andreas Steck ◽  
Alex Lotz ◽  
Christian Schlegel
Keyword(s):  
Model Driven Engineering ◽  
Service Robotics ◽  
Time Model ◽  
Model Driven ◽  
Run Time

Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming

2021 ◽  
Author(s):  
Nils Weidmann ◽  
Anthony Anjorin
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Experimental Evaluation ◽  
Graph Grammars ◽  
Model Driven Engineering ◽  
Rule Based ◽  
Consistency Management ◽  
Model Driven ◽  
Triple Graph Grammars ◽  
Domain Constraints

AbstractIn the field of Model-Driven Engineering, Triple Graph Grammars (TGGs) play an important role as a rule-based means of implementing consistency management. From a declarative specification of a consistency relation, several operations including forward and backward transformations, (concurrent) synchronisation, and consistency checks can be automatically derived. For TGGs to be applicable in realistic application scenarios, expressiveness in terms of supported language features is very important. A TGG tool is schema compliant if it can take domain constraints, such as multiplicity constraints in a meta-model, into account when performing consistency management tasks. To guarantee schema compliance, most TGG tools allow application conditions to be attached as necessary to relevant rules. This strategy is problematic for at least two reasons: First, ensuring compliance to a sufficiently expressive schema for all previously mentioned derived operations is still an open challenge; to the best of our knowledge, all existing TGG tools only support a very restricted subset of application conditions. Second, it is conceptually demanding for the user to indirectly specify domain constraints as application conditions, especially because this has to be completely revisited every time the TGG or domain constraint is changed. While domain constraints can in theory be automatically transformed to obtain the required set of application conditions, this has only been successfully transferred to TGGs for a very limited subset of domain constraints. To address these limitations, this paper proposes a search-based strategy for achieving schema compliance. We show that all correctness and completeness properties, previously proven in a setting without domain constraints, still hold when schema compliance is to be additionally guaranteed. An implementation and experimental evaluation are provided to support our claim of practical applicability.

Sign in / Sign up

Export Citation Format

Share Document