Skip to main content
Jump to: navigation, search

Difference between revisions of "Henshin/Graphical Editor"

Line 3: Line 3:
 
Henshin transformation rules mainly consists of two Graph objects, commonly referred to as LHS and RHS (left- and right-hand side), and mappings between nodes from the LHS and the RHS. The LHS is the graph pattern matched by the rule. The RHS describes the action of the rule, e.g. whether objects or links should be deleted. The maapings from the LHS to the RHS encode which objects should be preserved by the rule.
 
Henshin transformation rules mainly consists of two Graph objects, commonly referred to as LHS and RHS (left- and right-hand side), and mappings between nodes from the LHS and the RHS. The LHS is the graph pattern matched by the rule. The RHS describes the action of the rule, e.g. whether objects or links should be deleted. The maapings from the LHS to the RHS encode which objects should be preserved by the rule.
  
The graphical editor uses a more intuitive way of representing rules. Essentially, elements in a rule are annotated with actions such as <<create>>, <<delete>>, <<preserve>> and <<forbid>>. A screenshot of a simple, but not very meaningful, transformation rule in both editors is shown below. Note that you need to import EMF models first in both editors. This can be done using the context menu. In the graphical editor, all classes automatically appear in the palette on the right.
+
The graphical editor offers a more intuitive way of representing rules. Essentially, elements in a rule are annotated with actions such as <<create>>, <<delete>>, <<preserve>> and <<forbid>>. A screenshot of a simple, but not very meaningful, transformation rule in both editors is shown below. Note that you need to import EMF models first in both editors. This can be done using the context menu. In the graphical editor, all classes automatically appear in the palette on the right.
  
 
[[Image:Henshin_example_transformation_rule.png]]
 
[[Image:Henshin_example_transformation_rule.png]]
  
The example rule is called ''Test'' and it matches two objects, one of type ''Library'' and one of type ''Writer''. Additionally, the writer instance must be contained in the library instance via the ''writers'' containment reference, and its ''name'' attribute must be set to "Smith". The last condition that must be fulfilled for that rule to be applicable is that the library instance must not contain a instance of type ''Book'' in its ''books'' containment reference. This is a so-called ''negative application condition'' (NAC).  
+
The example rule is called ''ReplaceBook'' and is defined in the context of a ''Library'' object. This means that all matched elements must be contained in a ''Library'' instance and newly created objects are automatically added to it. The rule matches two objects (plus a ''Library'' instance), one of type ''Writer'' and one of type ''Book''. The book is being deleted by this rule and a new instance of ''BookOnTape'' is created with the same title and author as the book. The ''name'' attribute of the ''Writer'' instance is converted to upper case. Moreover the rule cannot be applied if there exists a ''Borrower'' for the book or the category of the book is ''Mystery''. Not that the <<forbid>> actions can be parameterized to distinguish the negative application conditions (NACs). This essientially corresponds to logical AND vs. OR (more generally: first-order logic formulas over graph patterns). If all application conditions (positive and negative ones) are fulfilled, the rule can be applied. The changes are performed in a transaction and are therefore atomic.
 
+
In the graphical editor this can be realized using a <<forbid>> action. These actions can have an optional parameter that serves as an ID for the negative application condition. For instance <<forbid:0>> and <<forbid:1>> describe two different NACs. If two elements are associated to the same NAC it means that the two objects must not be present together. If they have different IDs neither of them is allowed. This essientially corresponds to logical AND vs. OR.
+
 
+
If all the above conditions are fulfilled, our example rule can be applied. It performs the following actions in an atomic step: delete the writer instance from the library and create and add a book instance to the library. Note that you can also define attribute calculations (not shown in this example).
+
  
 
If you look at the tree-based editor, you see that the graphical notation is quite different from the underlying model. The Henshin transformation model allows you to define very complex in-place transformations. The graphical editor currently does not support all of the powerful language concepts, yet.
 
If you look at the tree-based editor, you see that the graphical notation is quite different from the underlying model. The Henshin transformation model allows you to define very complex in-place transformations. The graphical editor currently does not support all of the powerful language concepts, yet.

Revision as of 09:34, 8 September 2010

Model transformations in Henshin are defined using matched transformation rules. There are currently two editors available for rules: a tree-based editor (EMF) and a graphical one (GMF).

Henshin transformation rules mainly consists of two Graph objects, commonly referred to as LHS and RHS (left- and right-hand side), and mappings between nodes from the LHS and the RHS. The LHS is the graph pattern matched by the rule. The RHS describes the action of the rule, e.g. whether objects or links should be deleted. The maapings from the LHS to the RHS encode which objects should be preserved by the rule.

The graphical editor offers a more intuitive way of representing rules. Essentially, elements in a rule are annotated with actions such as <<create>>, <<delete>>, <<preserve>> and <<forbid>>. A screenshot of a simple, but not very meaningful, transformation rule in both editors is shown below. Note that you need to import EMF models first in both editors. This can be done using the context menu. In the graphical editor, all classes automatically appear in the palette on the right.

Henshin example transformation rule.png

The example rule is called ReplaceBook and is defined in the context of a Library object. This means that all matched elements must be contained in a Library instance and newly created objects are automatically added to it. The rule matches two objects (plus a Library instance), one of type Writer and one of type Book. The book is being deleted by this rule and a new instance of BookOnTape is created with the same title and author as the book. The name attribute of the Writer instance is converted to upper case. Moreover the rule cannot be applied if there exists a Borrower for the book or the category of the book is Mystery. Not that the <<forbid>> actions can be parameterized to distinguish the negative application conditions (NACs). This essientially corresponds to logical AND vs. OR (more generally: first-order logic formulas over graph patterns). If all application conditions (positive and negative ones) are fulfilled, the rule can be applied. The changes are performed in a transaction and are therefore atomic.

If you look at the tree-based editor, you see that the graphical notation is quite different from the underlying model. The Henshin transformation model allows you to define very complex in-place transformations. The graphical editor currently does not support all of the powerful language concepts, yet.

Back to the top