Ìayr, Richard - School of Informatics, University of Edinburgh

• Limiting Behavior of Markov Chains with Eager Attractors Parosh Aziz Abdulla
• When Simulation Meets Antichains (On Checking Language Inclusion of Nondeterministic Finite (Tree) Automata)
• Model Checking Lossy Vector Addition Systems Ahmed Bouajjani ? ??? Richard Mayr ?? ???
• Weak Bisimulation and Model Checking for Basic Parallel Processes
• Information and Computation 156, 264 286 (1999) Process Rewrite Systems
• Advanced Ramsey-based Buchi Automata Inclusion Testing
• Simulation Preorder on Simple Process Algebras Antonn Ku cera ?1 and Richard Mayr 2
• Undecidability of Weak Bisimulation Equivalence for 1Counter Processes
• Tableau Methods for PAProcesses Richard Mayr
• A GENERIC FRAMEWORK FOR CHECKING SEMANTIC EQUIVALENCES BETWEEN
• Algorithmica DOI 10.1007/s00453-009-9332-1
• On the Complexity of Checking Semantic Equivalences between Pushdown Processes and
• Decidability of Zenoness, Syntactic Boundedness and TokenLiveness for DenseTimed Petri Nets
• Electronic Notes in Theoretical Computer Science 18 (1998) URL: http://www.elsevier.nl/locate/entcs/volume18.html 12 pages
• A Scalable Incomplete Test for Message Buffer Overflow in Promela Models
• Model Checking PAProcesses Richard Mayr
• Decidability and Complexity of Model Checking Problems for
• w\Delta\Theta\Lambda\Xi\Pi\Sigma\Upsilon\Phi\Omega fffi flffiij `' ae/!'' #$%&' ()+,. /012 345!yA---Faculty of Informatics
• HigherOrder Rewrite Systems and their Confluence Richard Mayr & Tobias Nipkow \Lambda
• Deciding BisimulationLike Equivalences with FiniteState Processes
• On the Complexity of Bisimulation Problems for Pushdown Automata
• Decidability of Zenoness, Syntactic Boundedness and TokenLiveness for DenseTimed Petri Nets
• Strict Lower Bounds for Model Checking BPA
• Weak Bisimilarity and Regularity of ContextFree Processes is EXPTIMEhard
• Model Checking Probabilistic Pushdown Automata Javier Esparza
• Semantic reachability for simple process algebras Richard Mayr \Lambda
• Reachability is Decidable for Ground AC Rewrite Systems
• Model Checking Lossy Vector Addition Systems
• Electronic Notes in Theoretical Computer Science 6 (1997) URL: http://www.elsevier.nl/locate/entcs/volume6.html ?? pages
• Why is Simulation Harder Than Bisimulation? Antonn Kucera #1 and Richard Mayr 2
• Automatic Veri cation of Recursive Procedures with one Integer Parameter
• Combining Petri Nets and PAProcesses Richard Mayr
• On the Complexity of Semantic Equivalences for Pushdown Automata and BPA
• Computing Optimal Coverability Costs in Priced Timed Petri Nets
• On the Computational Complexity of Verifying One-Counter Processes Stefan Goller
• Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
• Weak Bisimilarity between FiniteState Systems and BPA or Normed BPP is
• w\Delta\Theta\Lambda\Xi\Pi\Sigma\Upsilon\Phi\Omega fffi flffiij `' ae/!'' #$%&' ()+,. /012 345!yA---Faculty of Informatics
• Weak Bisimilarity with InfiniteState Systems can be Decided in Polynomial Time
• Automatic Verification of Recursive Procedures with one Integer Parameter
• Eager Markov Chains Parosh Aziz Abdulla 1 parosh@it.uu.se,
• Undecidable Problems in Unreliable Computations Richard Mayr ?
• Simulation Preorder over Simple Process Algebras Anton n Ku cera 1
• Deciding BisimulationLike Equivalences with FiniteState Processes #
• Process Rewrite Systems Richard Mayr
• Decidability of Model Checking with the Temporal Logic EF
• A Scalable Incomplete Test for the Boundedness of UML RT Models
• On the Complexity of Bisimulation Problems for Basic Parallel Processes
• EXPRESS 2003 Preliminary Version Weak Bisimilarity and Regularity of
• Multipebble Simulations for Alternating Automata (Extended Abstract)
• Undecidable Problems in Unreliable Computations
• Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property
• w\Delta\Theta\Lambda\Xi\Pi\Sigma\Upsilon\Phi\Omega fffi flffiij `' ae/!'' #$%&' ()+,. /012 345!yA---Faculty of Informatics