Details

Faculty	Faculty of Science and Medicine
Domain	Computer Science
Code	UE-SIN.08502
Languages	English
Type of lesson	Lecture
Level	Master
Semester	SA-2021

Schedules and rooms

Summary schedule	Wednesday 09:15 - 12:00, Hebdomadaire (Autumn semester)
Struct. of the schedule	3h par semaine durant 14 semaines
Contact's hours	42

Teaching

Responsibles	Ultes-Nitsche Ulrich
Teachers	Ultes-Nitsche Ulrich
Assistants	Stammet Christophe
Description	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.
Training objectives	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
Comments	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.
Softskills	No
Off field	No
BeNeFri	Yes
Mobility	Yes
UniPop	No

Written exam

Assessments methods

By rating