James Worrell
James Worrell
Professor of Computer Science, Oxford University
Verified email at cs.ox.ac.uk - Homepage
Title
Cited by
Cited by
Year
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
1842005
Some recent results in metric temporal logic
J Ouaknine, J Worrell
International Conference on Formal Modeling and Analysis of Timed Systems, 1-13, 2008
1432008
Towards quantitative verification of probabilistic transition systems
F van Breugel, J Worrell
International Colloquium on Automata, Languages, and Programming, 421-432, 2001
1362001
A behavioural pseudometric for probabilistic transition systems
F Van Breugel, J Worrell
Theoretical Computer Science 331 (1), 115-142, 2005
1302005
On the decidability and complexity of metric temporal logic over finite words
J Ouaknine, J Worrell
arXiv preprint cs/0702120, 2007
1282007
Nets with tokens which carry data
R Lazić, T Newcomb, J Ouaknine, AW Roscoe, J Worrell
Fundamenta Informaticae 88 (3), 251-274, 2008
1212008
An algorithm for quantitative verification of probabilistic transition systems
F van Breugel, J Worrell
International Conference on Concurrency Theory, 336-350, 2001
1152001
On the final sequence of a finitary set functor
J Worrell
Theoretical Computer Science 338 (1-3), 184-199, 2005
1122005
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
1102004
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
912011
Terminal sequences for accessible endofunctors
J Worrell
Electronic Notes in Theoretical Computer Science 19, 24-38, 1999
881999
On metric temporal logic and faulty Turing machines
J Ouaknine, J Worrell
International Conference on Foundations of Software Science and Computation …, 2006
862006
Revisiting digitization, robustness, and decidability for timed automata
J Ouaknine, J Worrell
18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings …, 2003
852003
Approximating and computing behavioural distances in probabilistic transition systems
F van Breugel, J Worrell
Theoretical Computer Science 360 (1-3), 373-385, 2006
832006
Positivity problems for low-order linear recurrence sequences
J Ouaknine, J Worrell
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
772014
Authentication protocols based on low-bandwidth unspoofable channels: a comparative survey
LH Nguyen, AW Roscoe
Journal of Computer Security 19 (1), 139-201, 2011
742011
Pebble games, proof complexity, and time-space trade-offs
J Nordstrom
arXiv preprint arXiv:1307.3913, 2013
732013
LTL model checking of interval Markov chains
M Benedikt, R Lenhardt, J Worrell
International Conference on Tools and Algorithms for the Construction and …, 2013
732013
Reachability in succinct and parametric one-counter automata
C Haase, S Kreutzer, J Ouaknine, J Worrell
International Conference on Concurrency Theory, 369-383, 2009
732009
Approximating a behavioural pseudometric without discount for probabilistic systems
F Van Breugel, B Sharma, J Worrell
International Conference on Foundations of Software Science and …, 2007
662007
The system can't perform the operation now. Try again later.
Articles 1–20