Richard Mayr

According to our database1, Richard Mayr authored at least 95 papers between 1996 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata.
J. Comput. Syst. Sci., 2018

Universal Safety for Timed Petri Nets is PSPACE-complete.
CoRR, 2018

Universal Safety for Timed Petri Nets is PSPACE-complete.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017
Efficient reduction of nondeterministic automata with application to language inclusion testing.
CoRR, 2017

MDPs with Energy-Parity Objectives.
CoRR, 2017

On Strong Determinacy of Countable Stochastic Games.
CoRR, 2017

Parity Objectives in Countable MDPs.
CoRR, 2017

MDPs with energy-parity objectives.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

On strong determinacy of countable stochastic games.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Parity objectives in countable MDPs.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016
Branching-Time Model Checking Gap-Order Constraint Systems.
Fundam. Inform., 2016

Model Checking Flat Freeze LTL on One-Counter Automata.
CoRR, 2016

Simulation Problems Over One-Counter Nets.
Logical Methods in Computer Science, 2016

Reduction of Nondeterministic Tree Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

Qualitative Analysis of VASS-Induced MDPs.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

Model Checking Flat Freeze LTL on One-Counter Automata.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015
Reduction of Nondeterministic Tree Automata.
CoRR, 2015

Qualitative Analysis of VASS-Induced MDPs.
CoRR, 2015

2014
Stochastic Parity Games on Lossy Channel Systems.
Logical Methods in Computer Science, 2014

Infinite-State Energy Games.
CoRR, 2014

Infinite-state energy games.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
Stochastic Parity Games on Lossy Channel Systems
CoRR, 2013

Decidability of Weak Simulation on One-counter Nets
CoRR, 2013

Branching-Time Model Checking Gap-Order Constraint Systems.
CoRR, 2013

Simulation Over One-counter Nets is PSPACE-Complete.
CoRR, 2013

Solving Parity Games on Integer Vectors.
CoRR, 2013

Priced Timed Petri Nets.
Logical Methods in Computer Science, 2013

Branching-Time Model Checking Gap-Order Constraint Systems.
Proceedings of the Reachability Problems - 7th International Workshop, 2013

Stochastic Parity Games on Lossy Channel Systems.
Proceedings of the Quantitative Evaluation of Systems - 10th International Conference, 2013

Advanced automata minimization.
Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2013

Decidability of Weak Simulation on One-Counter Nets.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Simulation Over One-counter Nets is PSPACE-Complete.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Returning Lost Elements in the Sales Process: Manum Dare.
Proceedings of the Novel Methods and Technologies for Enterprise Information Systems, 2013

Solving Parity Games on Integer Vectors.
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

2012
Petri Nets with Time and Cost
Proceedings of the Proceedings 14th International Workshop on Verification of Infinite-State Systems, 2012

Advanced Automata Minimization
CoRR, 2012

2011
Computing Optimal Coverability Costs in Priced Timed Petri Nets
CoRR, 2011

Common Intervals of Multiple Permutations.
Algorithmica, 2011

Computing Optimal Coverability Costs in Priced Timed Petri Nets.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Advanced Ramsey-Based Büchi Automata Inclusion Testing.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2010
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes.
Inf. Comput., 2010

When Simulation Meets Antichains.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2010

Multipebble Simulations for Alternating Automata - (Extended Abstract).
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing.
Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

2009
On the Computational Complexity of Verifying One-Counter Processes.
Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

Minimal Cost Reachability/Coverability in Priced Timed Petri Nets.
Proceedings of the Foundations of Software Science and Computational Structures, 2009

2008
Stochastic Games with Lossy Channels.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

2007
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness.
Logical Methods in Computer Science, 2007

Decisive Markov Chains.
Logical Methods in Computer Science, 2007

Decisive Markov Chains
CoRR, 2007

2006
Model Checking Probabilistic Pushdown Automata.
Logical Methods in Computer Science, 2006

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

Limiting Behavior of Markov Chains with Eager Attractors.
Proceedings of the Third International Conference on the Quantitative Evaluation of Systems (QEST 2006), 2006

Eager Markov Chains.
Proceedings of the Automated Technology for Verification and Analysis, 2006

2005
Weak bisimilarity and regularity of context-free processes is EXPTIME-hard.
Theor. Comput. Sci., 2005

Model Checking Probabilistic Pushdown Automata
CoRR, 2005

Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances.
Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property.
Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

2004
Weak Bisimilarity and Regularity of Context-Free Processes is EXPTIME-hard.
Electr. Notes Theor. Comput. Sci., 2004

A Scalable Incomplete Test for the Boundedness of UML RT Models.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

A Scalable Incomplete Test for Message Buffer Overflow in Promela Models.
Proceedings of the Model Checking Software, 2004

Model Checking Probabilistic Pushdown Automata.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2003
Undecidable problems in unreliable computations.
Theor. Comput. Sci., 2003

Automatic verification of recursive procedures with one integer parameter.
Theor. Comput. Sci., 2003

Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time.
Theor. Comput. Sci., 2002

Simulation Preorder over Simple Process Algebras.
Inf. Comput., 2002

Preface.
Electr. Notes Theor. Comput. Sci., 2002

On the Complexity of Semantic Equivalences for Pushdown Automata and BPA.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Why Is Simulation Harder than Bisimulation?
Proceedings of the CONCUR 2002, 2002

2001
Decidability of model checking with the temporal logic EF.
Theor. Comput. Sci., 2001

Deciding bisimulation-like equivalences with finite-state processes.
Theor. Comput. Sci., 2001

Introduction - Verification of Parameterized Systems - VEPAS 2001.
Electr. Notes Theor. Comput. Sci., 2001

Automatic Verification of Recursive Procedures with One Integer Parameter.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

2000
Process Rewrite Systems.
Inf. Comput., 2000

Undecidable Problems in Unreliable Computations.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

On the Complexity of Bisimulation Problems for Pushdown Automata.
Proceedings of the Theoretical Computer Science, 2000

On the Complexity of Bisimulation Problems for Basic Parallel Processes.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999
Model Checking Lossy Vector Addition Systems.
Proceedings of the STACS 99, 1999

On the Verification of Broadcast Protocols.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

Simulation Preorder on Simple Process Algebras.
Proceedings of the Automata, 1999

Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time.
Proceedings of the CONCUR '99: Concurrency Theory, 1999

1998
Decidability and complexity of model checking problems for infinite state systems.
PhD thesis, 1998

Higher-Order Rewrite Systems and Their Confluence.
Theor. Comput. Sci., 1998

Strict Lower Bounds for Model Checking BPA.
Electr. Notes Theor. Comput. Sci., 1998

Deciding Bisimulation-Like Equivalences with Finite-State Processes.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997
Process rewrite systems.
Electr. Notes Theor. Comput. Sci., 1997

Combining Petri Nets and PA-Processes.
Proceedings of the Theoretical Aspects of Computer Software, Third International Symposium, 1997

Tableau Methods for PA-Processes.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1997

Polynomial Time Approximation Schemes for Geometric Optimization Problems in Euclidean Metric Spaces.
Proceedings of the Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, 1997

Model Checking PA-Processes.
Proceedings of the CONCUR '97: Concurrency Theory, 1997

1996
Semantic reachability.
Electr. Notes Theor. Comput. Sci., 1996

Weak Bisimulation and Model Checking for Basic Parallel Processes.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996


  Loading...