Dr. Richard Μayr
Dr. Richard Mayr
University of Edinburgh
School of Informatics, LFCS
Room 4.11a, Informatics Forum
10 Crichton Street
Edinburgh EH8 9AB
Phone: +44 131 650 5130
Fax: +44 131 667 7209
Lecturer in Computer Science, University of Edinburgh,
PhD in Computer Science at TU-Munich, Germany, 1998 and Habilitation
at University of Freiburg, Germany, 2002. Since then I have worked in
many different countries.
My Erdös number is 4 (several connections). Find your number at
If you have a recent PhD with a strong background in formal methods, automata theory, logic
and game theory, I might have a postdoc position for you. Ask me.
The EPSRC-funded Centre for Doctoral Training in Pervasive Parallelism
at the University of Edinburgh is pleased to offer 12 fully funded
four year studentships across all areas relevant to the "pervasive
parallelism challenge". Students undertake an initial MSc by Research
year, followed by three years of PhD study.
I am looking for PhD students with a strong background in mathematics and theoretical computer science.
You can find some (non-binding) suggestions of topics
another topic here, as well as background reading material at
See our general website for information on
how to apply , and contact me if you do.
My habilitation thesis:
``On Verification Problems for Systems with Infinite State Spaces''.
, (September 2002).
Formal models for distributed systems: Petri nets, process algebras
and automata theoretic models.
Verification of systems with infinitely many states.
Algorithms for the design and verification of reactive and distributed systems.
Decidability and complexity of model checking problems.
Decidability and complexity of bisimulation equivalence and other semantic equivalences.
Scalable verification methods and their application to industrial
specification languages like UML RT.
Analysis and verification of probabilistic systems: Markov chains, Markov reward models, Stochastic games.
Exotic computing devices and the borders of decidability.
My PhD thesis:
``Decidability and Complexity of Model Checking Problems for Infinite-State Systems''.
, (April 1998).
Some practical tools for solving computationally hard problems in automata theory, in particular
language inclusion, equivalence and universality, and minimization of non-deterministic automata.
See the slides of this overview talk, as well as the main website
PhD Student, University of Edinburgh, UK. (Since fall 2013.)
PhD Student, University of Edinburgh, UK. (Since fall 2014.)
PhD Student, University of Edinburgh, UK. 2010-2014.
PhD Student, University of Edinburgh, UK. 2009-2012.
Anthony Widjaja Lin (previously: Widjaja To), PhD Student, University of Edinburgh, UK. 2008-2010.
Noomene Ben Henda, PhD Student, Uppsala University, Sweden, 2004-2008.
Wei Wei, PhD Student, University of Freiburg, Germany. 2002-2004.
Other Current Activities
10th International Workshop on Reachability Problems.
19 - 21 September 2016, Aalborg, Denmark.
The Sixth International Symposium on Games, Automata, Logics and Formal Verification.
September 21-23, 2015, Genova, Italy.
9th International Workshop on Reachability Problems.
21-23 September 2015, Warsaw, Poland.
1st EATCS Young Researchers School on Automata, Logic and Games.
July 27 - Aug 1, 2014. Telc/Czech Republic.
Twenty-Seventh Annual IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS 2012)
MEMICS 2011, Annual Doctoral Workshop on Mathematical and
Engineering Methods in Computer Science
Tools and Algorithms for the Construction and Analysis of Systems.
If this is
Greek to you then you can at least
have some fun .