 | 2009 |
|---|
| 52 |       | Christoph Haase,
Stephan Kreutzer,
Joël Ouaknine,
James Worrell:
Reachability in Succinct and Parametric One-Counter Automata.
CONCUR 2009: 369-383 |
| 51 | | Joël Ouaknine,
Alexander Rabinovich,
James Worrell:
Time-Bounded Verification.
CONCUR 2009: 496-510 |
| 2008 |
|---|
| 50 | | Joël Ouaknine,
James Worrell:
Some Recent Results in Metric Temporal Logic.
FORMATS 2008: 1-13 |
| 49 | | Patricia Bouyer,
Nicolas Markey,
Joël Ouaknine,
James Worrell:
On Expressiveness and Complexity in Real-Time Model Checking.
ICALP (2) 2008: 124-135 |
| 48 | | James Worrell:
Model Checking and Decision Procedures for Probabilistic Automata and Markov Chains.
QEST 2008: 322 |
| 47 | | Patricia Bouyer,
Nicolas Markey,
Joël Ouaknine,
Ph. Schnoebelen,
James Worrell:
On Termination for Faulty Channel Machines.
STACS 2008: 121-132 |
| 46 | | Axel Legay,
Andrzej S. Murawski,
Joël Ouaknine,
James Worrell:
On Automated Verification of Probabilistic Programs.
TACAS 2008: 173-187 |
| 45 | | James Worrell:
Real-Time Model Checking: Algorithms and Complexity.
TIME 2008: 19 |
| 44 | | Patricia Bouyer,
Nicolas Markey,
Joël Ouaknine,
Ph. Schnoebelen,
James Worrell:
On Termination for Faulty Channel Machines
CoRR abs/0802.2839: (2008) |
| 43 | | Franck van Breugel,
Babita Sharma,
James Worrell:
Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
CoRR abs/0803.3796: (2008) |
| 42 | | Ranko Lazic,
Tom Newcomb,
Joël Ouaknine,
A. W. Roscoe,
James Worrell:
Nets with Tokens which Carry Data.
Fundam. Inform. 88(3): 251-274 (2008) |
| 41 | | Parosh Aziz Abdulla,
Johann Deneux,
Joël Ouaknine,
Karin Quaas,
James Worrell:
Universality Analysis for One-Clock Timed Automata.
Fundam. Inform. 89(4): 419-450 (2008) |
| 40 | | Franck van Breugel,
Babita Sharma,
James Worrell:
Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems.
Logical Methods in Computer Science 4(2): (2008) |
| 2007 |
|---|
| 39 | | Sara Adams,
Joël Ouaknine,
James Worrell:
Undecidability of Universality for Timed Automata with Minimal Resources.
FORMATS 2007: 25-37 |
| 38 | | Parosh Aziz Abdulla,
Joël Ouaknine,
Karin Quaas,
James Worrell:
Zone-Based Universality Analysis for Single-Clock Timed Automata.
FSEN 2007: 98-112 |
| 37 | | Franck van Breugel,
Babita Sharma,
James Worrell:
Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems.
FoSSaCS 2007: 123-137 |
| 36 | | Ranko Lazic,
Thomas Christopher Newcomb,
Joël Ouaknine,
A. W. Roscoe,
James Worrell:
Nets with Tokens Which Carry Data.
ICATPN 2007: 301-320 |
| 35 | | Patricia Bouyer,
Nicolas Markey,
Joël Ouaknine,
James Worrell:
The Cost of Punctuality.
LICS 2007: 109-120 |
| 34 | | Joël Ouaknine,
James Worrell:
On the decidability and complexity of Metric Temporal Logic over finite words
CoRR abs/cs/0702120: (2007) |
| 33 | | Michael W. Mislove,
Dusko Pavlovic,
James Worrell:
Labelled Markov Processes as Generalised Stochastic Relations.
Electr. Notes Theor. Comput. Sci. 172: 459-478 (2007) |
| 32 | | Joël Ouaknine,
James Worrell:
On the decidability and complexity of Metric Temporal Logic over finite words.
Logical Methods in Computer Science 3(1): (2007) |
| 31 | | Franck van Breugel,
Claudio Hermida,
Michael Makkai,
James Worrell:
Recursively defined metric spaces without contraction.
Theor. Comput. Sci. 380(1-2): 143-163 (2007) |
| 2006 |
|---|
| 30 | | Dusko Pavlovic,
Michael W. Mislove,
James Worrell:
Testing Semantics: Connecting Processes and Process Logics.
AMAST 2006: 308-322 |
| 29 | | Joël Ouaknine,
James Worrell:
On Metric Temporal Logic and Faulty Turing Machines.
FoSSaCS 2006: 217-230 |
| 28 | | Joël Ouaknine,
James Worrell:
Safety Metric Temporal Logic Is Fully Decidable.
TACAS 2006: 411-425 |
| 27 | | Franck van Breugel,
James Worrell:
Approximating and computing behavioural distances in probabilistic transition systems.
Theor. Comput. Sci. 360(1-3): 373-385 (2006) |
| 2005 |
|---|
| 26 | | Franck van Breugel,
Claudio Hermida,
Michael Makkai,
James Worrell:
An Accessible Approach to Behavioural Pseudometrics.
ICALP 2005: 1018-1030 |
| 25 | | Parosh Aziz Abdulla,
Johann Deneux,
Joël Ouaknine,
James Worrell:
Decidability and Complexity Results for Timed Automata via Channel Machines.
ICALP 2005: 1089-1101 |
| 24 | | Joël Ouaknine,
James Worrell:
On the Decidability of Metric Temporal Logic.
LICS 2005: 188-197 |
| 23 | | James Worrell:
A note on coalgebras and presheaves.
Mathematical Structures in Computer Science 15(3): 475-483 (2005) |
| 22 | | Franck van Breugel,
James Worrell:
A behavioural pseudometric for probabilistic transition systems.
Theor. Comput. Sci. 331(1): 115-142 (2005) |
| 21 | | Franck van Breugel,
Michael W. Mislove,
Joël Ouaknine,
James Worrell:
Domain theory, testing and simulation for labelled Markov processes.
Theor. Comput. Sci. 333(1-2): 171-197 (2005) |
| 20 | | James Worrell:
On the final sequence of a finitary set functor.
Theor. Comput. Sci. 338(1-3): 184-199 (2005) |
| 2004 |
|---|
| 19 | | Michael W. Mislove,
Joël Ouaknine,
Dusko Pavlovic,
James Worrell:
Duality for Labelled Markov Processes.
FoSSaCS 2004: 393-407 |
| 18 | | Joël Ouaknine,
James Worrell:
On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap.
LICS 2004: 54-63 |
| 17 | | Michael W. Mislove,
Joël Ouaknine,
James Worrell:
Axioms for Probability and Nondeterminism.
Electr. Notes Theor. Comput. Sci. 96: 7-28 (2004) |
| 16 | | Keye Martin,
Michael W. Mislove,
James Worrell:
Measuring the probabilistic powerdomain.
Theor. Comput. Sci. 312(1): 99-119 (2004) |
| 2003 |
|---|
| 15 | | Franck van Breugel,
Michael W. Mislove,
Joël Ouaknine,
James Worrell:
An Intrinsic Characterization of Approximate Probabilistic Bisimilarity.
FoSSaCS 2003: 200-215 |
| 14 | | Joël Ouaknine,
James Worrell:
Universality and Language Inclusion for Open and Closed Timed Automata.
HSCC 2003: 375-388 |
| 13 | | Joël Ouaknine,
James Worrell:
Revisiting Digitization, Robustness, and Decidability for Timed Automata.
LICS 2003: 198-207 |
| 12 |  | Joël Ouaknine,
James Worrell:
Timed CSP = Closed Timed epsilon-automata.
Nord. J. Comput. 10(2): 99-133 (2003) |
| 2002 |
|---|
| 11 | | Keye Martin,
Michael W. Mislove,
James Worrell:
Measuring the Probabilistic Powerdomain.
ICALP 2002: 463-475 |
| 10 | | Franck van Breugel,
Steven Shalit,
James Worrell:
Testing Labelled Markov Processes.
ICALP 2002: 537-548 |
| 9 | | James Worrell:
A Note on Coalgebras and Presheaves.
Electr. Notes Theor. Comput. Sci. 65(1): (2002) |
| 8 | | Joël Ouaknine,
James Worrell:
Timed CSP = Closed Timed Safety Automata.
Electr. Notes Theor. Comput. Sci. 68(2): (2002) |
| 2001 |
|---|
| 7 | | Franck van Breugel,
James Worrell:
An Algorithm for Quantitative Verification of Probabilistic Transition Systems.
CONCUR 2001: 336-350 |
| 6 | | Franck van Breugel,
James Worrell:
Towards Quantitative Verification of Probabilistic Transition Systems.
ICALP 2001: 421-432 |
| 5 | | Peter Johnstone,
John Power,
Toru Tsujishita,
Hiroshi Watanabe,
James Worrell:
On the structure of categories of coalgebras.
Theor. Comput. Sci. 260(1-2): 87-117 (2001) |
| 2000 |
|---|
| 4 | | James Worrell:
Coinduction for recursive data types: partial orders, metric spaces and Omega-categories.
Electr. Notes Theor. Comput. Sci. 33: (2000) |
| 1999 |
|---|
| 3 | | James Worrell:
Terminal sequences for accessible endofunctors.
Electr. Notes Theor. Comput. Sci. 19: (1999) |
| 1998 |
|---|
| 2 | | Peter Johnstone,
John Power,
Toru Tsujishita,
Hiroshi Watanabe,
James Worrell:
An Axiomatics for Categories of Transition Systems as Coalgebras.
LICS 1998: 207-213 |
| 1 | | James Worrell:
Toposes of Coalgebras and Hidden Algebras.
Electr. Notes Theor. Comput. Sci. 11: (1998) |
