Richard Mayr

发表

Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr, 2007, Log. Methods Comput. Sci..

Parosh Aziz Abdulla, Richard Mayr, P. Abdulla, 2013, Log. Methods Comput. Sci..

Model checking probabilistic pushdown automata

Javier Esparza, Antonín Kucera, Richard Mayr, 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

MDPs with energy-parity objectives

Sven Schewe, Richard Mayr, Patrick Totzke, 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

Simulation Preorder over Simple Process Algebras

Antonín Kucera, Richard Mayr, A. Kucera, 2002, Inf. Comput..

Proceedings 14th International Workshop on Verification of Infinite-State Systems, Infinity 2012, Paris, France, 27th August 2012.

Parosh Aziz Abdulla, Richard Mayr, 2012 .

Undecidable problems in unreliable computations

Richard Mayr, 2003, Theor. Comput. Sci..

Preface

Antonín Kucera, Richard Mayr, 2002, INFINITY.

Petri Nets with Time and Cost

Parosh Aziz Abdulla, Richard Mayr, 2012, Infinity.

Strategy Complexity of Parity Objectives in Countable MDPs pdf

Stefan Kiefer, Richard Mayr, Patrick Totzke, 2020, CONCUR.

Proceedings of the 27th International Conference on Concurrency Theory (CONCUR 2016)

Joël Ouaknine, James Worrell, Amaury Pouly, 2016, CONCUR 2016.

A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata

Antonín Kucera, Richard Mayr, A. Kucera, 2018, IFIP TCS.

Undecidable problems in unreliable computations

Richard Mayr, R. Mayr, Richard Mayr, 2000, Theor. Comput. Sci..

Stochastic Parity Games on Lossy Channel Systems

Parosh Aziz Abdulla, Sven Sandberg, Richard Mayr, 2013, QEST.

Advanced Ramsey-Based Büchi Automata Inclusion Testing

Parosh Aziz Abdulla, Lorenzo Clemente, Yu-Fang Chen, 2011, CONCUR.

INTRODUCING A THEORETIC MODEL AND AN EMPIRIC NORM FOR INFORMATION RISK MANAGEMENT IN DECISION MAKING

Richard Mayr, Stefan Schwerd, Stefan Schwerd, 2017 .

Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets

Parosh Aziz Abdulla, Richard Mayr, Pritha Mahata, 2004, FSTTCS.

Efficient reduction of nondeterministic automata with application to language inclusion testing

Lorenzo Clemente, Richard Mayr, R. Mayr, 2017, Log. Methods Comput. Sci..

Multipebble Simulations for Alternating Automata - (Extended Abstract)

Lorenzo Clemente, Richard Mayr, 2010, CONCUR.

Simulation Over One-counter Nets is PSPACE-Complete

Slawomir Lasota, Richard Mayr, Patrick Totzke, 2013, FSTTCS.

A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata

Antonín Kucera, Richard Mayr, 2004, IFIP TCS.

Returning Lost Elements in the Sales Process: Manum Dare

Richard Mayr, 2013, ERP Future.

Richard Mayr, 2005, Theor. Comput. Sci..

Introduction - Verification of Parameterized Systems - VEPAS 2001

Richard Mayr, 2001, Electron. Notes Theor. Comput. Sci..

Antonín Kucera, Richard Mayr, 1999, CONCUR.

On the Computational Complexity of Verifying One-Counter Processes

Anthony Widjaja Lin, Stefan Göller, Richard Mayr, 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

Transience in Countable MDPs pdf

Stefan Kiefer, Richard Mayr, Patrick Totzke, 2020, ArXiv.

Semantic reachability

Richard Mayr, 1996, INFINITY.

Automatic verification of recursive procedures with one integer parameter

Ahmed Bouajjani, Richard Mayr, Peter Habermehl, 2003, Theor. Comput. Sci..

Polynomial Time Approximation Schemes for Geometric Optimization Problems in Euclidean Metric Spaces

Richard Mayr, Annette Schelten, Annette Schelten, 1997, Lectures on Proof Verification and Approximation Algorithms.

When Simulation Meets Antichains

Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, 2010, TACAS.

Model Checking Probabilistic Pushdown Automata

Javier Esparza, Antonín Kucera, Richard Mayr, 2004, LICS.

Deciding Bisimulation-Like Equivalences with Finite-State Processes

Richard Mayr, Antonín Kučera, Petr Jančar, 1998, ICALP.

Infinite-state energy games

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Richard Mayr, 2014, CSL-LICS.

On the Complexity of Bisimulation Problems for Basic Parallel Processes

Richard Mayr, 2000, ICALP.

Büchi Objectives in Countable MDPs

Stefan Kiefer, Richard Mayr, Patrick Totzke, 2019, ICALP.

Decidability of Weak Simulation on One-Counter Nets

Richard Mayr, Patrick Totzke, Piotr Hofman, 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

Qualitative Analysis of VASS-Induced MDPs pdf

Parosh Aziz Abdulla, Richard Mayr, Jeremy Sproston, 2015, FoSSaCS.

Model Checking Lossy Vector Addition Systems

Ahmed Bouajjani, Richard Mayr, A. Bouajjani, 1999, STACS.

A Scalable Incomplete Test for Message Buffer Overflow in Promela Models

Wei Wei, Stefan Leue, Richard Mayr, 2004, SPIN.

How to Play in Infinite MDPs (Invited Talk)

Stefan Kiefer, Richard Mayr, Patrick Totzke, 2020, ICALP.

Branching-Time Model Checking Gap-Order Constraint Systems

Richard Mayr, Patrick Totzke, 2013, RP.

Weak Bisimulation and Model Checking for Basic Parallel Processes

Richard Mayr, 1996, FSTTCS.

On the complexity of checking semantic equivalences between pushdown processes and finite-state processes

Antonín Kucera, Richard Mayr, A. Kucera, 2010, Inf. Comput..

Verifying infinite Markov chains with a finite attractor or the global coarseness property

Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr, 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness pdf

Parosh Aziz Abdulla, Richard Mayr, Pritha Mahata, 2006, Log. Methods Comput. Sci..

Decidability and complexity of model checking problems for infinite state systems

Richard Mayr, 1998 .

Automatic verification of recursive procedures with one integer parameter

Ahmed Bouajjani, Richard Mayr, Peter Habermehl, 2003, Theor. Comput. Sci..

Why Is Simulation Harder than Bisimulation?

Antonín Kucera, Richard Mayr, A. Kucera, 2002, CONCUR.

Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP pdf

Sven Schewe, Richard Mayr, Patrick Totzke, 2021, FoSSaCS.

Model Checking Flat Freeze LTL on One-Counter Automata

Joël Ouaknine, James Worrell, Amaury Pouly, 2018, Log. Methods Comput. Sci..

On the Complexity of Bisimulation Problems for Pushdown Automata

Richard Mayr, 2000, IFIP TCS.

Tableau Methods for PA-Processes

Richard Mayr, 1997, TABLEAUX.

Process rewrite systems

Richard Mayr, 1997, EXPRESS.

Process rewrite systems

Richard Mayr, R. Mayr, 1999, EXPRESS.

Strict Lower Bounds for Model Checking BPA

Richard Mayr, 1998, Electron. Notes Theor. Comput. Sci..

On the Complexity of Semantic Equivalences for Pushdown Automata and BPA

Antonín Kucera, Richard Mayr, 2002, MFCS.

Model Checking PA-Processes

Richard Mayr, 1997, CONCUR.

Decidability of model checking with the temporal logic EF

Richard Mayr, 2001, Theor. Comput. Sci..

Solving Parity Games on Integer Vectors pdf

Parosh Aziz Abdulla, Richard Mayr, Jeremy Sproston, 2013, CONCUR.

Eager Markov Chains : Eager Markov Chains

Parosh Aziz Abdulla, Sven Sandberg, Noomene Ben Henda, 2006 .

Quantitative analysis of probabilistic pushdown automata: expectations and variances

Javier Esparza, Antonín Kucera, Richard Mayr, 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

Model Checking Flat Freeze LTL on One-Counter Automata pdf

Joël Ouaknine, James Worrell, Amaury Pouly, 2016, CONCUR.

CONCUR 2010 - CONCURRENCY THEORY

Lorenzo Clemente, Richard Mayr, 2010 .

Branching-Time Model Checking Gap-Order Constraint Systems pdf

Richard Mayr, Patrick Totzke, 2016, Fundam. Informaticae.

Common Intervals of Multiple Permutations

Jens Stoye, Richard Mayr, Steffen Heber, 2011, Algorithmica.

FIT BUT Technical Report Series

Parosh Aziz Abdulla, Richard Mayr, Yu-Fang Chen, 2010 .

On the verification of broadcast protocols

Alain Finkel, Javier Esparza, Richard Mayr, 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

On strong determinacy of countable stochastic games

Stefan Kiefer, Richard Mayr, Dominik Wojtczak, 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

Algorithmic Game Theory and Applications

Richard Mayr, 2014 .

Combining Petri Nets and PA-Processes

Richard Mayr, 1997, TACS.

Richard Mayr, R. Mayr, 2004, EXPRESS.

A Backward/Forward Strategy for Verifying Safety Properties of Infinite-State Systems

Richard Mayr, Michael Baldamus, Gerardo Schneider, 2003 .

Reduction of Nondeterministic Tree Automata pdf

Lukás Holík, Richard Mayr, Ricardo Almeida, 2016, TACAS.

INFINITY 2002. 4th International Workshop on Verification ofInfinite-State Systems

Richard Mayr, Antonín Kučera, 2002 .

Stochastic Parity Games on Lossy Channel Systems pdf

Parosh Aziz Abdulla, Lorenzo Clemente, Sven Sandberg, 2014, Log. Methods Comput. Sci..

Stochastic Games with Lossy Channels

Parosh Aziz Abdulla, Sven Sandberg, Noomene Ben Henda, 2008, FoSSaCS.

Simulation Preorder on Simple Process Algebras

Antonín Kucera, Richard Mayr, 1999, ICALP.

Limiting Behavior of Markov Chains with Eager Attractors

Parosh Aziz Abdulla, Sven Sandberg, Noomene Ben Henda, 2006, Third International Conference on the Quantitative Evaluation of Systems - (QEST'06).

Higher-Order Rewrite Systems and Their Confluence

Tobias Nipkow, Richard Mayr, T. Nipkow, 1998, Theor. Comput. Sci..

Parity objectives in countable MDPs

Stefan Kiefer, Richard Mayr, Dominik Wojtczak, 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

Universal Safety for Timed Petri Nets is PSPACE-complete pdf

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Richard Mayr, 2018, CONCUR.

Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes

Richard Mayr, 2003, ICALP.

Antonín Kucera, Richard Mayr, A. Kucera, 2002, Theor. Comput. Sci..

Eager Markov Chains

Parosh Aziz Abdulla, Sven Sandberg, Noomene Ben Henda, 2006, ATVA.

Minimal Cost Reachability/Coverability in Priced Timed Petri Nets

Parosh Aziz Abdulla, Richard Mayr, 2009, FoSSaCS.

Simulation Problems Over One-Counter Nets

Slawomir Lasota, Richard Mayr, Patrick Totzke, 2016, Log. Methods Comput. Sci..

A Scalable Incomplete Test for the Boundedness of UML RT Models

Wei Wei, Stefan Leue, Richard Mayr, 2004, TACAS.

Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing

Parosh Aziz Abdulla, Lorenzo Clemente, Yu-Fang Chen, 2010, CAV.

Computing Optimal Coverability Costs in Priced Timed Petri Nets

Parosh Aziz Abdulla, Richard Mayr, P. Abdulla, 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

Advanced automata minimization pdf

Lorenzo Clemente, Richard Mayr, R. Mayr, 2012, POPL.

Deciding bisimulation-like equivalences with finite-state processes

Antonín Kucera, Petr Jancar, Richard Mayr, 2001, Theor. Comput. Sci..

Strategy Complexity of Mean Payoff, Total Payoff and Point Payoff Objectives in Countable MDPs

Richard Mayr, Eric Munday, 2021, CONCUR.

Transience in Countable MDPs

Stefan Kiefer, Richard Mayr, Patrick Totzke, 2021, CONCUR.

Some Results on Basic Parallel Processes

Richard Mayr, 1996 .

Semantic Reachability for Simple Process Algebras

Richard Mayr, 1996 .

When Simulation Meets Antichains ( On Checking Language Inclusion of Nondeterministic Finite ( Tree ) Automata ) ?

Parosh Aziz Abdulla, Yu-Fang Chen, Richard Mayr, 2010 .