Richard Mayr

122 papers A* 20A 4B 21Journal 53Unranked 21
YearRankTypeTitle / Venue / Authors
2025 A* conf
Strategy Complexity of Büchi and Transience Objectives in Concurrent Stochastic Games.
EC
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2025 J jnl
Strategy Complexity of Reachability in Countable Stochastic 2-Player Games.
Dyn. Games Appl.
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2024 A* conf
Finite-Memory Strategies for Almost-Sure Energy-MeanPayoff Objectives in MDPs.
ICALP
Mohan Dantam, Richard Mayr
2024 J jnl
Finite-memory Strategies for Almost-sure Energy-MeanPayoff Objectives in MDPs.
CoRR
Mohan Dantam, Richard Mayr
2024 — conf
Memoryless Strategies in Stochastic Reachability Games.
Taming the Infinities of Concurrency
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2024 J jnl
Memoryless Strategies in Stochastic Reachability Games.
CoRR
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2024 J jnl
Strategy Complexity of B\"uchi Objectives in Concurrent Stochastic Games.
CoRR
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2023 B conf
Approximating the Value of Energy-Parity Objectives in Simple Stochastic Games.
MFCS
Mohan Dantam, Richard Mayr
2023 J jnl
Approximating the Value of Energy-Parity Objectives in Simple Stochastic Games.
CoRR
Mohan Dantam, Richard Mayr
2023 J jnl
Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs.
Log. Methods Comput. Sci.
Richard Mayr, Eric Munday
2022 J jnl
Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs.
CoRR
Richard Mayr, Eric Munday
2022 J jnl
Strategy Complexity of Reachability in Countable Stochastic 2-Player Games.
CoRR
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2021 B conf
Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP.
FoSSaCS
Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak
2021 J jnl
Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP.
CoRR
Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak
2021 B conf
Strategy Complexity of Mean Payoff, Total Payoff and Point Payoff Objectives in Countable MDPs.
CONCUR
Richard Mayr, Eric Munday
2021 J jnl
Strategy Complexity of Mean Payoff, Total Payoff and Point Payoff Objectives in Countable MDPs.
CoRR
Richard Mayr, Eric Munday
2021 B conf
Transience in Countable MDPs.
CONCUR
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2020 A* conf
How to Play in Infinite MDPs (Invited Talk).
ICALP
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke, Dominik Wojtczak
2020 B conf
Strategy Complexity of Parity Objectives in Countable MDPs.
CONCUR
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2020 J jnl
Strategy Complexity of Parity Objectives in Countable MDPs.
CoRR
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2020 J jnl
Transience in Countable MDPs.
CoRR
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2019 A* conf
Büchi Objectives in Countable MDPs.
ICALP
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2019 J jnl
Büchi Objectives in Countable MDPs.
CoRR
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
2019 J jnl
Efficient reduction of nondeterministic automata with application to language inclusion testing.
Log. Methods Comput. Sci.
Lorenzo Clemente, Richard Mayr
2018 J jnl
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata.
J. Comput. Syst. Sci.
Antonín Kucera, Richard Mayr
2018 J jnl
Model Checking Flat Freeze LTL on One-Counter Automata.
Log. Methods Comput. Sci.
Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell
2018 B conf
Universal Safety for Timed Petri Nets is PSPACE-complete.
CONCUR
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu, Richard Mayr, Patrick Totzke
2018 J jnl
Universal Safety for Timed Petri Nets is PSPACE-complete.
CoRR
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu, Richard Mayr, Patrick Totzke
2017 J jnl
Efficient reduction of nondeterministic automata with application to language inclusion testing.
CoRR
Lorenzo Clemente, Richard Mayr
2017 J jnl
MDPs with Energy-Parity Objectives.
CoRR
Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak
2017 A* conf
MDPs with energy-parity objectives.
LICS
Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak
2017 J jnl
On Strong Determinacy of Countable Stochastic Games.
CoRR
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak
2017 A* conf
On strong determinacy of countable stochastic games.
LICS
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak
2017 J jnl
Parity Objectives in Countable MDPs.
CoRR
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak
2017 A* conf
Parity objectives in countable MDPs.
LICS
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak
2016 J jnl
Branching-Time Model Checking Gap-Order Constraint Systems.
Fundam. Informaticae
Richard Mayr, Patrick Totzke
2016 B conf
Model Checking Flat Freeze LTL on One-Counter Automata.
CONCUR
Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell
2016 J jnl
Model Checking Flat Freeze LTL on One-Counter Automata.
CoRR
Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell
2016 B conf
Qualitative Analysis of VASS-Induced MDPs.
FoSSaCS
Parosh Aziz Abdulla, Radu Ciobanu, Richard Mayr, Arnaud Sangnier, Jeremy Sproston
2016 A conf
Reduction of Nondeterministic Tree Automata.
TACAS
Ricardo Almeida, Lukás Holík, Richard Mayr
2016 J jnl
Simulation Problems Over One-Counter Nets.
Log. Methods Comput. Sci.
Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke
2015 J jnl
Qualitative Analysis of VASS-Induced MDPs.
CoRR
Parosh Aziz Abdulla, Radu Ciobanu, Richard Mayr, Arnaud Sangnier, Jeremy Sproston
2015 J jnl
Reduction of Nondeterministic Tree Automata.
CoRR
Ricardo Almeida, Lukás Holík, Richard Mayr
2014 J jnl
Infinite-State Energy Games.
CoRR
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke
2014 — conf
Infinite-state energy games.
CSL-LICS
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke
2014 J jnl
Stochastic Parity Games on Lossy Channel Systems.
Log. Methods Comput. Sci.
Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg
2013 A* conf
Advanced automata minimization.
POPL
Richard Mayr, Lorenzo Clemente
2013 — conf
Branching-Time Model Checking Gap-Order Constraint Systems.
RP
Richard Mayr, Patrick Totzke
2013 J jnl
Branching-Time Model Checking Gap-Order Constraint Systems.
CoRR
Richard Mayr, Patrick Totzke
2013 A* conf
Decidability of Weak Simulation on One-Counter Nets.
LICS
Piotr Hofman, Richard Mayr, Patrick Totzke
2013 J jnl
Decidability of Weak Simulation on One-counter Nets
CoRR
Piotr Hofman, Richard Mayr, Patrick Totzke
2013 J jnl
Priced Timed Petri Nets.
Log. Methods Comput. Sci.
Parosh Aziz Abdulla, Richard Mayr
2013 — conf
Returning Lost Elements in the Sales Process: Manum Dare.
ERP Future
Richard Mayr
2013 — conf
Simulation Over One-counter Nets is PSPACE-Complete.
FSTTCS
Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke
2013 J jnl
Simulation Over One-counter Nets is PSPACE-Complete.
CoRR
Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke
2013 B conf
Solving Parity Games on Integer Vectors.
CONCUR
Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, Jeremy Sproston
2013 J jnl
Solving Parity Games on Integer Vectors.
CoRR
Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, Jeremy Sproston
2013 J jnl
Stochastic Parity Games on Lossy Channel Systems
CoRR
Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg
2013 — conf
Stochastic Parity Games on Lossy Channel Systems.
QEST
Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg
2012 J jnl
Advanced Automata Minimization
CoRR
Lorenzo Clemente, Richard Mayr
2012 — conf
Petri Nets with Time and Cost
Infinity
Parosh Aziz Abdulla, Richard Mayr
2011 B conf
Advanced Ramsey-Based Büchi Automata Inclusion Testing.
CONCUR
Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar
2011 J jnl
Common Intervals of Multiple Permutations.
Algorithmica
Steffen Heber, Richard Mayr, Jens Stoye
2011 J jnl
Computing Optimal Coverability Costs in Priced Timed Petri Nets
CoRR
Parosh Aziz Abdulla, Richard Mayr
2011 A* conf
Computing Optimal Coverability Costs in Priced Timed Petri Nets.
LICS
Parosh Aziz Abdulla, Richard Mayr
2010 B conf
Multipebble Simulations for Alternating Automata - (Extended Abstract).
CONCUR
Lorenzo Clemente, Richard Mayr
2010 J jnl
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes.
Inf. Comput.
Antonín Kucera, Richard Mayr
2010 A* conf
Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing.
CAV
Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar
2010 A conf
When Simulation Meets Antichains.
TACAS
Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Richard Mayr, Tomás Vojnar
2009 B conf
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets.
FoSSaCS
Parosh Aziz Abdulla, Richard Mayr
2009 A* conf
On the Computational Complexity of Verifying One-Counter Processes.
LICS
Stefan Göller, Richard Mayr, Anthony Widjaja To
2008 B conf
Stochastic Games with Lossy Channels.
FoSSaCS
Parosh Aziz Abdulla, Noomene Ben Henda, Luca de Alfaro, Richard Mayr, Sven Sandberg
2007 J jnl
Decisive Markov Chains
CoRR
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr
2007 J jnl
Decisive Markov Chains.
Log. Methods Comput. Sci.
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr
2007 J jnl
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness.
Log. Methods Comput. Sci.
Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr
2006 J jnl
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
CoRR
Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr
2006 B conf
Eager Markov Chains.
ATVA
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr, Sven Sandberg
2006 — conf
Limiting Behavior of Markov Chains with Eager Attractors.
QEST
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr, Sven Sandberg
2006 J jnl
Model Checking Probabilistic Pushdown Automata.
Log. Methods Comput. Sci.
Antonín Kucera, Javier Esparza, Richard Mayr
2005 J jnl
Model Checking Probabilistic Pushdown Automata
CoRR
Javier Esparza, Antonín Kucera, Richard Mayr
2005 A* conf
Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances.
LICS
Javier Esparza, Antonín Kucera, Richard Mayr
2005 A* conf
Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property.
LICS
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr
2005 J jnl
Weak bisimilarity and regularity of context-free processes is EXPTIME-hard.
Theor. Comput. Sci.
Richard Mayr
2004 — conf
A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata.
IFIP TCS
Antonín Kucera, Richard Mayr
2004 — conf
A Scalable Incomplete Test for Message Buffer Overflow in Promela Models.
SPIN
Stefan Leue, Richard Mayr, Wei Wei
2004 A conf
A Scalable Incomplete Test for the Boundedness of UML RT Models.
TACAS
Stefan Leue, Richard Mayr, Wei Wei
2004 — conf
Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets.
FSTTCS
Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr
2004 A* conf
Model Checking Probabilistic Pushdown Automata.
LICS
Javier Esparza, Antonín Kucera, Richard Mayr
2003 — ed.
4th International Workshop on Verification of Infinite-State Systems (CONCUR 2002 Satellite Workshop), Infinity 2002, Brno, Czech Republic, August 24, 2002
INFINITY
Antonín Kucera, Richard Mayr
2003 J jnl
Automatic verification of recursive procedures with one integer parameter.
Theor. Comput. Sci.
Ahmed Bouajjani, Peter Habermehl, Richard Mayr
2003 A* conf
Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes.
ICALP
Richard Mayr
2003 J jnl
Undecidable problems in unreliable computations.
Theor. Comput. Sci.
Richard Mayr
2003 — conf
Weak Bisimilarity and Regularity of Context-Free Processes is
EXPRESS
Richard Mayr
2002 B conf
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA.
MFCS
Antonín Kucera, Richard Mayr
2002 — conf
Preface.
INFINITY
Antonín Kucera, Richard Mayr
2002 J jnl
Simulation Preorder over Simple Process Algebras.
Inf. Comput.
Antonín Kucera, Richard Mayr
2002 J jnl
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time.
Theor. Comput. Sci.
Antonín Kucera, Richard Mayr
2002 B conf
Why Is Simulation Harder than Bisimulation?
CONCUR
Antonín Kucera, Richard Mayr
2001 B conf
Automatic Verification of Recursive Procedures with One Integer Parameter.
MFCS
Ahmed Bouajjani, Peter Habermehl, Richard Mayr
2001 J jnl
Decidability of model checking with the temporal logic EF.
Theor. Comput. Sci.
Richard Mayr
2001 J jnl
Deciding bisimulation-like equivalences with finite-state processes.
Theor. Comput. Sci.
Petr Jancar, Antonín Kucera, Richard Mayr
2001 — conf
Introduction - Verification of Parameterized Systems - VEPAS 2001.
VEPAS
Richard Mayr
2001 — ed.
Verification of Parameterized Systems, VEPAS 2001, Satellite Workshop of ICALP 2001, Crete, Greece, July 13, 2001
VEPAS
Richard Mayr
2000 A* conf
On the Complexity of Bisimulation Problems for Basic Parallel Processes.
ICALP
Richard Mayr
2000 — conf
On the Complexity of Bisimulation Problems for Pushdown Automata.
IFIP TCS
Richard Mayr
2000 J jnl
Process Rewrite Systems.
Inf. Comput.
Richard Mayr
2000 B conf
Undecidable Problems in Unreliable Computations.
LATIN
Richard Mayr
1999 A conf
Model Checking Lossy Vector Addition Systems.
STACS
Ahmed Bouajjani, Richard Mayr
1999 A* conf
On the Verification of Broadcast Protocols.
LICS
Javier Esparza, Alain Finkel, Richard Mayr
1999 A* conf
Simulation Preorder on Simple Process Algebras.
ICALP
Antonín Kucera, Richard Mayr
1999 B conf
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time.
CONCUR
Antonín Kucera, Richard Mayr
1998 — —
Decidability and complexity of model checking problems for infinite state systems.
Richard Mayr
1998 A* conf
Deciding Bisimulation-Like Equivalences with Finite-State Processes.
ICALP
Petr Jancar, Antonín Kucera, Richard Mayr
1998 J jnl
Higher-Order Rewrite Systems and Their Confluence.
Theor. Comput. Sci.
Richard Mayr, Tobias Nipkow
1998 — conf
Strict Lower Bounds for Model Checking BPA.
MFCS Workshop on Concurrency
Richard Mayr
1997 — conf
Combining Petri Nets and PA-Processes.
TACS
Richard Mayr
1997 B conf
Model Checking PA-Processes.
CONCUR
Richard Mayr
1997 — conf
Polynomial Time Approximation Schemes for Geometric Optimization Problems in Euclidean Metric Spaces.
Lectures on Proof Verification and Approximation Algorithms
Richard Mayr, Annette Schelten
1997 — conf
Process rewrite systems.
EXPRESS
Richard Mayr
1997 B conf
Tableau Methods for PA-Processes.
TABLEAUX
Richard Mayr
1996 — conf
Semantic reachability.
INFINITY
Richard Mayr
1996 — conf
Weak Bisimulation and Model Checking for Basic Parallel Processes.
FSTTCS
Richard Mayr