BibSLEIGH — Richard

Travelled to:

1 × Austria
1 × Canada
1 × Cyprus
1 × Czech Republic
1 × Denmark
1 × Finland
1 × Hungary
1 × Spain
1 × Switzerland
1 × The Netherlands
2 × Italy
2 × United Kingdom
3 × USA

Collaborated with:

P.A.Abdulla A.Kucera J.Esparza ∅ L.Clemente N.B.Henda P.Hofman P.Totzke Y.Chen L.Holík T.Vojnar S.Göller A.W.To S.Leue W.Wei A.Finkel P.Jancar L.d.Alfaro S.Sandberg M.F.Atig K.N.Kumar C.Hong

Talks about:

process (5) automata (4) simul (4) counter (3) bisimul (3) net (3) probabilist (2) pushdown (2) infinit (2) equival (2)

Person: Richard Mayr

DBLP: Mayr:Richard

Contributed to:

2014

2013

2011

2010

2009

2008

2005

2004

2003

2000

1999

1998

Wrote 18 papers:

LICS-CSL-2014-AbdullaAHMKT #energy #game studies #infinity: Infinite-state energy games (PAA, MFA, PH, RM, KNK, PT), p. 10.
LICS-2013-HofmanMT #decidability #simulation: Decidability of Weak Simulation on One-Counter Nets (PH, RM, PT), pp. 203–212.
POPL-2013-MayrC #automaton: Advanced automata minimization (RM, LC), pp. 63–74.
LICS-2011-AbdullaM #petri net: Computing Optimal Coverability Costs in Priced Timed Petri Nets (PAA, RM), pp. 399–408.
CAV-2010-AbdullaCCHHMV #automaton #simulation #testing: Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing (PAA, YFC, LC, LH, CDH, RM, TV), pp. 132–147.
TACAS-2010-AbdullaCHMV #anti #simulation: When Simulation Meets Antichains (PAA, YFC, LH, RM, TV), pp. 158–174.
FoSSaCS-2009-AbdullaM #low cost #petri net #reachability: Minimal Cost Reachability/Coverability in Priced Timed Petri Nets (PAA, RM), pp. 348–363.
LICS-2009-GollerMT #complexity #on the #process #verification: On the Computational Complexity of Verifying One-Counter Processes (SG, RM, AWT), pp. 235–244.
FoSSaCS-2008-AbdullaHAMS #game studies #probability: Stochastic Games with Lossy Channels (PAA, NBH, LdA, RM, SS), pp. 35–49.
LICS-2005-AbdullaHM #finite #infinity #markov #verification: Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property (PAA, NBH, RM), pp. 127–136.
LICS-2005-EsparzaKM #analysis #automaton #probability: Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances (JE, AK, RM), pp. 117–126.
LICS-2004-EsparzaKM #automaton #model checking #probability: Model Checking Probabilistic Pushdown Automata (JE, AK, RM), pp. 12–21.
TACAS-2004-LeueMW #bound #modelling #scalability #uml: A Scalable Incomplete Test for the Boundedness of UML RT Models (SL, RM, WW), pp. 327–341.
ICALP-2003-Mayr #bisimulation #equivalence #process: Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes (RM), pp. 570–583.
ICALP-2000-Mayr #bisimulation #complexity #on the #parallel #problem #process: On the Complexity of Bisimulation Problems for Basic Parallel Processes (RM), pp. 329–341.
ICALP-1999-KuceraM #algebra #process #simulation: Simulation Preorder on Simple Process Algebras (AK, RM), pp. 503–512.
LICS-1999-EsparzaFM #on the #protocol #verification: On the Verification of Broadcast Protocols (JE, AF, RM), pp. 352–359.
ICALP-1998-JancarKM #bisimulation #finite #process: Deciding Bisimulation-Like Equivalences with Finite-State Processes (PJ, AK, RM), pp. 200–211.