GReAT

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages) This article has an unclear citation style. The references used may be made clearer with a different or consistent style of citation and footnoting. (April 2024) (Learn how and when to remove this message) This article may rely excessively on sources too closely associated with the subject, potentially preventing it from being verifiable and neutral. Please help improve this article by replacing such sources with more appropriate citations to reliable, independent sources. (November 2024) (Learn how and when to remove this message) (Learn how and when to remove this message)

Graph Rewriting and Transformation (GReAT) is a model transformation language (MTL) for Model Integrated Computing available in the GME environment. GReAT has a rich pattern specification sublanguage, a graph transformation sublanguage and a high level control-flow sublanguage. It has been designed to address the specific needs of the model transformation area. The GME environment is an example of a model-driven engineering (MDE) framework.

See also

• ATLAS Transformation Language
• CoSMIC
• Domain Specific Language (DSL)
• Domain-specific modelling (DSM)
• Model-based testing (MBT)
• Meta-Object Facility
• Meta-modeling
• VIATRA
• XMI
• OCL
• QVT

References

• GReAT ref 1 Archived 2004-07-06 at the Wayback Machine
• GReAT ref 2
• GReAT ref 3 [broken link]
• GReAT ref 4 [broken link]
• GReAT ref 5 [broken link]
• GReAT ref 6 [broken link]
• GReAT ref 7
• GReAT ref 8 Archived 2005-10-31 at the Wayback Machine
• GReAT ref 9 [broken link]

This graph theory-related article is a stub. You can help Wikipedia by adding missing information.

• v
• t
• e