Specification and Programming (by Graph Transformation)

✍ Scribed by Hans-Jörg Kreowski

• Publisher: Elsevier Science
• Year: 1995
• Tongue: English
• Weight: 181 KB
• Volume: 2
• Category: Article
• ISSN: 1571-0661
• DOI: 10.1016/s1571-0661(05)80195-1

✦ Synopsis

In this tutorial, some basic ideas will be outlined and exempli ed how graph transformation can be employed in speci cation and programming. In particular, some of the respective a c hievements of the COMPUGRAPH project will be pointed out.

Graphs are widely used in many areas of Computer Science and beyond to describe complex system states, structured objects, networks and relations among components. Rules are even wider used to de ne permitted actions, up-dates, transitions and transformations. Typical examples can be found in functional and logical programming, term rewriting, theorem proving, Petri nets, etc. Graphs and rules together yield the paradigm of graph transformation of which one encounters quite a variety of approaches in the literature (see, e.g. 3,8,9,7,24]). Graph transformation provides a natural way to model systems and to analyze their behaviour.

In this tutorial, some basic ideas will be outlined and exempli ed how graph transformation can be employed in speci cation and programming. In particular, some of the respective a c hievements of the COMPUGRAPH project will be pointed out. Three lines of recent i n vestigations will be discussed in more detail.