| 2026 | CONCUR | Mean-Payoff-Parity and Lifting Strategies from MDPs to 2-Player Stochastic Games. | Mohan Dantam, Richard Mayr |
| 2024 | ICALP | Finite-Memory Strategies for Almost-Sure Energy-MeanPayoff Objectives in MDPs. | Mohan Dantam, Richard Mayr |
| 2023 | MFCS | Approximating the Value of Energy-Parity Objectives in Simple Stochastic Games. | Mohan Dantam, Richard Mayr |
| 2021 | CONCUR | Transience in Countable MDPs. | Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke |
| 2021 | CONCUR | Strategy Complexity of Mean Payoff, Total Payoff and Point Payoff Objectives in Countable MDPs. | Richard Mayr, Eric Munday |
| 2021 | FOSSACS | Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP. | Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak |
| 2020 | CONCUR | Strategy Complexity of Parity Objectives in Countable MDPs. | Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke |
| 2020 | ICALP | How to Play in Infinite MDPs (Invited Talk). | Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke, Dominik Wojtczak |
| 2019 | ICALP | Bchi Objectives in Countable MDPs. | Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke |
| 2018 | CONCUR | Universal Safety for Timed Petri Nets is PSPACE-complete. | Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu, Richard Mayr, Patrick Totzke |
| 2017 | LICS | Parity objectives in countable MDPs. | Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak |
| 2017 | LICS | On strong determinacy of countable stochastic games. | Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak |
| 2017 | LICS | MDPs with energy-parity objectives. | Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak |
| 2016 | CONCUR | Model Checking Flat Freeze LTL on One-Counter Automata. | Antonia Lechner, Richard Mayr, Jol Ouaknine, Amaury Pouly, James Worrell |
| 2016 | FOSSACS | Qualitative Analysis of VASS-Induced MDPs. | Parosh Aziz Abdulla, Radu Ciobanu, Richard Mayr, Arnaud Sangnier, Jeremy Sproston |
| 2016 | TACAS | Reduction of Nondeterministic Tree Automata. | Ricardo Almeida, Luks Holk, Richard Mayr |
| 2014 | CSL | Infinite-state energy games. | Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke |
| 2013 | CONCUR | Solving Parity Games on Integer Vectors. | Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, Jeremy Sproston |
| 2013 | LICS | Decidability of Weak Simulation on One-Counter Nets. | Piotr Hofman, Richard Mayr, Patrick Totzke |
| 2013 | POPL | Advanced automata minimization. | Richard Mayr, Lorenzo Clemente |
| 2011 | CONCUR | Advanced Ramsey-Based Bchi Automata Inclusion Testing. | Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Luks Holk, Chih-Duo Hong, Richard Mayr, Toms Vojnar |
| 2011 | LICS | Computing Optimal Coverability Costs in Priced Timed Petri Nets. | Parosh Aziz Abdulla, Richard Mayr |
| 2010 | CAV | Simulation Subsumption in Ramsey-Based Bchi Automata Universality and Inclusion Testing. | Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Luks Holk, Chih-Duo Hong, Richard Mayr, Toms Vojnar |
| 2010 | CONCUR | Multipebble Simulations for Alternating Automata - (Extended Abstract). | Lorenzo Clemente, Richard Mayr |
| 2010 | TACAS | When Simulation Meets Antichains. | Parosh Aziz Abdulla, Yu-Fang Chen, Luks Holk, Richard Mayr, Toms Vojnar |
| 2009 | FOSSACS | Minimal Cost Reachability/Coverability in Priced Timed Petri Nets. | Parosh Aziz Abdulla, Richard Mayr |
| 2009 | LICS | On the Computational Complexity of Verifying One-Counter Processes. | Stefan Gller, Richard Mayr, Anthony Widjaja To |
| 2008 | FOSSACS | Stochastic Games with Lossy Channels. | Parosh Aziz Abdulla, Noomene Ben Henda, Luca de Alfaro, Richard Mayr, Sven Sandberg |
| 2006 | ATVA | Eager Markov Chains. | Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr, Sven Sandberg |
| 2005 | LICS | Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property. | Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr |
| 2005 | LICS | Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances. | Javier Esparza, Antonn Kucera, Richard Mayr |
| 2004 | LICS | Model Checking Probabilistic Pushdown Automata. | Javier Esparza, Antonn Kucera, Richard Mayr |
| 2004 | TACAS | A Scalable Incomplete Test for the Boundedness of UML RT Models. | Stefan Leue, Richard Mayr, Wei Wei |
| 2003 | ICALP | Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes. | Richard Mayr |
| 2002 | CONCUR | Why Is Simulation Harder than Bisimulation? | Antonn Kucera, Richard Mayr |
| 2002 | MFCS | On the Complexity of Semantic Equivalences for Pushdown Automata and BPA. | Antonn Kucera, Richard Mayr |
| 2001 | MFCS | Automatic Verification of Recursive Procedures with One Integer Parameter. | Ahmed Bouajjani, Peter Habermehl, Richard Mayr |
| 2000 | ICALP | On the Complexity of Bisimulation Problems for Basic Parallel Processes. | Richard Mayr |
| 2000 | LATIN | Undecidable Problems in Unreliable Computations. | Richard Mayr |
| 1999 | CONCUR | Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time. | Antonn Kucera, Richard Mayr |
| 1999 | ICALP | Simulation Preorder on Simple Process Algebras. | Antonn Kucera, Richard Mayr |
| 1999 | LICS | On the Verification of Broadcast Protocols. | Javier Esparza, Alain Finkel, Richard Mayr |
| 1999 | STACS | Model Checking Lossy Vector Addition Systems. | Ahmed Bouajjani, Richard Mayr |
| 1998 | ICALP | Deciding Bisimulation-Like Equivalences with Finite-State Processes. | Petr Jancar, Antonn Kucera, Richard Mayr |
| 1997 | CONCUR | Model Checking PA-Processes. | Richard Mayr |
| 1997 | TABLEAUX | Tableau Methods for PA-Processes. | Richard Mayr |