Theory of Computational Systems Course, Summer 2006
Time, Location: Tue 3-4 in T04, Techno-Z and Th 10-12 in T03, Techno-Z. First lecture is on Tue, March 7, 2006.
This course is for the practically-minded graduate student who always wanted to know what the theory of computation and systems is good for. The course provides a hands-on yet graduate-level introduction to the classical theory of computation and to the theory of computational systems such as concurrent, reactive, real-time, and hybrid systems. The first part of the course reviews classical automata theory, formal languages, and computational complexity theory; the second part gives an overview of concurrency models such as CSP, CCS, and Petri nets, as well as of reactive, real-time, and hybrid systems such as timed and hybrid automata. The key question asked in this course is: why do we need theories of computation and systems and how do they manifest in practice? The purpose of this course is to give practical meaning to computer science theory and advocate principled engineering. The target audience are students interested in the design of complex software systems such as operating systems, distributed systems, and real-time systems. Students will experience casual access to computer science theory by designing (defining) and implementing (proving) their own mini theories of computation or systems in class projects.
Goal of the course:
Learn how to make sense of computer science theory and appreciate principled engineering.
List of projects:
Grading: 20% home work, 80% project.
Prerequisites: Basic knowledge in automata theory, formal languages, and computational complexity theory is helpful but not required.
Technical contact: Harald . Roeck @ cs . uni-salzburg . at