Richard Mayr

Heber, S., Mayr, R., & Stoye, J. (2011). Common Intervals of Multiple Permutations. ALGORITHMICA, 60(2), 175–206. https://doi.org/10.1007/s00453-009-9332-1

Abdulla, P. A., Ben Henda, N., & Mayr, R. (2007). Decisive Markov chains. Logical Methods in Computer Science, 3(4).

Abdulla, P. A., Mahata, P., & Mayr, R. (2007). Dense-timed petri nets: Checking zenoness, token liveness and boundedness. Logical Methods in Computer Science, 3(1).

Abdulla, P. A., Henda, N. B., Mayr, R., & Sandberg, S. (2006). Eager Markov chains. Automated Technology for Verification and Analysis : ?b 4th International Symposium, ATVA 2006, Beijing, China, October 23-26, 2006 : Proceedings / ?c Susanne Graf, Wenhui Zhang (Eds.)., 4218, 24–38.

Mayr, R. (2005, February 9). Weak bisimilarity and regularity of context-free processes is EXPITIME-hard. THEORETICAL COMPUTER SCIENCE, Vol. 330, pp. 553–575. https://doi.org/10.1016/j.tcs.2004.10.008

Abdulla, P., Mahata, P., & Mayr, R. (2004). Decidability of zenoness, syntactic boundedness and token-liveness for dense-timed Petri nets. In K. Lodaya & M. Mahajan (Eds.), FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science: 24th international conference, Chennai, India, December 16-18, 2004: Proceedings (Lecture notes in computer science ; 3328) (Vol. 3328, pp. 58–70). Berlin; New York: Springer.