Personal profile
Research Interests
Automated verification, automata and temporal logic, model-checking and semantic equivalence checking, formal verification of real-time and probabilistic systems, infinite-state Markov chains and stochastic games.
Qualifications
Master in Computer Science, 1994, TU-Munich.
PhD in Computer Science, 1998, TU-Munich.
Habilitation for Informatics, 2002, University of Freiburg.
Biography
Richard Mayr received a Msc in computer science (with distinction) from TU-Munich (1994) and a PhD in computer science from TU-Munich (1998). He received scholarships from the DAAD and the DFG in support of his research at the University of Edinburgh (1999) and the University of Paris 7 (2000), and completed his Habilitation for Informatics at the University of Freiburg in 2002. He was assistant professor at the University of Freiburg (2001-2004) and at North Carolina State University (2004-2007). In 2008 he was appointed to the post of Lecturer at the School of Informatics (LFCS) at the University of Edinburgh.
Mayr has been principal investigator on several recent grants on automata theory and formal verification of real-time systems by the Royal Society, and is a founding member of Languageinclusion.org
He is currently supervisor for two PhD students and has previously supervised four other successful PhD students (two at the University of Edinburgh, one at Uppsala University and one at the University of Freiburg). In recent years, he has taught courses in discrete mathematics, semantics of programming languages and distributed systems. He was 3rd year course organizer for Informatics in 2010 and is currently on both the College of Science and Engineering Library Committee and the University Library Committee.
Fingerprint
- 1 Similar Profiles
Collaborations and top research areas from the last five years
-
No good Markov strategies for Büchi objectives in countable MDPs
Kiefer, S., Mayr, R., Shirmohammadi, M. & Totzke, P., 9 May 2026, In: Annals of Operations Research. p. 1-16 16 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Strategy complexity of Büchi and Transience objectives in concurrent stochastic games
Kiefer, S., Mayr, R., Shirmohammadi, M. & Totzke, P., 2 Jul 2025, EC '25: Proceedings of the 26th ACM Conference on Economics and Computation. New York, NY, United States: Association for Computing Machinery, p. 390-409 19 p.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile -
Strategy complexity of limsup and liminf threshold objectives in countable MDPs, with applications to optimal expected payoffs
Mayr, R. & Munday, E., 19 Oct 2024, In: Decisions in Economics and Finance.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Strategy complexity of reachability in countable stochastic 2-player games
Kiefer, S., Mayr, R., Shirmohammadi, M. & Totzke, P., 14 Sept 2024, In: Dynamic Games and Applications.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Finite-memory strategies for almost-sure Energy-MeanPayoff objectives in MDPs
Dantam, M. & Mayr, R., 27 Apr 2024, (Accepted/In press) 51st ICALP 2024. Schloss Dagstuhl - Leibniz-Zentrum für InformatikResearch output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile
Projects
- 5 Finished
-
New Proof Techniques in Game Theory by Synergies of Mathematics and Computer Science
Mayr, R. (Principal Investigator)
31/03/22 → 30/03/24
Project: Research
-
New Proof Techniques in Game Theory by Synergies of Mathematics and Computer Science
Mayr, R. (Principal Investigator)
31/03/22 → 30/03/24
Project: Research
-
-
Algorithms for computationally hard problems in automata theory
Mayr, R. (Principal Investigator)
25/03/12 → 24/03/14
Project: Research
-
Verificaton of priced infinite-state real-time systems
Mayr, R. (Principal Investigator)
1/04/09 → 31/03/11
Project: Research