Dr. Richard Μayr

More pictures

Dr. Richard Mayr
University of Edinburgh
School of Informatics, LFCS
Room 4.11a, Informatics Forum
10 Crichton Street 
Edinburgh EH8 9AB
UK

Phone: +44 131 650 5130
Fax:   +44 131 667 7209
 Electronic messages 

Short CV

My Erdös number is 3. Find your number at MathSciNet .

Open positions

• PhD Studentships

  I am looking for PhD students (for a start date of fall 2025) with a strong background in mathematics and/or theoretical computer science. Current research topics include Game Theory, Markov Decision Processes, Efficient Algorithms, Logic and Automata Theory.

  See our general website for information on how to apply (and funding options, etc.), and contact me if you do.

  Apart from the standard PhD program for students who already hold an MSc, there are also combined 4-year MSc/PhD programs (EPSRC-funded Doctoral Training Centers; CDTs). Students undertake an initial MSc by Research year, followed by three years of PhD study. See details on CDTs.

Research Interests

• Game theory.
  • Non-algorithmic problems: Strategy complexity in infinite-state stochastic games and Markov decision processes.
  • Algorithmic game theory: Decidability and computational complexity of algorithmic questions about finite games and about finitely described infinite-state games.
• Formal Verification
  • 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.
• Logic
• Automata Theory
• Term rewriting.

My PhD thesis: ``Decidability and Complexity of Model Checking Problems for Infinite-State Systems''. , (April 1998).

Publications (see also the listing at the DBLP server )

• Publications in refereed journals and conference proceedings
• Technical reports, theses and other texts.
• Book chapters

Software Tools

• 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 Languageinclusion.org .

Research group

• Current Students
  • Mohan Dantam, PhD Student, University of Edinburgh, UK. (Since fall 2021.)
• Former Students
  • Eric Munday, PhD Student, University of Edinburgh, UK. 2019-2023.
  • Radu Ciobanu, PhD Student, University of Edinburgh, UK. 2014-2019.
  • Ricardo Almeida, PhD Student, University of Edinburgh, UK. 2013-2017.
  • Patrick Totzke, PhD Student, University of Edinburgh, 2010-2014. Postdoctoral RA 2016-2018.
  • Lorenzo Clemente, 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.

Current Teaching

• Algorithms and Data Structures. Spring terms 2017, 2018, 2019, 2020. Fall term 2020, Spring term 2022, Fall term 2022, Fall term 2023.
• Computer Security. Spring term 2023.
• Algorithmic Game Theory and Applications. Fall term 2014.
• Logic Programming Fall term 2014.
• Discrete Mathematics and Mathematical Reasoning. Fall term 2013.

Other Current Activities

• 34th International Conference on Concurrency Theory, 19-22 September 2023, Antwerp, Belgium.
• 33rd Stony Brook International Conference on Game Theory, 18-21 July 2022, Stony Brook, USA.
• Workshop on Current Trends in Graph and Stochastic Games, 7-8 April 2022, in Maastricht, NL.
• ICALP 2021 48th International Colloquium on Automata, Languages, and Programming. 12-16 July, 2021, Glasgow, Scotland.
• MFCS 2018 43rd International Symposium on Mathematical Foundations of Computer Science. August 27-31, 2018, Liverpool (UK).
• RP 2016 10th International Workshop on Reachability Problems. 19 - 21 September 2016, Aalborg, Denmark.
• GandALF 2015 The Sixth International Symposium on Games, Automata, Logics and Formal Verification. September 21-23, 2015, Genova, Italy.
• RP 2015 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
• TACAS 2011. Tools and Algorithms for the Construction and Analysis of Systems.

If this is Greek to you then you can at least have some fun .