| 2009 |
|---|
| 49 | EE | Parosh Aziz Abdulla,
Richard Mayr:
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets.
FOSSACS 2009: 348-363 |
| 2008 |
|---|
| 48 | EE | Parosh Aziz Abdulla,
Noomene Ben Henda,
Luca de Alfaro,
Richard Mayr,
Sven Sandberg:
Stochastic Games with Lossy Channels.
FoSSaCS 2008: 35-49 |
| 2007 |
|---|
| 47 | EE | Parosh Aziz Abdulla,
Noomene Ben Henda,
Richard Mayr:
Decisive Markov Chains
CoRR abs/0706.2585: (2007) |
| 46 | EE | Parosh Aziz Abdulla,
Pritha Mahata,
Richard Mayr:
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness.
Logical Methods in Computer Science 3(1): (2007) |
| 45 | EE | Parosh Aziz Abdulla,
Noomene Ben Henda,
Richard Mayr:
Decisive Markov Chains.
Logical Methods in Computer Science 3(4): (2007) |
| 2006 |
|---|
| 44 | EE | Parosh Aziz Abdulla,
Noomene Ben Henda,
Richard Mayr,
Sven Sandberg:
Eager Markov Chains.
ATVA 2006: 24-38 |
| 43 | EE | Parosh Aziz Abdulla,
Noomene Ben Henda,
Richard Mayr,
Sven Sandberg:
Limiting Behavior of Markov Chains with Eager Attractors.
QEST 2006: 253-264 |
| 42 | EE | Parosh Aziz Abdulla,
Pritha Mahata,
Richard Mayr:
Dense-Timed Petri Nets: Checking Zenoness, Token liveness<br> and<br><br> Boundedness
CoRR abs/cs/0611048: (2006) |
| 41 | EE | Antonín Kucera,
Javier Esparza,
Richard Mayr:
Model Checking Probabilistic Pushdown Automata.
Logical Methods in Computer Science 2(1): (2006) |
| 2005 |
|---|
| 40 | EE | Javier Esparza,
Antonín Kucera,
Richard Mayr:
Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances.
LICS 2005: 117-126 |
| 39 | EE | Parosh Aziz Abdulla,
Noomene Ben Henda,
Richard Mayr:
Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property.
LICS 2005: 127-136 |
| 38 | EE | Javier Esparza,
Antonín Kucera,
Richard Mayr:
Model Checking Probabilistic Pushdown Automata
CoRR abs/cs/0508003: (2005) |
| 37 | EE | Richard Mayr:
Weak bisimilarity and regularity of context-free processes is EXPTIME-hard.
Theor. Comput. Sci. 330(3): 553-575 (2005) |
| 2004 |
|---|
| 36 | EE | Parosh Aziz Abdulla,
Pritha Mahata,
Richard Mayr:
Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets.
FSTTCS 2004: 58-70 |
| 35 | | Antonín Kucera,
Richard Mayr:
A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata.
IFIP TCS 2004: 395-408 |
| 34 | EE | Javier Esparza,
Antonín Kucera,
Richard Mayr:
Model Checking Probabilistic Pushdown Automata.
LICS 2004: 12-21 |
| 33 | EE | Stefan Leue,
Richard Mayr,
Wei Wei:
A Scalable Incomplete Test for Message Buffer Overflow in Promela Models.
SPIN 2004: 216-233 |
| 32 | EE | Stefan Leue,
Richard Mayr,
Wei Wei:
A Scalable Incomplete Test for the Boundedness of UML RT Models.
TACAS 2004: 327-341 |
| 31 | EE | Richard Mayr:
Weak Bisimilarity and Regularity of Context-Free Processes is EXPTIME-hard.
Electr. Notes Theor. Comput. Sci. 96: 153-172 (2004) |
| 2003 |
|---|
| 30 | EE | Richard Mayr:
Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes.
ICALP 2003: 570-583 |
| 29 | EE | Ahmed Bouajjani,
Peter Habermehl,
Richard Mayr:
Automatic verification of recursive procedures with one integer parameter.
Theor. Comput. Sci. 295: 85-106 (2003) |
| 28 | EE | Richard Mayr:
Undecidable problems in unreliable computations.
Theor. Comput. Sci. 297(1-3): 337-354 (2003) |
| 2002 |
|---|
| 27 | EE | Antonín Kucera,
Richard Mayr:
Why Is Simulation Harder than Bisimulation?
CONCUR 2002: 594-610 |
| 26 | EE | Antonín Kucera,
Richard Mayr:
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA.
MFCS 2002: 433-445 |
| 25 | EE | Antonín Kucera,
Richard Mayr:
Preface.
Electr. Notes Theor. Comput. Sci. 68(6): (2002) |
| 24 | EE | Antonín Kucera,
Richard Mayr:
Simulation Preorder over Simple Process Algebras.
Inf. Comput. 173(2): 184-198 (2002) |
| 23 | EE | Antonín Kucera,
Richard Mayr:
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time.
Theor. Comput. Sci. 270(1-2): 677-700 (2002) |
| 2001 |
|---|
| 22 | EE | Ahmed Bouajjani,
Peter Habermehl,
Richard Mayr:
Automatic Verification of Recursive Procedures with One Integer Parameter.
MFCS 2001: 198-211 |
| 21 | EE | Richard Mayr:
Introduction - Verification of Parameterized Systems - VEPAS 2001.
Electr. Notes Theor. Comput. Sci. 50(4): (2001) |
| 20 | EE | Richard Mayr:
Decidability of model checking with the temporal logic EF.
Theor. Comput. Sci. 256(1-2): 31-62 (2001) |
| 19 | EE | Petr Jancar,
Antonín Kucera,
Richard Mayr:
Deciding bisimulation-like equivalences with finite-state processes.
Theor. Comput. Sci. 258(1-2): 409-433 (2001) |
| 2000 |
|---|
| 18 | EE | Richard Mayr:
On the Complexity of Bisimulation Problems for Basic Parallel Processes.
ICALP 2000: 329-341 |
| 17 | EE | Richard Mayr:
On the Complexity of Bisimulation Problems for Pushdown Automata.
IFIP TCS 2000: 474-488 |
| 16 | | Richard Mayr:
Undecidable Problems in Unreliable Computations.
LATIN 2000: 377-386 |
| 15 | | Richard Mayr:
Process Rewrite Systems.
Inf. Comput. 156(1-2): 264-286 (2000) |
| 1999 |
|---|
| 14 | EE | Antonín Kucera,
Richard Mayr:
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time.
CONCUR 1999: 368-382 |
| 13 | EE | Antonín Kucera,
Richard Mayr:
Simulation Preorder on Simple Process Algebras.
ICALP 1999: 503-512 |
| 12 | EE | Javier Esparza,
Alain Finkel,
Richard Mayr:
On the Verification of Broadcast Protocols.
LICS 1999: 352-359 |
| 11 | EE | Ahmed Bouajjani,
Richard Mayr:
Model Checking Lossy Vector Addition Systems.
STACS 1999: 323-333 |
| 1998 |
|---|
| 10 | EE | Petr Jancar,
Antonín Kucera,
Richard Mayr:
Deciding Bisimulation-Like Equivalences with Finite-State Processes.
ICALP 1998: 200-211 |
| 9 | EE | Richard Mayr:
Strict Lower Bounds for Model Checking BPA.
Electr. Notes Theor. Comput. Sci. 18: (1998) |
| 8 | EE | Richard Mayr,
Tobias Nipkow:
Higher-Order Rewrite Systems and Their Confluence.
Theor. Comput. Sci. 192(1): 3-29 (1998) |
| 1997 |
|---|
| 7 | | Richard Mayr:
Model Checking PA-Processes.
CONCUR 1997: 332-346 |
| 6 | EE | Richard Mayr,
Annette Schelten:
Polynomial Time Approximation Schemes for Geometric Optimization Problems in Euclidean Metric Spaces.
Lectures on Proof Verification and Approximation Algorithms 1997: 313-324 |
| 5 | | Richard Mayr:
Tableau Methods for PA-Processes.
TABLEAUX 1997: 276-290 |
| 4 | | Richard Mayr:
Combining Petri Nets and PA-Processes.
TACS 1997: 547-561 |
| 3 | EE | Richard Mayr:
Process rewrite systems.
Electr. Notes Theor. Comput. Sci. 7: (1997) |
| 1996 |
|---|
| 2 | | Richard Mayr:
Weak Bisimulation and Model Checking for Basic Parallel Processes.
FSTTCS 1996: 88-99 |
| 1 | EE | Richard Mayr:
Semantic reachability.
Electr. Notes Theor. Comput. Sci. 5: (1996) |
