Stud.IP Uni Oldenburg
University of Oldenburg
21.11.2019 06:35:58
inf402 - Graph Transformation Systems (Complete module description)
Original version English Download as PDF
Module label Graph Transformation Systems
Module code inf402
Credit points 6.0 KP
Workload 180 h
Faculty/Institute Department of Computing Science
Used in course of study
  • Bachelor's Programme Computing Science (Bachelor) >
  • Dual-Subject Bachelor's Programme Computing Science (Bachelor) >
  • Master of Education Programme (Gymnasium) Computing Science (Master of Education) >
Contact person
Module responsibility
Authorized examiners
Entry requirements
Skills to be acquired in this module
Modelling of systems, introduction to graph transformation systems, sequential and parallel independence, termination and confluence.

Professional competence
The students:
  • Know the basics of graph transformation systems and graph programs
  • Describe graph transformation systems and graph programs
  • Define the Turing completeness of graph programs
  • Model systems and system changes
  • Prove sequential and parallel independence of derivations
  • Prove termination and confluence of graph transformation systems


Methodological competence
The students:
  • Recognize graph transformation systems as a versatile tool for modelling in computer science


Social competence
The students:
  • Work together in small groups to solve problems
  • Present solutions to problems to groups of other students


Self-competence
The students:
  • Learn persistence in pursuing difficult tasks
  • Learn precision in writing down solutions
Module contents
Graphs are practically used in all areas of computer science to display complex structures. Some examples are flow charts, circuit diagrams, record structures, parse trees and functional and logical expressions. Such structures can be dynamically changed by graph rewriting systems. The changing process is represented by rewriting rules. This module gives an introduction to the field of graph transformation systems. It deals with reversibility, embedding and restriction of derivations, sequential and parallel independency, termination and confluence.
Reader's advisory
Handbook of Graph Grammars and Computing by Graph Transformation,
Vol. 1: Foundations, World Scientific, 1997.
Vol. 2: Applications, Languages and Tools, World Scientific, 1999.
Vol. 3: Concurrency, Parallelism, and Distribution, World Scientific, 1999.
H. Ehrig et al.: Fundamentals of Algebraic Graph Transformation. EATCS Monographs of Theoretical Computer Science, Springer, 2006
Links
Language of instruction German
Duration (semesters) 1 Semester
Module frequency im 2-Jahres-Zyklus
Module capacity unlimited
Modullevel AS (Akzentsetzung / Accentuation)
Modulart je nach Studiengang Pflicht oder Wahlpflicht
Lern-/Lehrform / Type of program V+Ü
Vorkenntnisse / Previous knowledge inf401: Theoretische Informatik II
Course type Comment SWS Frequency Workload attendance
Lecture 3.00 SuSe or WiSe 42 h
Exercises 1.00 SuSe or WiSe 14 h
Total time of attendance for the module 56 h
Examination Time of examination Type of examination
Final exam of module
At the end of the lecture period
Written exam or oral exam