Folgen
James Worrell
James Worrell
Professor of Computer Science, Oxford University
Bestätigte E-Mail-Adresse bei cs.ox.ac.uk - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
2182005
Some recent results in metric temporal logic
J Ouaknine, J Worrell
Formal Modeling and Analysis of Timed Systems: 6th International Conference …, 2008
1852008
A behavioural pseudometric for probabilistic transition systems
F Van Breugel, J Worrell
Theoretical Computer Science 331 (1), 115-142, 2005
1592005
On the decidability and complexity of metric temporal logic over finite words
J Ouaknine, J Worrell
arXiv preprint cs/0702120, 2007
1512007
Towards quantitative verification of probabilistic transition systems
F van Breugel, J Worrell
ICALP 1, 421-432, 2001
1462001
Nets with tokens which carry data
R Lazić, T Newcomb, J Ouaknine, AW Roscoe, J Worrell
Fundamenta Informaticae 88 (3), 251-274, 2008
140*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
1362004
On the final sequence of a finitary set functor
J Worrell
Theoretical Computer Science 338 (1-3), 184-199, 2005
1272005
Positivity problems for low-order linear recurrence sequences
J Ouaknine, J Worrell
Proceedings of the twenty-fifth annual ACM-SIAM Symposium on Discrete …, 2014
1242014
An algorithm for quantitative verification of probabilistic transition systems
F van Breugel, J Worrell
CONCUR 1, 336-350, 2001
1242001
Tractable Reasoning in a Fragment of Separation Logic.
B Cook, C Haase, J Ouaknine, MJ Parkinson, J Worrell
CONCUR 11, 235-249, 2011
1142011
On metric temporal logic and faulty Turing machines
J Ouaknine, J Worrell
FoSSaCS 3921, 217-230, 2006
972006
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
962009
Terminal sequences for accessible endofunctors
J Worrell
Electronic Notes in Theoretical Computer Science 19, 24-38, 1999
961999
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
892013
Revisiting digitization, robustness, and decidability for timed automata
J Ouaknine, J Worrell
18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings …, 2003
832003
Approximating and computing behavioural distances in probabilistic transition systems
F van Breugel, J Worrell
Theoretical computer science 360 (1-3), 373-385, 2006
822006
Axioms for probability and nondeterminism
M Mislove, J Ouaknine, J Worrell
Electronic Notes in Theoretical Computer Science 96, 7-28, 2004
802004
On the complexity of computing probabilistic bisimilarity
D Chen, F van Breugel, J Worrell
Foundations of Software Science and Computational Structures: 15th …, 2012
732012
Ultimate positivity is decidable for simple linear recurrence sequences
J Ouaknine, J Worrell
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
722014
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20