Theseses

  1. Richard Mayr. On Verification Problems for Systems with Infinite State Spaces. Habilitation thesis, 2002.

  2. Richard Mayr. Decidability and Complexity of Model Checking Problems for Infinite-State Systems. PhD thesis, 1998.

  3. Richard Mayr. Konfluenz bei Termersetzungssystemen auf lambda-Termen. Master's thesis, Institut für Informatik, Technische Universität München, 1994. (In German)

Technical Reports

  1. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofmann, K. Narayan Kumar, Richard Mayr, Patrick Totzke. Infinite-State Energy Games. University of Edinburgh Technical Report EDI-INF-RR-1419.

  2. Piotr Hofmann, Slawomir Lasota, Richard Mayr, Patrick Totzke. Simulation over One-Counter Nets is PSPACE-complete. University of Edinburgh Technical Report EDI-INF-RR-1418.

  3. Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, Jeremy Sproston. Solving Parity Games on Integer Vectors. University of Edinburgh Technical Report EDI-INF-RR-1417 .

  4. Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg. Stochastic Parity Games on Lossy Channel Systems. University of Edinburgh Technical Report EDI-INF-RR-1416 .

  5. Piotr Hofman, Richard Mayr, Patrick Totzke. Decidability of Weak Simulation on One-counter Nets. University of Edinburgh Technical Report EDI-INF-RR-1415 .

  6. Lorenzo Clemente and Richard Mayr. Advanced Automata Minimization. University of Edinburgh Technical Report EDI-INF-RR-1414 . (See also Corr and Local copy.)

  7. Lorenzo Clemente and Richard Mayr. Multipebble Simulations for Alternating Automata. University of Edinburgh Technical Report EDI-INF-RR-1376.

  8. Parosh Abdulla, Noomene Ben Henda, Luca de Alfaro, Richard Mayr and Sven Sandberg. Stochastic Games with Lossy Channels. Technical Report 2007-005, Uppsala University. Uppsala. Sweden. 2007.

  9. Parosh Abdulla, Noomene Ben Henda, Richard Mayr and Sven Sandberg. Limiting Behavior of Markov Chains with Eager Attractors. Technical Report 2006-033, Uppsala University. Uppsala. Sweden. 2006.

  10. Parosh Abdulla, Noomene Ben Henda, Richard Mayr, Sven Sandberg. Eager Markov Chains. Technical Report 2006-009. Uppsala University. Uppsala. Sweden. 2006.

  11. Parosh Abdulla, Pritha Mahata and Richard Mayr. Decidability of Zenoness, Token-Liveness and Boundedness of Dense-Timed Petri Nets. Technical Report 2004-034. Uppsala University. Uppsala. Sweden. 2004.

  12. Javier Esparza, Antonin Kucera and Richard Mayr. Model Checking Probabilistic Pushdown Automata. Technical report, FIMU-RS-2004-03, Masaryk University, Brno, Czech Republic, 2004.

  13. Antonin Kucera and Richard Mayr. A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata. Technical report, FIMU-RS-2004-01, Masaryk University, Brno, Czech Republic, 2004.

  14. Michael Baldamus, Richard Mayr and Gerardo Schneider. A Backward/Forward Strategy for Verifying Safety Properties of Infinite-State Systems. Technical report, No. 2003-065, Department of Information Technology, Uppsala University, Sweden. December 2003.

  15. Richard Mayr. Weak Bisimilarity and Regularity of BPA is EXPTIME-hard. Technical report, No. 181, Department of computer science, Albert-Ludwigs-University Freiburg, Freiburg, Germany, December 2002.

  16. Antonin Kucera and Richard Mayr. Why is Simulation Harder Than Bisimulation? Technical report, FIMU-RS-2002-02, Masaryk University, Brno, Czech Republic, 2002.

  17. Antonin Kucera and Richard Mayr. On the Complexity of Semantic Equivalences for Pushdown Automata and BPA. Technical report, FIMU-RS-2002-01, Masaryk University, Brno, Czech Republic, 2002.

  18. Antonin Kucera and Richard Mayr. Simulation Preorder on Simple Process Algebras. Technical report TUM-I9902, TU-München, 1999.

  19. Antonin Kucera and Richard Mayr. Weak Bisimilarity with Infinite-State Systems can be Decided in Polynomial Time. Technical report TUM-I9830, TU-München, 1998.

  20. Richard Mayr. Lossy Counter Machines. Technical report TUM-I9827, TU-München, 1998. (Read the conference paper instead. Richard Mayr. Undecidable Problems in Unreliable Computations. International Symposium on Latin American Theoretical Informatics (LATIN'2000), Punta del Este, Uruguay. Volume 1776 in LNCS. Springer Verlag. 2000. A longer journal version is to appear in TCS.)

  21. Petr Jancar, Antonin Kucera, Richard Mayr. Deciding Bisimulation-Like Equivalences with Finite-State Processes. Technical report TUM-I9805, TU-München, 1998. (The journal version is better! Petr Jancar, Antonin Kucera, Richard Mayr. Deciding Bisimulation-Like Equivalences with Finite-State Processes. TCS, to appear.)

  22. Richard Mayr. Model Checking PA-Processes. Technical report TUM-I9640, TU-München, 1996.

  23. Richard Mayr. A Tableau System for Model Checking Petri Nets with a Fragment of the Linear Time µ-Calculus. Technical report TUM-I9634, TU-München, 1996.

  24. Richard Mayr. Some Results on Basic Parallel Processes. Technical report TUM-I9616, TU-München, 1996. (The chapter on BPP in my PhD thesis is better.)

  25. Richard Mayr and Tobias Nipkow. Higher-Order Rewrite Systems and their Confluence. Technical report TUM-I9433, TU-München, 1994. (Read the journal version instead. Richard Mayr and Tobias Nipkow. Higher-Order Rewrite Systems and their Confluence. TCS, volume 192, pages 3-29, 1998.)

Other Texts

Peter Habermehl and Richard Mayr. A Note on SLRE. (This note on formal language theory has been written to point out some errors in various sources. However, it can also be used as a kind of mini-tutorial on bounded languages and the complexity of some problems in formal language theory.)