| 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 | 235 | 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 | 207 | 2008 |
| A behavioural pseudometric for probabilistic transition systems F Van Breugel, J Worrell Theoretical Computer Science 331 (1), 115-142, 2005 | 180 | 2005 |
| Towards quantitative verification of probabilistic transition systems F van Breugel, J Worrell Automata, Languages and Programming: 28th International Colloquium, ICALP …, 2001 | 157 | 2001 |
| On the decidability and complexity of metric temporal logic over finite words J Ouaknine, J Worrell Logical Methods in Computer Science 3, 2007 | 153 | 2007 |
| Positivity problems for low-order linear recurrence sequences J Ouaknine, J Worrell Proceedings of the twenty-fifth annual ACM-SIAM Symposium on Discrete …, 2014 | 152 | 2014 |
| Nets with tokens which carry data R Lazić, T Newcomb, J Ouaknine, AW Roscoe, J Worrell Fundamenta Informaticae 88 (3), 251-274, 2008 | 148 | 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 | 142 | 2004 |
| On the final sequence of a finitary set functor J Worrell Theoretical Computer Science 338 (1-3), 184-199, 2005 | 134 | 2005 |
| An algorithm for quantitative verification of probabilistic transition systems F van Breugel, J Worrell International Conference on Concurrency Theory, 336-350, 2001 | 126 | 2001 |
| Tractable reasoning in a fragment of separation logic B Cook, C Haase, J Ouaknine, M Parkinson, J Worrell CONCUR 2011–Concurrency Theory: 22nd International Conference, CONCUR 2011 …, 2011 | 122 | 2011 |
| Reachability in succinct and parametric one-counter automata C Haase, S Kreutzer, J Ouaknine, J Worrell CONCUR 2009-Concurrency Theory: 20th International Conference, CONCUR 2009 …, 2009 | 111 | 2009 |
| LTL model checking of interval Markov chains M Benedikt, R Lenhardt, J Worrell Tools and Algorithms for the Construction and Analysis of Systems: 19th …, 2013 | 101 | 2013 |
| Terminal sequences for accessible endofunctors J Worrell Electronic Notes in Theoretical Computer Science 19, 24-38, 1999 | 100 | 1999 |
| Decision problems for linear recurrence sequences J Ouaknine, J Worrell International Workshop on Reachability Problems, 21-28, 2012 | 99 | 2012 |
| On metric temporal logic and faulty Turing machines J Ouaknine, J Worrell International Conference on Foundations of Software Science and Computation …, 2006 | 96 | 2006 |
| Ultimate positivity is decidable for simple linear recurrence sequences J Ouaknine, J Worrell International Colloquium on Automata, Languages, and Programming, 330-341, 2014 | 91 | 2014 |
| Revisiting digitization, robustness, and decidability for timed automata J Ouaknine, J Worrell 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings …, 2003 | 90 | 2003 |
| Online monitoring of metric temporal logic HM Ho, J Ouaknine, J Worrell International conference on runtime verification, 178-192, 2014 | 88 | 2014 |
| On the Positivity Problem for Simple Linear Recurrence Sequences, J Ouaknine, J Worrell Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014 | 88 | 2014 |
Joel OuaknineDirector, Max Planck Institute for Software Systems (MPI-SWS), Saarland Informatics Campus在 mpi-sws.org 的电子邮件经过验证
