Details

Fakultät	Math.-Nat. und Med. Fakultät
Bereich	Informatik
Code	UE-SIN.08502
Sprachen	Englisch
Art der Unterrichtseinheit	Vorlesung
Kursus	Master
Semester	SA-2021

Zeitplan und Räume

Vorlesungszeiten	Mittwoch 09:15 - 12:00, Wöchentlich (Herbstsemester)
Strukturpläne	3h par semaine durant 14 semaines
Kontaktstunden	42

Unterricht

Verantwortliche	Ultes-Nitsche Ulrich
Dozenten-innen	Ultes-Nitsche Ulrich
Assistenten	Stammet Christophe
Beschreibung	In this course unit, we deal with a fraction of automata theory that is applied when it comes to representing behaviours of reactive systems (OS, communications protocols, control systems, etc.). The common abstraction of the indefinite running time of such systems is the assumption that they run forever, leading to automata models operating on infinite sequences or trees. We will explore different equivalent models of automata on infinite words, namely Büchi, Muller, and Rabin Automata. We will learn how to manipulate them algorithmically, and explore their relation to logic, in particular to the monadic second-order logic of one successor. Finally, we will look at what changes, when these automata are applied to infinite trees rather than infinite words.
Lernziele	After the completion of this course unit, the student will: - know how to manipulate automata algorithmically - be able to relate set operations to operations on the automaton level - understand the limited expressiveness of finite-state automata - see the link between logic and automata - know how to exploit automata and logic to express properties of systems
Bemerkungen	MSc-CS BENEFRI - (Code Ue: 43024/ Tracks: T4) The exact date and time of this course as well as the full course list can be found under http://diuf.unifr.ch/drupal/mcs/program/courses-timetable/courses.
Soft Skills	Nein
ausserhalb des Bereichs	Nein
BeNeFri	Ja
Mobilität	Ja
UniPop	Nein

Schriftliche Prüfung

Bewertungsmodus

Nach Note