Formal Methods

We present formal modeling languages and analysis tools for discrete-event dynamical systems, with applications from computer science. The languages we discuss are based on mathematical logic, automata, and graph game models. The analysis methods include model checking, and graph algorithms. We give brief introductions to advanced models incorporating probabilities, game-theoretic aspects, and continuous behavior.

Target group: general, 1st year students; Prerequisites: Basic mathematical concepts of set theory (union, intersection etc.), and basics of probability.

Prerequisites: None

Evaluation: None

Teaching format: None

ECTS: 3 Year: 2020

Track segment(s):
CS-PROG Computer Science - Programming Languages

Teacher(s):
Krishnendu Chatterjee

Teaching assistant(s):
Jakub Svoboda

If you want to enroll to this course, please click: REGISTER