Abstract
Transformation units are a structuring principle for graph transformation systems. They consist of a set of graph transformation rules, descriptions of initial and terminal graphs, a control condition, and a set of imported transformation units. Semantically, they transform initial graphs to terminal ones by interleaving rule applications with calls to imported units in such a way that the control condition is satisfied. In order to describe large classes of similar transformation units in a manageable and finite way, we extend transformation units with formal parameters. The components of a parameterized transformation unit are typed expressions containing typed variables as parameters. It turns out that parameter instantiation of a parameterized transformation unit yields again a parameterized transformation unit and is associative.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
