Richard Mayr

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 39

Top Venues

CoRR

CONCUR

Log. Methods Comput. Sci.

LICS

Technical University Munich, Germany (PHD)

Education History

Technical University Munich, Germany

PHD

Publications

Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
Memoryless Strategies in Stochastic Reachability Games. CoRR (2024)
Mohan Dantam, Richard Mayr
Finite-Memory Strategies for Almost-Sure Energy-MeanPayoff Objectives in MDPs. ICALP (2024)
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
Strategy Complexity of B\"uchi Objectives in Concurrent Stochastic Games. CoRR (2024)
Mohan Dantam, Richard Mayr
Finite-memory Strategies for Almost-sure Energy-MeanPayoff Objectives in MDPs. CoRR (2024)
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
Memoryless Strategies in Stochastic Reachability Games. Taming the Infinities of Concurrency (2024)
Mohan Dantam, Richard Mayr
Approximating the Value of Energy-Parity Objectives in Simple Stochastic Games. MFCS (2023)
Richard Mayr, Eric Munday
Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs. Log. Methods Comput. Sci. 19 (1) (2023)
Mohan Dantam, Richard Mayr
Approximating the Value of Energy-Parity Objectives in Simple Stochastic Games. CoRR (2023)
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
Strategy Complexity of Reachability in Countable Stochastic 2-Player Games. CoRR (2022)
Richard Mayr, Eric Munday
Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs. CoRR (2022)
Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak
Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP. FoSSaCS (2021)
Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak
Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP. CoRR (2021)
Richard Mayr, Eric Munday
Strategy Complexity of Mean Payoff, Total Payoff and Point Payoff Objectives in Countable MDPs. CONCUR (2021)
Richard Mayr, Eric Munday
Strategy Complexity of Mean Payoff, Total Payoff and Point Payoff Objectives in Countable MDPs. CoRR (2021)
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
Transience in Countable MDPs. CONCUR (2021)
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
Strategy Complexity of Parity Objectives in Countable MDPs. CoRR (2020)
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke, Dominik Wojtczak
How to Play in Infinite MDPs (Invited Talk). ICALP (2020)
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
Transience in Countable MDPs. CoRR (2020)
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
Strategy Complexity of Parity Objectives in Countable MDPs. CONCUR (2020)
Lorenzo Clemente, Richard Mayr
Efficient reduction of nondeterministic automata with application to language inclusion testing. Log. Methods Comput. Sci. 15 (1) (2019)
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
Büchi Objectives in Countable MDPs. CoRR (2019)
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
Büchi Objectives in Countable MDPs. ICALP (2019)
Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell
Model Checking Flat Freeze LTL on One-Counter Automata. Log. Methods Comput. Sci. 14 (4) (2018)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu, Richard Mayr, Patrick Totzke
Universal Safety for Timed Petri Nets is PSPACE-complete. CoRR (2018)
Antonín Kucera, Richard Mayr
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata. J. Comput. Syst. Sci. 91 (2018)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu, Richard Mayr, Patrick Totzke
Universal Safety for Timed Petri Nets is PSPACE-complete. CONCUR (2018)
Lorenzo Clemente, Richard Mayr
Efficient reduction of nondeterministic automata with application to language inclusion testing. CoRR (2017)
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak
Parity Objectives in Countable MDPs. CoRR (2017)
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak
Parity objectives in countable MDPs. LICS (2017)
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak
On strong determinacy of countable stochastic games. LICS (2017)
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak
On Strong Determinacy of Countable Stochastic Games. CoRR (2017)
Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak
MDPs with energy-parity objectives. LICS (2017)
Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak
MDPs with Energy-Parity Objectives. CoRR (2017)
Richard Mayr, Patrick Totzke
Branching-Time Model Checking Gap-Order Constraint Systems. Fundam. Informaticae 143 (3-4) (2016)
Parosh Aziz Abdulla, Radu Ciobanu, Richard Mayr, Arnaud Sangnier, Jeremy Sproston
Qualitative Analysis of VASS-Induced MDPs. FoSSaCS (2016)
Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell
Model Checking Flat Freeze LTL on One-Counter Automata. CoRR (2016)
Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell
Model Checking Flat Freeze LTL on One-Counter Automata. CONCUR (2016)
Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke
Simulation Problems Over One-Counter Nets. Log. Methods Comput. Sci. 12 (1) (2016)
Ricardo Almeida, Lukás Holík, Richard Mayr
Reduction of Nondeterministic Tree Automata. TACAS (2016)
Parosh Aziz Abdulla, Radu Ciobanu, Richard Mayr, Arnaud Sangnier, Jeremy Sproston
Qualitative Analysis of VASS-Induced MDPs. CoRR (2015)
Ricardo Almeida, Lukás Holík, Richard Mayr
Reduction of Nondeterministic Tree Automata. CoRR (2015)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke
Infinite-state energy games. CSL-LICS (2014)
Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg
Stochastic Parity Games on Lossy Channel Systems. Log. Methods Comput. Sci. 10 (4) (2014)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke
Infinite-State Energy Games. CoRR (2014)
Richard Mayr, Lorenzo Clemente
Advanced automata minimization. POPL (2013)
Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke
Simulation Over One-counter Nets is PSPACE-Complete. CoRR (2013)
Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg
Stochastic Parity Games on Lossy Channel Systems. QEST (2013)
Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, Jeremy Sproston
Solving Parity Games on Integer Vectors. CONCUR (2013)
Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg
Stochastic Parity Games on Lossy Channel Systems CoRR (2013)
Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, Jeremy Sproston
Solving Parity Games on Integer Vectors. CoRR (2013)
Parosh Aziz Abdulla, Richard Mayr
Priced Timed Petri Nets. Log. Methods Comput. Sci. 9 (4) (2013)
Piotr Hofman, Richard Mayr, Patrick Totzke
Decidability of Weak Simulation on One-Counter Nets. LICS (2013)
Richard Mayr
Returning Lost Elements in the Sales Process: Manum Dare. ERP Future (2013)
Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke
Simulation Over One-counter Nets is PSPACE-Complete. FSTTCS (2013)
Richard Mayr, Patrick Totzke
Branching-Time Model Checking Gap-Order Constraint Systems. CoRR (2013)
Richard Mayr, Patrick Totzke
Branching-Time Model Checking Gap-Order Constraint Systems. RP (2013)
Piotr Hofman, Richard Mayr, Patrick Totzke
Decidability of Weak Simulation on One-counter Nets CoRR (2013)
Lorenzo Clemente, Richard Mayr
Advanced Automata Minimization CoRR (2012)
Parosh Aziz Abdulla, Richard Mayr
Petri Nets with Time and Cost Infinity (2012)
Parosh Aziz Abdulla, Richard Mayr
Computing Optimal Coverability Costs in Priced Timed Petri Nets. LICS (2011)
Parosh Aziz Abdulla, Richard Mayr
Computing Optimal Coverability Costs in Priced Timed Petri Nets CoRR (2011)
Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar
Advanced Ramsey-Based Büchi Automata Inclusion Testing. CONCUR (2011)
Steffen Heber, Richard Mayr, Jens Stoye
Common Intervals of Multiple Permutations. Algorithmica 60 (2) (2011)
Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar
Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing. CAV (2010)
Lorenzo Clemente, Richard Mayr
Multipebble Simulations for Alternating Automata - (Extended Abstract). CONCUR (2010)
Antonín Kucera, Richard Mayr
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes. Inf. Comput. 208 (7) (2010)
Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Richard Mayr, Tomás Vojnar
When Simulation Meets Antichains. TACAS (2010)
Stefan Göller, Richard Mayr, Anthony Widjaja To
On the Computational Complexity of Verifying One-Counter Processes. LICS (2009)
Parosh Aziz Abdulla, Richard Mayr
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets. FoSSaCS (2009)
Parosh Aziz Abdulla, Noomene Ben Henda, Luca de Alfaro, Richard Mayr, Sven Sandberg
Stochastic Games with Lossy Channels. FoSSaCS (2008)
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr
Decisive Markov Chains. Log. Methods Comput. Sci. 3 (4) (2007)
Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness. Log. Methods Comput. Sci. 3 (1) (2007)
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr
Decisive Markov Chains CoRR (2007)
Antonín Kucera, Javier Esparza, Richard Mayr
Model Checking Probabilistic Pushdown Automata. Log. Methods Comput. Sci. 2 (1) (2006)
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr, Sven Sandberg
Eager Markov Chains. ATVA (2006)
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr, Sven Sandberg
Limiting Behavior of Markov Chains with Eager Attractors. QEST (2006)
Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness CoRR (2006)
Javier Esparza, Antonín Kucera, Richard Mayr
Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances. LICS (2005)
Richard Mayr
Weak bisimilarity and regularity of context-free processes is EXPTIME-hard. Theor. Comput. Sci. 330 (3) (2005)
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr
Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property. LICS (2005)
Javier Esparza, Antonín Kucera, Richard Mayr
Model Checking Probabilistic Pushdown Automata CoRR (2005)
Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr
Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets. FSTTCS (2004)
Antonín Kucera, Richard Mayr
A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata. IFIP TCS (2004)
Javier Esparza, Antonín Kucera, Richard Mayr
Model Checking Probabilistic Pushdown Automata. LICS (2004)
Stefan Leue, Richard Mayr, Wei Wei
A Scalable Incomplete Test for Message Buffer Overflow in Promela Models. SPIN (2004)
Stefan Leue, Richard Mayr, Wei Wei
A Scalable Incomplete Test for the Boundedness of UML RT Models. TACAS (2004)
Ahmed Bouajjani, Peter Habermehl, Richard Mayr
Automatic verification of recursive procedures with one integer parameter. Theor. Comput. Sci. 295 (2003)
Richard Mayr
-hard. EXPRESS (2003)
Richard Mayr
Undecidable problems in unreliable computations. Theor. Comput. Sci. 297 (1-3) (2003)
Richard Mayr
Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes. ICALP (2003)
Antonín Kucera, Richard Mayr
Why Is Simulation Harder than Bisimulation? CONCUR (2002)
Antonín Kucera, Richard Mayr
Simulation Preorder over Simple Process Algebras. Inf. Comput. 173 (2) (2002)
Antonín Kucera, Richard Mayr
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA. MFCS (2002)
Antonín Kucera, Richard Mayr
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time. Theor. Comput. Sci. 270 (1-2) (2002)
Antonín Kucera, Richard Mayr
Preface. INFINITY (2002)
Petr Jancar, Antonín Kucera, Richard Mayr
Deciding bisimulation-like equivalences with finite-state processes. Theor. Comput. Sci. 258 (1-2) (2001)
Ahmed Bouajjani, Peter Habermehl, Richard Mayr
Automatic Verification of Recursive Procedures with One Integer Parameter. MFCS (2001)
Richard Mayr
Introduction - Verification of Parameterized Systems - VEPAS 2001. Electron. Notes Theor. Comput. Sci. 50 (4) (2001)
Richard Mayr
Decidability of model checking with the temporal logic EF. Theor. Comput. Sci. 256 (1-2) (2001)
Richard Mayr
On the Complexity of Bisimulation Problems for Pushdown Automata. IFIP TCS (2000)

Richard Mayr.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Richard Mayr