The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

James Worrell: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dusko Pavlovic, Michael W. Mislove, James Worrell
    Testing Semantics: Connecting Processes and Process Logics. [Citation Graph (0, 0)][DBLP]
    AMAST, 2006, pp:308-322 [Conf]
  2. Franck van Breugel, James Worrell
    An Algorithm for Quantitative Verification of Probabilistic Transition Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2001, pp:336-350 [Conf]
  3. Franck van Breugel, Michael W. Mislove, Joël Ouaknine, James Worrell
    An Intrinsic Characterization of Approximate Probabilistic Bisimilarity. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:200-215 [Conf]
  4. Michael W. Mislove, Joël Ouaknine, Dusko Pavlovic, James Worrell
    Duality for Labelled Markov Processes. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:393-407 [Conf]
  5. Joël Ouaknine, James Worrell
    On Metric Temporal Logic and Faulty Turing Machines. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2006, pp:217-230 [Conf]
  6. Joël Ouaknine, James Worrell
    Universality and Language Inclusion for Open and Closed Timed Automata. [Citation Graph (0, 0)][DBLP]
    HSCC, 2003, pp:375-388 [Conf]
  7. Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, James Worrell
    Decidability and Complexity Results for Timed Automata via Channel Machines. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1089-1101 [Conf]
  8. Franck van Breugel, James Worrell
    Towards Quantitative Verification of Probabilistic Transition Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:421-432 [Conf]
  9. Franck van Breugel, Claudio Hermida, Michael Makkai, James Worrell
    An Accessible Approach to Behavioural Pseudometrics. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1018-1030 [Conf]
  10. Franck van Breugel, Steven Shalit, James Worrell
    Testing Labelled Markov Processes. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:537-548 [Conf]
  11. Keye Martin, Michael W. Mislove, James Worrell
    Measuring the Probabilistic Powerdomain. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:463-475 [Conf]
  12. Peter Johnstone, John Power, Toru Tsujishita, Hiroshi Watanabe, James Worrell
    An Axiomatics for Categories of Transition Systems as Coalgebras. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:207-213 [Conf]
  13. Joël Ouaknine, James Worrell
    Revisiting Digitization, Robustness, and Decidability for Timed Automata. [Citation Graph (0, 0)][DBLP]
    LICS, 2003, pp:198-207 [Conf]
  14. Joël Ouaknine, James Worrell
    On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:54-63 [Conf]
  15. Joël Ouaknine, James Worrell
    On the Decidability of Metric Temporal Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 2005, pp:188-197 [Conf]
  16. Joël Ouaknine, James Worrell
    Safety Metric Temporal Logic Is Fully Decidable. [Citation Graph (0, 0)][DBLP]
    TACAS, 2006, pp:411-425 [Conf]
  17. Michael W. Mislove, Joël Ouaknine, James Worrell
    Axioms for Probability and Nondeterminism. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:96, n:, pp:7-28 [Journal]
  18. Joël Ouaknine, James Worrell
    Timed CSP = Closed Timed Safety Automata. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:68, n:2, pp:- [Journal]
  19. James Worrell
    Coinduction for recursive data types: partial orders, metric spaces and Omega-categories. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:33, n:, pp:- [Journal]
  20. James Worrell
    A Note on Coalgebras and Presheaves. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:65, n:1, pp:- [Journal]
  21. James Worrell
    Toposes of Coalgebras and Hidden Algebras. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1998, v:11, n:, pp:- [Journal]
  22. James Worrell
    Terminal sequences for accessible endofunctors. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:19, n:, pp:- [Journal]
  23. Michael W. Mislove, Dusko Pavlovic, James Worrell
    Labelled Markov Processes as Generalised Stochastic Relations. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:172, n:, pp:459-478 [Journal]
  24. James Worrell
    A note on coalgebras and presheaves. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2005, v:15, n:3, pp:475-483 [Journal]
  25. Joël Ouaknine, James Worrell
    Timed CSP = Closed Timed epsilon-automata. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2003, v:10, n:2, pp:99-133 [Journal]
  26. Franck van Breugel, Michael W. Mislove, Joël Ouaknine, James Worrell
    Domain theory, testing and simulation for labelled Markov processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:333, n:1-2, pp:171-197 [Journal]
  27. Franck van Breugel, James Worrell
    A behavioural pseudometric for probabilistic transition systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:331, n:1, pp:115-142 [Journal]
  28. Franck van Breugel, James Worrell
    Approximating and computing behavioural distances in probabilistic transition systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:360, n:1-3, pp:373-385 [Journal]
  29. Peter Johnstone, John Power, Toru Tsujishita, Hiroshi Watanabe, James Worrell
    On the structure of categories of coalgebras. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:260, n:1-2, pp:87-117 [Journal]
  30. Keye Martin, Michael W. Mislove, James Worrell
    Measuring the probabilistic powerdomain. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:312, n:1, pp:99-119 [Journal]
  31. James Worrell
    On the final sequence of a finitary set functor. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:338, n:1-3, pp:184-199 [Journal]
  32. Ranko Lazic, Thomas Christopher Newcomb, Joël Ouaknine, A. W. Roscoe, James Worrell
    Nets with Tokens Which Carry Data. [Citation Graph (0, 0)][DBLP]
    ICATPN, 2007, pp:301-320 [Conf]
  33. Sara Adams, Joël Ouaknine, James Worrell
    Undecidability of Universality for Timed Automata with Minimal Resources. [Citation Graph (0, 0)][DBLP]
    FORMATS, 2007, pp:25-37 [Conf]
  34. Franck van Breugel, Babita Sharma, James Worrell
    Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2007, pp:123-137 [Conf]
  35. Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell
    The Cost of Punctuality. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:109-120 [Conf]
  36. Parosh Aziz Abdulla, Joël Ouaknine, Karin Quaas, James Worrell
    Zone-Based Universality Analysis for Single-Clock Timed Automata. [Citation Graph (0, 0)][DBLP]
    FSEN, 2007, pp:98-112 [Conf]
  37. Joël Ouaknine, James Worrell
    On the decidability and complexity of Metric Temporal Logic over finite words [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  38. Franck van Breugel, Claudio Hermida, Michael Makkai, James Worrell
    Recursively defined metric spaces without contraction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:1-2, pp:143-163 [Journal]

  39. Time-Bounded Verification. [Citation Graph (, )][DBLP]


  40. Reachability in Succinct and Parametric One-Counter Automata. [Citation Graph (, )][DBLP]


  41. Some Recent Results in Metric Temporal Logic. [Citation Graph (, )][DBLP]


  42. On Expressiveness and Complexity in Real-Time Model Checking. [Citation Graph (, )][DBLP]


  43. Model Checking Succinct and Parametric One-Counter Automata. [Citation Graph (, )][DBLP]


  44. Towards a Theory of Time-Bounded Verification. [Citation Graph (, )][DBLP]


  45. Alternating Timed Automata over Bounded Time. [Citation Graph (, )][DBLP]


  46. Model Checking and Decision Procedures for Probabilistic Automata and Markov Chains. [Citation Graph (, )][DBLP]


  47. On Termination for Faulty Channel Machines. [Citation Graph (, )][DBLP]


  48. On Automated Verification of Probabilistic Programs. [Citation Graph (, )][DBLP]


  49. Real-Time Model Checking: Algorithms and Complexity. [Citation Graph (, )][DBLP]


  50. On Termination for Faulty Channel Machines [Citation Graph (, )][DBLP]


  51. Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002