| Art der Veröffentlichung: |
Artikel |
| Autor: |
Mark Minas, Berthold Hoffmann |
| Titel: |
An Example of Cloning Graph Transformation Rules for Programming |
| Band: |
211 |
| Seite(n): |
241 – 250 |
| Zeitschrift: |
Electronic Notes in Theoretical Computer Science |
| Erscheinungsjahr: |
2008 |
| Abstract / Kurzbeschreibung: |
Graphical notations are already popular for the design of software, as witnessed by the success of the Uniform Modeling Languages (UML. In this paper, we advocate the use of graphs and graph transformation for programming graph-based systems. Our case study, the flattening of hierarchical statecharts, reveals that cloning, a recently proposed transformation concept, makes graph transformation rules (in the double-pushout approach) more expressive. Thus programming becomes easier, and gets along with simpler control conditions in particular. |
| PDF Version: |
http://www.informatik.uni-bremen.de/~hof/papers/GTVMT06.pdf |
| Schlagworte: |
cloning, Statecharts, DiaPlan |
| Status: |
Reviewed |
| Letzte Aktualisierung: |
18. 06. 2008 |
