| On the decidability of metric temporal logic J Ouaknine, J Worrell 20th Annual IEEE Symposium on Logic in Computer Science (LICS'05), 188-197, 2005 | 204 | 2005 |
| Some recent results in metric temporal logic J Ouaknine, J Worrell International Conference on Formal Modeling and Analysis of Timed Systems, 1-13, 2008 | 165 | 2008 |
| A behavioural pseudometric for probabilistic transition systems F Van Breugel, J Worrell Theoretical Computer Science 331 (1), 115-142, 2005 | 145 | 2005 |
| Towards quantitative verification of probabilistic transition systems F van Breugel, J Worrell International Colloquium on Automata, Languages, and Programming, 421-432, 2001 | 141 | 2001 |
| On the decidability and complexity of metric temporal logic over finite words J Ouaknine, J Worrell arXiv preprint cs/0702120, 2007 | 140 | 2007 |
| Nets with tokens which carry data R Lazić, T Newcomb, J Ouaknine, AW Roscoe, J Worrell Fundamenta Informaticae 88 (3), 251-274, 2008 | 131 | 2008 |
| On the language inclusion problem for timed automata: Closing a decidability gap J Ouaknine, J Worrell Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science …, 2004 | 129 | 2004 |
| An algorithm for quantitative verification of probabilistic transition systems F van Breugel, J Worrell International Conference on Concurrency Theory, 336-350, 2001 | 121 | 2001 |
| On the final sequence of a finitary set functor J Worrell Theoretical Computer Science 338 (1-3), 184-199, 2005 | 118 | 2005 |
| Positivity problems for low-order linear recurrence sequences J Ouaknine, J Worrell Proceedings of the twenty-fifth annual ACM-SIAM Symposium on Discrete …, 2014 | 103 | 2014 |
| Tractable reasoning in a fragment of separation logic B Cook, C Haase, J Ouaknine, M Parkinson, J Worrell International Conference on Concurrency Theory, 235-249, 2011 | 100 | 2011 |
| Terminal sequences for accessible endofunctors J Worrell Electronic Notes in Theoretical Computer Science 19, 24-38, 1999 | 94 | 1999 |
| On metric temporal logic and faulty Turing machines J Ouaknine, J Worrell International Conference on Foundations of Software Science and Computation …, 2006 | 93 | 2006 |
| Reachability in succinct and parametric one-counter automata C Haase, S Kreutzer, J Ouaknine, J Worrell International Conference on Concurrency Theory, 369-383, 2009 | 86 | 2009 |
| Revisiting digitization, robustness, and decidability for timed automata J Ouaknine, J Worrell 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings …, 2003 | 84 | 2003 |
| LTL model checking of interval Markov chains M Benedikt, R Lenhardt, J Worrell International Conference on Tools and Algorithms for the Construction and …, 2013 | 83 | 2013 |
| Approximating and computing behavioural distances in probabilistic transition systems F van Breugel, J Worrell Theoretical Computer Science 360 (1-3), 373-385, 2006 | 81 | 2006 |
| Axioms for probability and nondeterminism M Mislove, J Ouaknine, J Worrell Electronic Notes in Theoretical Computer Science 96, 7-28, 2004 | 73 | 2004 |
| On the complexity of computing probabilistic bisimilarity D Chen, F van Breugel, J Worrell International Conference on Foundations of Software Science and …, 2012 | 69 | 2012 |
| Approximating a behavioural pseudometric without discount for probabilistic systems J Worrell, B Sharma, F van Breugel Logical Methods in Computer Science 4, 2008 | 68 | 2008 |
Michael MisloveTulane UniversityVerified email at tulane.edu
