Segui
James Worrell
James Worrell
Professor of Computer Science, Oxford University
Email verificata su cs.ox.ac.uk - Home page
Titolo
Citata da
Citata da
Anno
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
2232005
Some recent results in metric temporal logic
J Ouaknine, J Worrell
Formal Modeling and Analysis of Timed Systems: 6th International Conferenceá…, 2008
1972008
A behavioural pseudometric for probabilistic transition systems
F Van Breugel, J Worrell
Theoretical Computer Science 331 (1), 115-142, 2005
1662005
On the decidability and complexity of metric temporal logic over finite words
J Ouaknine, J Worrell
Logical Methods in Computer Science 3, 2007
1492007
Towards quantitative verification of probabilistic transition systems
F van Breugel, J Worrell
Automata, Languages and Programming: 28th International Colloquium, ICALPá…, 2001
1482001
Nets with tokens which carry data
R Lazić, T Newcomb, J Ouaknine, AW Roscoe, J Worrell
Fundamenta Informaticae 88 (3), 251-274, 2008
1422008
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
1392004
Positivity problems for low-order linear recurrence sequences
J Ouaknine, J Worrell
Proceedings of the twenty-fifth annual ACM-SIAM Symposium on Discreteá…, 2014
1352014
On the final sequence of a finitary set functor
J Worrell
Theoretical Computer Science 338 (1-3), 184-199, 2005
1282005
An algorithm for quantitative verification of probabilistic transition systems
F van Breugel, J Worrell
International Conference on Concurrency Theory, 336-350, 2001
1242001
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
1142011
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
1052009
Terminal sequences for accessible endofunctors
J Worrell
Electronic Notes in Theoretical Computer Science 19, 24-38, 1999
981999
On metric temporal logic and faulty Turing machines
J Ouaknine, J Worrell
International Conference on Foundations of Software Science and Computationá…, 2006
952006
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
942013
Decision problems for linear recurrence sequences
J Ouaknine, J Worrell
International Workshop on Reachability Problems, 21-28, 2012
852012
Approximating and computing behavioural distances in probabilistic transition systems
F van Breugel, J Worrell
Theoretical computer science 360 (1-3), 373-385, 2006
852006
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
Online monitoring of metric temporal logic
HM Ho, J Ouaknine, J Worrell
Runtime Verification: 5th International Conference, RV 2014, Toronto, ONá…, 2014
802014
Ultimate positivity is decidable for simple linear recurrence sequences
J Ouaknine, J Worrell
International Colloquium on Automata, Languages, and Programming, 330-341, 2014
792014
Il sistema al momento non pu˛ eseguire l'operazione. Riprova pi¨ tardi.
Articoli 1–20