Basic Information
Automata Over Infinite Words# Acceptance Conditions, Expressiveness, Algorithms and Constructions. Translation Between Types of Automata. Temporal Logic# Linear Temporal Logic (ltl), Monadic Second-order Logic (mso) and The Fragment S1s. Translation Between Logics And Automata. Ltl Model Checking. Games# Infinite Games On Graphs. Solving Reachability, Buchi and Parity Games. Ltl Synthesis Using Parity Games. Learning Outcomes# By The End of The Course, The Student Will Be Able To# - Construct Automata For Omega-regular Language in Various Acceptance Conditions, Characterize Their Languages and Translate Between Models._ --describe Properties in Temporal Logic, and Translate Them To Automata. - Solve Parity Games. - Prove Hardness Results On Translations Between Logic and Automata, And Between Types of Automata.
Faculty: Computer Science
|Undergraduate Studies
|Graduate Studies
Pre-required courses
(234129 - Int. to Set Theory and Automata For Cs and 236343 - Theory of Computation)
Semestrial Information
Weekly Hours
2 Academic Credit • 2 Lecture Hours
Go to Course Page
Responsible(s)
Shaull Almagor
Exams
Session A: 05-09-2024 Session B: 29-09-2024Registration Groups
|
|
Weekly Hours
2 Academic Credit • 2 Lecture Hours
Go to Course Page
Responsible(s)
Shaull Almagor
Registration Groups
|
|
Weekly Hours
2 Academic Credit • 2 Lecture Hours
Go to Course Page
Responsible(s)
Shaull Almagor
Exams
Session A: 14-07-2022 13:00 - 16:00- טאוב 3.
- טאוב 8.
Registration Groups
|
|