• Publications
  • Influence
Process Rewrite Systems
  • R. Mayr
  • Computer Science, Mathematics
  • Inf. Comput.
  • 6 December 1999
TLDR
We define a hierarchy of classes of rewrite systems for infinite-state concurrent systems that are strictly more expressive than Petri nets, PA-processes, and pushdown processes, but not Turing-powerful. Expand
On the verification of broadcast protocols
TLDR
We analyze the model-checking problems for safety and liveness properties in parameterized broadcast protocols, a model introduced by Emerson and Namjoshi in the sequel. Expand
Higher-Order Rewrite Systems and Their Confluence
  • R. Mayr, T. Nipkow
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 10 February 1998
TLDR
We study higher-order rewrite systems (HRSs) which extend term rewriting to λ-terms. Expand
Model Checking Lossy Vector Addition Systems
TLDR
We present an almost complete picture of the decidability of model checking problems for lossy systems and several branching-time and linear-time temporal logics. Expand
On the Complexity of Bisimulation Problems for Pushdown Automata
  • R. Mayr
  • Computer Science
  • IFIP TCS
  • 17 August 2000
TLDR
We show that all bisimulation problems for pushdown automata are PSPACE-hard, even for small fixed finite automaton. Expand
On the Complexity of Bisimulation Problems for Basic Parallel Processes
  • R. Mayr
  • Mathematics, Computer Science
  • ICALP
  • 9 July 2000
TLDR
Strong bisimilarity of Basic Parallel Processes (BPP) is decidable, but the best known algorithm has non-elementary complexity [7]. Expand
Advanced Ramsey-Based Büchi Automata Inclusion Testing
TLDR
We propose the Ramsey-based approach for checking language inclusion between two nondeterministic Buchi automata A and B. Expand
Undecidable Problems in Unreliable Computations
  • R. Mayr
  • Computer Science
  • LATIN
  • 10 April 2000
TLDR
Lossy counter machines are defined as Minsky n-counter machines where the values in the counters can spontaneously decrease at any time. Expand
Undecidable problems in unreliable computations
  • R. Mayr
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 17 March 2003
TLDR
Lossy counter machines are defined as Minsky counter machines where the values in the counters can spontaneously decrease at any time. Expand
...
1
2
3
4
5
...