Works (6)

2011 journal article

Common intervals of multiple permutations

Algorithmica, 60(2), 175–206.

By: S. Heber, R. Mayr & J. Stoye

Source: NC State University Libraries
Added: August 6, 2018

2007 journal article

Decisive Markov chains

Logical Methods in Computer Science, 3(4).

By: P. Abdulla, N. Ben Henda & R. Mayr

Source: NC State University Libraries
Added: August 6, 2018

2007 journal article

Dense-timed petri nets: Checking zenoness, token liveness and boundedness

Logical Methods in Computer Science, 3(1).

By: P. Abdulla, P. Mahata & R. Mayr

Source: NC State University Libraries
Added: August 6, 2018

2006 journal article

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.

By: P. Abdulla, N. Henda, R. Mayr & S. Sandberg

Source: NC State University Libraries
Added: August 6, 2018

2005 journal article

Weak bisimilarity and regularity of context-free processes is EXPITIME-hard

Theoretical Computer Science, 330(3), 553–575.

By: R. Mayr

Source: NC State University Libraries
Added: August 6, 2018

2004 chapter

Decidability of zenoness, syntactic boundedness and token-liveness for dense-timed Petri nets

In 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.

By: P. Abdulla, P. Mahata & R. Mayr

Source: NC State University Libraries
Added: August 6, 2018