| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Steffen Heber, Richard Mayr, Jens Stoye |
Common Intervals of Multiple Permutations.  |
Algorithmica  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Richard Mayr |
Computing Optimal Coverability Costs in Priced Timed Petri Nets |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Richard Mayr |
Computing Optimal Coverability Costs in Priced Timed Petri Nets. |
LICS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonín Kucera, Richard Mayr |
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Lorenzo Clemente, Richard Mayr |
Multipebble Simulations for Alternating Automata - (Extended Abstract). |
CONCUR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Richard Mayr, Tomás Vojnar |
When Simulation Meets Antichains. |
TACAS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Göller, Richard Mayr, Anthony Widjaja To |
On the Computational Complexity of Verifying One-Counter Processes. |
LICS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Richard Mayr |
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets. |
FOSSACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Noomene Ben Henda, Luca de Alfaro, Richard Mayr, Sven Sandberg |
Stochastic Games with Lossy Channels. |
FoSSaCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr |
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness. |
Logical Methods in Computer Science |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr |
Decisive Markov Chains. |
Logical Methods in Computer Science |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr |
Decisive Markov Chains |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Antonín Kucera, Javier Esparza, Richard Mayr |
Model Checking Probabilistic Pushdown Automata. |
Logical Methods in Computer Science |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr |
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr, Sven Sandberg |
Eager Markov Chains. |
ATVA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr, Sven Sandberg |
Limiting Behavior of Markov Chains with Eager Attractors. |
QEST |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Mayr |
Weak bisimilarity and regularity of context-free processes is EXPTIME-hard. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Javier Esparza, Antonín Kucera, Richard Mayr |
Model Checking Probabilistic Pushdown Automata |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Javier Esparza, Antonín Kucera, Richard Mayr |
Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances. |
LICS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr |
Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property. |
LICS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Mayr |
Weak Bisimilarity and Regularity of Context-Free Processes is EXPTIME-hard. |
Electr. Notes Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Leue, Richard Mayr, Wei Wei |
A Scalable Incomplete Test for the Boundedness of UML RT Models. |
TACAS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Leue, Richard Mayr, Wei Wei |
A Scalable Incomplete Test for Message Buffer Overflow in Promela Models. |
SPIN |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonín Kucera, Richard Mayr |
A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata. |
IFIP TCS |
2004 |
DBLP BibTeX RDF |
|
| 1 | Javier Esparza, Antonín Kucera, Richard Mayr |
Model Checking Probabilistic Pushdown Automata. |
LICS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr |
Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Mayr |
Undecidable problems in unreliable computations. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ahmed Bouajjani, Peter Habermehl, Richard Mayr |
Automatic verification of recursive procedures with one integer parameter. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Mayr |
Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
1-counter nets, 1-counter machines, bisimulation |
| 1 | Antonín Kucera, Richard Mayr |
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonín Kucera, Richard Mayr |
Simulation Preorder over Simple Process Algebras. |
Inf. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonín Kucera, Richard Mayr |
Preface. |
Electr. Notes Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonín Kucera, Richard Mayr |
Why Is Simulation Harder than Bisimulation? |
CONCUR |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonín Kucera, Richard Mayr |
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA. |
MFCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Jancar, Antonín Kucera, Richard Mayr |
Deciding bisimulation-like equivalences with finite-state processes. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Mayr |
Decidability of model checking with the temporal logic EF. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Mayr |
Introduction - Verification of Parameterized Systems - VEPAS 2001. |
Electr. Notes Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ahmed Bouajjani, Peter Habermehl, Richard Mayr |
Automatic Verification of Recursive Procedures with One Integer Parameter. |
MFCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Mayr |
Process Rewrite Systems. |
Inf. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Mayr |
On the Complexity of Bisimulation Problems for Basic Parallel Processes. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Mayr |
Undecidable Problems in Unreliable Computations. |
LATIN |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Mayr |
On the Complexity of Bisimulation Problems for Pushdown Automata. |
IFIP TCS |
2000 |
DBLP DOI BibTeX RDF |
verification, complexity, bisimulation, Pushdown automata |
| 1 | Antonín Kucera, Richard Mayr |
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonín Kucera, Richard Mayr |
Simulation Preorder on Simple Process Algebras. |
ICALP |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Ahmed Bouajjani, Richard Mayr |
Model Checking Lossy Vector Addition Systems. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Javier Esparza, Alain Finkel, Richard Mayr |
On the Verification of Broadcast Protocols. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Mayr, Tobias Nipkow |
Higher-Order Rewrite Systems and Their Confluence. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Mayr |
Strict Lower Bounds for Model Checking BPA. |
Electr. Notes Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Jancar, Antonín Kucera, Richard Mayr |
Deciding Bisimulation-Like Equivalences with Finite-State Processes. |
ICALP |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Mayr |
Process rewrite systems. |
Electr. Notes Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Mayr |
Model Checking PA-Processes. |
CONCUR |
1997 |
DBLP DOI BibTeX RDF |
PA-processes, model checking, process algebras, tableau systems |
| 1 | Richard Mayr |
Combining Petri Nets and PA-Processes. |
TACS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Mayr, Annette Schelten |
Polynomial Time Approximation Schemes for Geometric Optimization Problems in Euclidean Metric Spaces. |
Lectures on Proof Verification and Approximation Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Mayr |
Tableau Methods for PA-Processes. |
TABLEAUX |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Mayr |
Semantic reachability. |
Electr. Notes Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Mayr |
Weak Bisimulation and Model Checking for Basic Parallel Processes. |
FSTTCS |
1996 |
DBLP DOI BibTeX RDF |
Basic Parallel Processes, model checking, bisimulation |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")