Richard Mayr

From MaRDI portal
Person:235698

Available identifiers

zbMath Open mayr.richard-mMaRDI QIDQ235698

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61342552023-08-21Paper
Strategy Complexity of Mean Payoff, Total Payoff and Point Payoff Objectives in Countable MDPs2023-08-21Paper
Approximating the Value of Energy-Parity Objectives in Simple Stochastic Games2023-07-11Paper
Model checking PA-processes2023-05-17Paper
Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs2023-03-22Paper
Strategy Complexity of Threshold Payoff with Applications to Optimal Expected Payoff2022-11-23Paper
https://portal.mardi4nfdi.de/entity/Q50923202022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50893062022-07-18Paper
Strategy Complexity of Reachability in Countable Stochastic 2-Player Games2022-03-22Paper
Simple stochastic games with almost-sure energy-parity objectives are in NP and conp2021-10-18Paper
Universal safety for timed Petri nets is PSPACE-complete2021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q33887062021-05-06Paper
https://portal.mardi4nfdi.de/entity/Q51446462021-01-19Paper
https://portal.mardi4nfdi.de/entity/Q51446782021-01-19Paper
https://portal.mardi4nfdi.de/entity/Q51446812021-01-19Paper
Reduction of nondeterministic tree automata2019-09-17Paper
B\"uchi Objectives in Countable MDPs2019-04-25Paper
https://portal.mardi4nfdi.de/entity/Q46257012019-02-25Paper
https://portal.mardi4nfdi.de/entity/Q46113762019-01-18Paper
Tableau methods for PA-processes2019-01-15Paper
Polynomial time approximation schemes for geometric optimization problems in euclidean metric spaces2018-07-03Paper
Infinite-state energy games2018-04-23Paper
https://portal.mardi4nfdi.de/entity/Q46086812018-03-21Paper
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata2017-10-11Paper
Decidability of Weak Simulation on One-Counter Nets2017-07-03Paper
Branching-Time Model Checking Gap-Order Constraint Systems2017-03-16Paper
Simulation Over One-counter Nets is PSPACE-Complete2017-02-21Paper
Qualitative Analysis of VASS-Induced MDPs2016-06-10Paper
Simulation Problems Over One-Counter Nets2016-04-19Paper
Stochastic Parity Games on Lossy Channel Systems2015-01-15Paper
Advanced automata minimization2014-11-27Paper
Branching-Time Model Checking Gap-Order Constraint Systems2014-07-07Paper
Priced Timed Petri Nets2013-11-28Paper
https://portal.mardi4nfdi.de/entity/Q28474102013-09-09Paper
Solving Parity Games on Integer Vectors2013-08-12Paper
Advanced Ramsey-Based Büchi Automata Inclusion Testing2011-09-02Paper
Common intervals of multiple permutations2011-05-10Paper
Multipebble Simulations for Alternating Automata2010-08-31Paper
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes2010-08-18Paper
When Simulation Meets Antichains2010-04-27Paper
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets2009-03-31Paper
Eager Markov Chains2008-09-04Paper
Stochastic Games with Lossy Channels2008-04-11Paper
Decisive Markov Chains2008-04-01Paper
Model Checking Probabilistic Pushdown Automata2007-10-11Paper
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness2007-10-11Paper
Model Checking Software2007-09-28Paper
Tools and Algorithms for the Construction and Analysis of Systems2007-09-28Paper
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science2005-08-12Paper
https://portal.mardi4nfdi.de/entity/Q46734212005-04-29Paper
Weak bisimilarity and regularity of context-free processes is EXPTIME-hard2005-02-22Paper
https://portal.mardi4nfdi.de/entity/Q44492042004-02-08Paper
Automatic verification of recursive procedures with one integer parameter.2003-08-17Paper
Undecidable problems in unreliable computations.2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q47085922003-06-18Paper
https://portal.mardi4nfdi.de/entity/Q44845132003-06-12Paper
Process rewrite systems.2003-01-14Paper
Simulation preorder over simple process algebras2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q47854602003-01-01Paper
https://portal.mardi4nfdi.de/entity/Q45364432002-11-25Paper
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q27541552001-11-11Paper
Decidability of model checking with the temporal logic EF2001-08-20Paper
Deciding bisimulation-like equivalences with finite-state processes2001-08-20Paper
https://portal.mardi4nfdi.de/entity/Q45083932000-10-03Paper
https://portal.mardi4nfdi.de/entity/Q42700701999-12-20Paper
https://portal.mardi4nfdi.de/entity/Q42510601999-11-29Paper
https://portal.mardi4nfdi.de/entity/Q42347631999-03-16Paper
https://portal.mardi4nfdi.de/entity/Q42229201998-12-21Paper
https://portal.mardi4nfdi.de/entity/Q42228741998-12-20Paper
Higher-order rewrite systems and their confluence1998-08-13Paper
https://portal.mardi4nfdi.de/entity/Q43644001997-11-17Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Richard Mayr