Richard Mayr - Citegraph

Author Info

Name	Affiliation	Papers
RICHARD MAYR	Department of Computer Science, Albert-Ludwigs-University Freiburg, Freiburg, Germany	8
Collaborators	Citations	PageRank
7	135	6.64
Referers	Referees	References
140	156	192

Search Limit

100156

Publications (8 rows)

Collaborators (7 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes	12	0.70	2010
A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata	6	0.44	2004
A Scalable Incomplete Test for Message Buffer Overflow in Promela Models	9	0.60	2004
A Scalable Incomplete Test for the Boundedness of UML RT Models	15	0.73	2004
Undecidability of weak bisimulation equivalence for 1-counter processes	15	0.74	2003
Automatic verification of recursive procedures with one integer parameter	21	1.14	2003
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA	14	0.65	2002
Deciding bisimulation-like equivalences with finite-state processes	43	1.65	2001

1