Develop a principled, clean account of how games and their abstractions may be combined.
Develop temporal logics and model checking techniques for quantum systems
Research on foundational, algorithmic, and systems aspects of graph databases.
Capturing behavioural properties of computation with effects using logical modalities
Develop algorithms and tools for solving most practical instances of PSPACE-complete problems in automata theory, e.g., language inclusion, equivalence and universality (see www.languageinclusion.org).
Develop some aspect of the theory of testing model transformations.
This topic is suitable for a student with interests in cryptography or complexity theory.
Stochastic process algebras, providing high-level descriptions of dynamic systems, amenable to rigorous mathematical analysis through formal semantics.
Precise interaction of individuals coupled with analysis of the dynamic behaviour at the level of populations.
The aim is to extend techniques of model checking and equivalence checking from finite to infinite state systems.
The project is to investigate stochastic rule-based formalisms for computational systems biology that allow multilevel cellular systems that permit bonding at all levels, from cells in tissue to proteins in complexes.
Instructions for applying for PhD study at LFCS
Funded PhD project
Research project on algorithmic and combinatorial aspects of diameter, lattice points and vertices of simplified polytopes.