Prof. Dr. Arend Rensink, University of Twente, Enschede

Abstract:

Many distinct notions of rule composition have been studied with graph transformation; among the well-known ones are control programs, rule amalgamation and transformation units. In this talk we address a particular control construction, namely the abstraction of an arbitrary control program into a single „high-level“ rule, which we call a recipe.

Recipes should share the atomic „all-or-nothing“ nature of low-level rules, but in the presence of try-else or as-long-as-possible operators this is not straightforward to achieve, as it requires a careful treatment of backtracking. We discuss both the theoretical and the practical aspects of the problem, and present the solution as it has been implemented in the graph transformation tool GROOVE.