2005
DOI: 10.1016/j.entcs.2004.12.040
|View full text |Cite
|
Sign up to set email alerts
|

A Systematic Approach to Metamodeling Environments and Model Transformation Systems in VMTS

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
30
0

Year Published

2005
2005
2014
2014

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 43 publications
(30 citation statements)
references
References 2 publications
0
30
0
Order By: Relevance
“…supported by VIATRA2 [15], VMTS [21], AToM3 [17], GReAT [9], MOFLON [13], Gmorph [26] and MOTMOT [14]. While all dealing with graphs and their manipulation, these approaches differ heavily concerning the kind of graphs used and the transformation concepts supported.…”
Section: Graph Transformation Related Approachesmentioning
confidence: 99%
“…supported by VIATRA2 [15], VMTS [21], AToM3 [17], GReAT [9], MOFLON [13], Gmorph [26] and MOTMOT [14]. While all dealing with graphs and their manipulation, these approaches differ heavily concerning the kind of graphs used and the transformation concepts supported.…”
Section: Graph Transformation Related Approachesmentioning
confidence: 99%
“…The precondition of a transaction is a query, which should never fail, being applied to the input graph of the VOL. 5, NO Using this environment it is easy to edit metamodels, design models according to their metamodels, transform models using graph rewriting [Levendovszky04a] [Levendovszky04c]. The Validation Module, which is a part of the AGSI Core facilitates to check constraints contained by metamodels during the metamodel instantiation, and to J OURNAL OF OBJECT TECHNOLOGY V OL.…”
Section: Backgrounds and Related Workmentioning
confidence: 99%
“…This mathematical background makes possible to treat models as labeled graphs and to apply graph transformation algorithms to models using graph rewriting [Levendovszky04a] [Levendovszky04b]. The steps of graph transformation are rewriting rules, each rewriting rule consists of a left-hand side graph (LHS) and right-hand side graph (RHS).…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Since Viatra2 can also be regarded as a graph transformation tool, we now compare the advanced language constructs to similar constructs available in the most popular graph transformation tools, namely, AGG [12], ATOM3 [10], FU-JABA [15], GReAT [13], PROGRES [19], VMTS [14] and VIATRA2 [4]. In the future we plan to extend this detailed comparison with other model transformation approaches not based on graph transformation, which was out of scope for the current paper due to space limitations.…”
Section: Related Workmentioning
confidence: 99%