Richard Mayr

	2011
58		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: 187-202
57		Parosh Aziz Abdulla, Richard Mayr: Computing Optimal Coverability Costs in Priced Timed Petri Nets. LICS 2011: 399-408
56		Steffen Heber, Richard Mayr, Jens Stoye: Common Intervals of Multiple Permutations. Algorithmica 60(2): 175-206 (2011)
55		Parosh Aziz Abdulla, Richard Mayr: Computing Optimal Coverability Costs in Priced Timed Petri Nets CoRR abs/1104.0617: (2011)
	2010
54		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: 132-147
53		Lorenzo Clemente, Richard Mayr: Multipebble Simulations for Alternating Automata - (Extended Abstract). CONCUR 2010: 297-312
52		Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Richard Mayr, Tomás Vojnar: When Simulation Meets Antichains. TACAS 2010: 158-174
51		Antonín Kucera, Richard Mayr: On the complexity of checking semantic equivalences between pushdown processes and finite-state processes. Inf. Comput. 208(7): 772-796 (2010)
	2009
50		Parosh Aziz Abdulla, Richard Mayr: Minimal Cost Reachability/Coverability in Priced Timed Petri Nets. FOSSACS 2009: 348-363
49		Stefan Göller, Richard Mayr, Anthony Widjaja To: On the Computational Complexity of Verifying One-Counter Processes. LICS 2009: 235-244
	2008
48		Parosh Aziz Abdulla, Noomene Ben Henda, Luca de Alfaro, Richard Mayr, Sven Sandberg: Stochastic Games with Lossy Channels. FoSSaCS 2008: 35-49
	2007
47		Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr: Decisive Markov Chains CoRR abs/0706.2585: (2007)
46		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		Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr: Decisive Markov Chains. Logical Methods in Computer Science 3(4): (2007)
	2006
44		Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr, Sven Sandberg: Eager Markov Chains. ATVA 2006: 24-38
43		Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr, Sven Sandberg: Limiting Behavior of Markov Chains with Eager Attractors. QEST 2006: 253-264
42		Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr: Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness CoRR abs/cs/0611048: (2006)
41		Antonín Kucera, Javier Esparza, Richard Mayr: Model Checking Probabilistic Pushdown Automata. Logical Methods in Computer Science 2(1): (2006)
	2005
40		Javier Esparza, Antonín Kucera, Richard Mayr: Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances. LICS 2005: 117-126
39		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		Javier Esparza, Antonín Kucera, Richard Mayr: Model Checking Probabilistic Pushdown Automata CoRR abs/cs/0508003: (2005)
37		Richard Mayr: Weak bisimilarity and regularity of context-free processes is EXPTIME-hard. Theor. Comput. Sci. 330(3): 553-575 (2005)
	2004
36		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		Javier Esparza, Antonín Kucera, Richard Mayr: Model Checking Probabilistic Pushdown Automata. LICS 2004: 12-21
33		Stefan Leue, Richard Mayr, Wei Wei: A Scalable Incomplete Test for Message Buffer Overflow in Promela Models. SPIN 2004: 216-233
32		Stefan Leue, Richard Mayr, Wei Wei: A Scalable Incomplete Test for the Boundedness of UML RT Models. TACAS 2004: 327-341
31		Richard Mayr: Weak Bisimilarity and Regularity of Context-Free Processes is EXPTIME-hard. Electr. Notes Theor. Comput. Sci. 96: 153-172 (2004)
	2003
30		Richard Mayr: Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes. ICALP 2003: 570-583
29		Ahmed Bouajjani, Peter Habermehl, Richard Mayr: Automatic verification of recursive procedures with one integer parameter. Theor. Comput. Sci. 295: 85-106 (2003)
28		Richard Mayr: Undecidable problems in unreliable computations. Theor. Comput. Sci. 297(1-3): 337-354 (2003)
	2002
27		Antonín Kucera, Richard Mayr: Why Is Simulation Harder than Bisimulation? CONCUR 2002: 594-610
26		Antonín Kucera, Richard Mayr: On the Complexity of Semantic Equivalences for Pushdown Automata and BPA. MFCS 2002: 433-445
25		Antonín Kucera, Richard Mayr: Preface. Electr. Notes Theor. Comput. Sci. 68(6): 107-108 (2002)
24		Antonín Kucera, Richard Mayr: Simulation Preorder over Simple Process Algebras. Inf. Comput. 173(2): 184-198 (2002)
23		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		Ahmed Bouajjani, Peter Habermehl, Richard Mayr: Automatic Verification of Recursive Procedures with One Integer Parameter. MFCS 2001: 198-211
21		Richard Mayr: Introduction - Verification of Parameterized Systems - VEPAS 2001. Electr. Notes Theor. Comput. Sci. 50(4): 401-402 (2001)
20		Richard Mayr: Decidability of model checking with the temporal logic EF. Theor. Comput. Sci. 256(1-2): 31-62 (2001)
19		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		Richard Mayr: On the Complexity of Bisimulation Problems for Basic Parallel Processes. ICALP 2000: 329-341
17		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		Antonín Kucera, Richard Mayr: Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time. CONCUR 1999: 368-382
13		Antonín Kucera, Richard Mayr: Simulation Preorder on Simple Process Algebras. ICALP 1999: 503-512
12		Javier Esparza, Alain Finkel, Richard Mayr: On the Verification of Broadcast Protocols. LICS 1999: 352-359
11		Ahmed Bouajjani, Richard Mayr: Model Checking Lossy Vector Addition Systems. STACS 1999: 323-333
	1998
10		Petr Jancar, Antonín Kucera, Richard Mayr: Deciding Bisimulation-Like Equivalences with Finite-State Processes. ICALP 1998: 200-211
9		Richard Mayr: Strict Lower Bounds for Model Checking BPA. Electr. Notes Theor. Comput. Sci. 18: 147-158 (1998)
8		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		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		Richard Mayr: Process rewrite systems. Electr. Notes Theor. Comput. Sci. 7: 185-205 (1997)
	1996
2		Richard Mayr: Weak Bisimulation and Model Checking for Basic Parallel Processes. FSTTCS 1996: 88-99
1		Richard Mayr: Semantic reachability. Electr. Notes Theor. Comput. Sci. 5: 18-28 (1996)

Coauthor Index

1	Parosh Aziz Abdulla	[36] [39] [42] [43] [44] [45] [46] [47] [48] [50] [52] [54] [55] [57] [58]
2	Luca de Alfaro	[48]
3	Ahmed Bouajjani	[11] [22] [29]
4	Yu-Fang Chen	[52] [54] [58]
5	Lorenzo Clemente	[53] [54] [58]
6	Javier Esparza	[12] [34] [38] [40] [41]
7	Alain Finkel	[12]
8	Stefan Göller	[49]
9	Peter Habermehl	[22] [29]
10	Steffen Heber	[56]
11	Noomene Ben Henda	[39] [43] [44] [45] [47] [48]
12	Lukás Holík	[52] [54] [58]
13	Chih-Duo Hong	[54] [58]
14	Petr Jancar	[10] [19]
15	Antonín Kucera	[10] [13] [14] [19] [23] [24] [25] [26] [27] [34] [35] [38] [40] [41] [51]
16	Stefan Leue	[32] [33]
17	Anthony Widjaja Lin (Anthony Widjaja To)	[49]
18	Pritha Mahata	[36] [42] [46]
19	Tobias Nipkow	[8]
20	Sven Sandberg	[43] [44] [48]
21	Annette Schelten	[6]
22	Jens Stoye	[56]
23	Tomás Vojnar	[52] [54] [58]
24	Wei Wei	[32] [33]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page