| 2012 | ||
|---|---|---|
| 76 | Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell: Branching-Time Model Checking of Parametric One-Counter Automata. FoSSaCS 2012: 406-420 | |
| 75 | Di Chen, Franck van Breugel, James Worrell: On the Complexity of Computing Probabilistic Bisimilarity. FoSSaCS 2012: 437-451 | |
| 74 | Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: On the Complexity of the Equivalence Problem for Probabilistic Automata. FoSSaCS 2012: 467-481 | |
| 73 | Kevin P. Gallagher, James Worrell, Robert M. Mason: The negotiation and selection of horizontal mechanisms to support post-implementation ERP organizations. IT & People 25(1): 4-30 (2012) | |
| 2011 | ||
| 72 | Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: Language Equivalence for Probabilistic Automata. CAV 2011: 526-540 | |
| 71 | Daniel Kroening, Joël Ouaknine, Ofer Strichman, Thomas Wahl, James Worrell: Linear Completeness Thresholds for Bounded Model Checking. CAV 2011: 557-572 | |
| 70 | Byron Cook, Christoph Haase, Joël Ouaknine, Matthew J. Parkinson, James Worrell: Tractable Reasoning in a Fragment of Separation Logic. CONCUR 2011: 235-249 | |
| 69 | Joël Ouaknine, Hristina Palikareva, A. W. Roscoe, James Worrell: Static Livelock Analysis in CSP. CONCUR 2011: 389-403 | |
| 68 | Michael Benedikt, Rastislav Lenhardt, James Worrell: Two Variable vs. Linear Temporal Logic in Model Checking and Games. CONCUR 2011: 497-511 | |
| 67 | Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell: The Church Synthesis Problem with Metric. CSL 2011: 307-321 | |
| 66 | Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell: On Reachability for Hybrid Automata over Bounded Time. ICALP (2) 2011: 416-427 | |
| 65 | Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang: On Stabilization in Herman's Algorithm. ICALP (2) 2011: 466-477 | |
| 64 | Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang: On Stabilization in Herman's Algorithm CoRR abs/1104.3100: (2011) | |
| 63 | Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell: On Reachability for Hybrid Automata over Bounded Time CoRR abs/1104.5335: (2011) | |
| 62 | Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: On the Complexity of the Equivalence Problem for Probabilistic Automata CoRR abs/1112.4644: (2011) | |
| 2010 | ||
| 61 | Paul Hunter, Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell: Computing Rational Radical Sums in Uniform TC^0. FSTTCS 2010: 308-316 | |
| 60 | Joël Ouaknine, James Worrell: Towards a Theory of Time-Bounded Verification. ICALP (2) 2010: 22-37 | |
| 59 | Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell: Model Checking Succinct and Parametric One-Counter Automata. ICALP (2) 2010: 575-586 | |
| 58 | Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell: Alternating Timed Automata over Bounded Time. LICS 2010: 60-69 | |
| 2009 | ||
| 57 | Christoph Haase, Stephan Kreutzer, Joël Ouaknine, James Worrell: Reachability in Succinct and Parametric One-Counter Automata. CONCUR 2009: 369-383 | |
| 56 | Joël Ouaknine, Alexander Rabinovich, James Worrell: Time-Bounded Verification. CONCUR 2009: 496-510 | |
| 2008 | ||
| 55 | Joël Ouaknine, James Worrell: Some Recent Results in Metric Temporal Logic. FORMATS 2008: 1-13 | |
| 54 | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell: On Expressiveness and Complexity in Real-Time Model Checking. ICALP (2) 2008: 124-135 | |
| 53 | James Worrell: Model Checking and Decision Procedures for Probabilistic Automata and Markov Chains. QEST 2008: 322 | |
| 52 | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell: On Termination for Faulty Channel Machines. STACS 2008: 121-132 | |
| 51 | Axel Legay, Andrzej S. Murawski, Joël Ouaknine, James Worrell: On Automated Verification of Probabilistic Programs. TACAS 2008: 173-187 | |
| 50 | James Worrell: Real-Time Model Checking: Algorithms and Complexity. TIME 2008: 19 | |
| 49 | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell: On Termination for Faulty Channel Machines CoRR abs/0802.2839: (2008) | |
| 48 | Franck van Breugel, Babita Sharma, James Worrell: Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems CoRR abs/0803.3796: (2008) | |
| 47 | 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) | |
| 46 | 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) | |
| 45 | 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 | ||
| 44 | Robert Hooker, Carmen Lewis, Molly Wasko, James Worrell, Tom E. Yoon: Network Governance in the E-Lance Economy. AMCIS 2007: 219 | |
| 43 | James Worrell: An Investigation of the Effects of ERP Post-Implementation Support Structure on ERP/Business Unit Fit. AMCIS 2007: 386 | |
| 42 | James Worrell, Ashley A. Bush: Perceptions of Information Technology Risk: A Delphi Study. AMCIS 2007: 446 | |
| 41 | Sara Adams, Joël Ouaknine, James Worrell: Undecidability of Universality for Timed Automata with Minimal Resources. FORMATS 2007: 25-37 | |
| 40 | Parosh Aziz Abdulla, Joël Ouaknine, Karin Quaas, James Worrell: Zone-Based Universality Analysis for Single-Clock Timed Automata. FSEN 2007: 98-112 | |
| 39 | Franck van Breugel, Babita Sharma, James Worrell: Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems. FoSSaCS 2007: 123-137 | |
| 38 | Ranko Lazic, Thomas Christopher Newcomb, Joël Ouaknine, A. W. Roscoe, James Worrell: Nets with Tokens Which Carry Data. ICATPN 2007: 301-320 | |
| 37 | James Worrell: Enhancing ERP/Business Fit in the Post-Implementation Phase: A Knowledge-Based Perspective. ICIS 2007: 68 | |
| 36 | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell: The Cost of Punctuality. LICS 2007: 109-120 | |
| 35 | Joël Ouaknine, James Worrell: On the decidability and complexity of Metric Temporal Logic over finite words CoRR abs/cs/0702120: (2007) | |
| 34 | Michael W. Mislove, Dusko Pavlovic, James Worrell: Labelled Markov Processes as Generalised Stochastic Relations. Electr. Notes Theor. Comput. Sci. 172: 459-478 (2007) | |
| 33 | 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) | |
| 32 | 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 | ||
| 31 | Dusko Pavlovic, Michael W. Mislove, James Worrell: Testing Semantics: Connecting Processes and Process Logics. AMAST 2006: 308-322 | |
| 30 | James Worrell, Kevin P. Gallagher, Robert M. Mason: Understanding the Structure of Post-Implementation ERP Teams. AMCIS 2006: 307 | |
| 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): 358-364 (2002) | |
| 8 | Joël Ouaknine, James Worrell: Timed CSP = Closed Timed Safety Automata. Electr. Notes Theor. Comput. Sci. 68(2): 142-159 (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: 337-356 (2000) | |
| 1999 | ||
| 3 | James Worrell: Terminal sequences for accessible endofunctors. Electr. Notes Theor. Comput. Sci. 19: 24-38 (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: 212-230 (1998) | |
Colors in the list of coauthors
Last update Sat May 26 02:31:23 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page