The Exam Algorithm
You are allowed to bring your notes to the exam, and to look at
them whenever you feel that you need to do so.
- When called, enter the critical section in room 303
- Timer := 0
- Randomly pick one of the questions listed below
- Deliver a good presentation on that question
- Answer the questions Anna and I
may ask you during your presentation
- At some time satisfying Timer < 20, exit the critical section
- Re-enter the room and get your mark for the oral exam accounting for 50%
of your overall mark for the course.
You should deliver your presentation using the whiteboard. I strongly advice you to
write down the key definitions, results and examples on which your presentation
will be based.
Examples are good, but do follow the KISS method. Leave examples with
states and beyond (or something of that sort) to less stressful times!
Syllabus for the Course Exam
See the main reading material related to the questions in the course
List of Exam Questions
1. Strong bisimulation equivalence and observation equivalence.
2. Hennessy-Milner logic and bisimulation.
3. Hennessy-Milner logic and recursively defined formulae.
4. Binary decision diagrams and their use in verification.
5. Timed automata, their semantics and the decidability of reachability
for that model.
Schedule for the Exam
Let me know if you do not plan to show up.
- 13:00-13:20 Bjarki Elías Kristjánsson
- 13:20-13:40 Jónas Tryggvi Jóhannsson
- 13:40-14:00 Guđmundur Hreiđarsson
- 14:00-14:20 Gunnar Kristjánsson
- 14:20-14:40 Hafţór Guđnason
- 14:40-15:00 Hilmar Finnsson
- 15:00-15:20 Kristján Valur Jónsson
- 15:20-15:40 María Arinbjarnar
- 15:40-16:00 Örn Arnar Jónsson
- 16:00-16:20 Sólmundur Jónsson