Model Checking / Timed Automata / Probabilistic Systems
Abstract
Depending on the student's inclinations, I can offer several projects in model checking, timed automata, and probabilistic
systems, ranging from the very theoretical (e.g., decidability/complexity problems) to the fairly practical (implement and
verify the correctness of a particular probabilistic protocol or program). Students are encouraged to contact me to discuss
possibilities and suitable projects.
