Transforming process models: executable rewrite rules versus a formalized java program
MODELS'10 Proceedings of the 13th international conference on Model driven engineering languages and systems: Part II
A model-driven framework for guided design space exploration
ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
Incremental pattern matching for the efficient computation of transitive closure
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Graph and model transformation tools for model migration
Software and Systems Modeling (SoSyM)
A survey and comparison of transformation tools based on the transformation tool contest
Science of Computer Programming
| Hi-index | 0.00 |
As recent tool contests demonstrated graph transformation tools scale up to handle very large models for model transformations, thanks to recent advances in graph pattern matching techniques. In this paper, we assess the performance and capabilities of the Viatra2 model transformation framework by implementing the AntWorld case study of the GraBats 2008 graph transformation tool contest. First, we extend initial measurements carried out in Bergmann et al. (Proceedings of ICMT ’09, 2nd International Conference on Model Transformation, Springer, Berlin, 2009) to assess the effects of combining local search-based and incremental pattern matching strategies. Moreover, we also assess the performance characteristics of various language features of Viatra2 as well as the cost of certain model manipulation operations. We observe by experimentation how Viatra2 can scale up to large iteratively growing model sizes and focus on execution time and memory consumption. We believe that the results obtained from the benchmark example can set the course for further performance enhancement of Viatra2 and other future model transformation frameworks.