inf402 - Graph Transformation Systems (Complete module description)

Navigation

Stud.IP Uni Oldenburg

University of Oldenburg Stud.IP homepage

26.03.2023 11:49:34

Module label	Graph Transformation Systems
Modulkürzel	inf402
Credit points	6.0 KP
Workload	180 h
Institute directory	Department of Computing Science
Verwendbarkeit des Moduls	Dual-Subject Bachelor's Programme Computing Science (Bachelor) > Wahlpflicht Theoretische Informatik (30 KP) Master of Education Programme (Gymnasium) Computing Science (Master of Education) > Wahlpflichtmodule (Theoretische Informatik)
Zuständige Personen	Lehrenden, Die im Modul (Prüfungsberechtigt) Lehrenden, Die im Modul (Module responsibility)
Prerequisites
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.
Literaturempfehlungen	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 / module level	AS (Akzentsetzung / Accentuation)
Modulart / typ of module	je nach Studiengang Pflicht oder Wahlpflicht
Lehr-/Lernform / Teaching/Learning method	V+Ü
Vorkenntnisse / Previous knowledge	inf401: Theoretische Informatik II

Form of instruction	SWS	Frequency	Workload of compulsory attendance
Lecture	3	SoSe oder WiSe	42
Exercises	1	SoSe oder WiSe	14
Präsenzzeit Modul insgesamt			56 h

Examination	Prüfungszeiten	Type of examination
Final exam of module	At the end of the lecture period	Written exam or oral exam