- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j25 |      | Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: On the Complexity of Equivalence and Minimisation for Q-weighted Automata. Logical Methods in Computer Science 9(1) (2013) |
| c57 | | Michael Benedikt, Rastislav Lenhardt, James Worrell: LTL Model Checking of Interval Markov Chains. TACAS 2013: 32-46 |
| i15 | | Ventsislav Chonev, Joël Ouaknine, James Worrell: The Orbit Problem in Higher Dimensions. CoRR abs/1303.2981 (2013) |
| i14 | | Michael Benedikt, Rastislav Lenhardt, James Worrell: Two Variable vs. Linear Temporal Logic in Model Checking and Games. CoRR abs/1303.4533 (2013) |
| i13 | | |
| i12 | | Saguy Benaim, Michael Benedikt, Rastislav Lenhardt, James Worrell: Controlling the Depth, Size, and Number of Subtrees for Two-variable Logic on Trees. CoRR abs/1304.6925 (2013) |
| i11 | | Joël Ouaknine, Hristina Palikareva, A. W. Roscoe, James Worrell: A Static Analysis Framework for Livelock Freedom in CSP. CoRR abs/1304.7394 (2013) |
| 2012 | ||
| j24 | | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell: On termination and invariance for faulty channel machines. Formal Asp. Comput. 24(4-6): 595-607 (2012) |
| j23 | | Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: Three tokens in Herman's algorithm. Formal Asp. Comput. 24(4-6): 671-678 (2012) |
| j22 | | 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) |
| c56 | | Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: APEX: An Analyzer for Open Probabilistic Programs. CAV 2012: 693-698 |
| c55 | | Philip J. Armstrong, Michael Goldsmith, Gavin Lowe, Joël Ouaknine, Hristina Palikareva, A. W. Roscoe, James Worrell: Recent Developments in FDR. CAV 2012: 699-704 |
| c54 | | Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell: Branching-Time Model Checking of Parametric One-Counter Automata. FoSSaCS 2012: 406-420 |
| c53 | | Di Chen, Franck van Breugel, James Worrell: On the Complexity of Computing Probabilistic Bisimilarity. FoSSaCS 2012: 437-451 |
| c52 | | 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 |
| c51 | | Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell: Bisimilarity of Probabilistic Pushdown Automata. FSTTCS 2012: 448-460 |
| c50 | | Daniel Bundala, Joël Ouaknine, James Worrell: On the Magnitude of Completeness Thresholds in Bounded Model Checking. LICS 2012: 155-164 |
| c49 | | Michael Benedikt, Rastislav Lenhardt, James Worrell: Verification of Two-Variable Logic Revisited. QEST 2012: 114-123 |
| c48 | | |
| c47 | | Christoph Haase, Joël Ouaknine, James Worrell: On the Relationship between Reachability Problems in Timed and Counter Automata. RP 2012: 54-65 |
| i10 | | Paul Hunter, Joël Ouaknine, James Worrell: Expressive Completeness of Metric Temporal Logic. CoRR abs/1208.4993 (2012) |
| i9 | | Paul Hunter, Joël Ouaknine, James Worrell: When is Metric Temporal Logic Expressively Complete? CoRR abs/1209.0516 (2012) |
| i8 | | Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell: Bisimilarity of Probabilistic Pushdown Automata. CoRR abs/1210.2273 (2012) |
| i7 | | Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell: Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints. CoRR abs/1211.1276 (2012) |
| 2011 | ||
| c46 | | Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: Language Equivalence for Probabilistic Automata. CAV 2011: 526-540 |
| c45 | | Daniel Kroening, Joël Ouaknine, Ofer Strichman, Thomas Wahl, James Worrell: Linear Completeness Thresholds for Bounded Model Checking. CAV 2011: 557-572 |
| c44 | | Byron Cook, Christoph Haase, Joël Ouaknine, Matthew J. Parkinson, James Worrell: Tractable Reasoning in a Fragment of Separation Logic. CONCUR 2011: 235-249 |
| c43 | | Joël Ouaknine, Hristina Palikareva, A. W. Roscoe, James Worrell: Static Livelock Analysis in CSP. CONCUR 2011: 389-403 |
| c42 | | Michael Benedikt, Rastislav Lenhardt, James Worrell: Two Variable vs. Linear Temporal Logic in Model Checking and Games. CONCUR 2011: 497-511 |
| c41 | | Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell: The Church Synthesis Problem with Metric. CSL 2011: 307-321 |
| c40 | | 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 |
| c39 | | Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang: On Stabilization in Herman's Algorithm. ICALP (2) 2011: 466-477 |
| i6 | | Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang: On Stabilization in Herman's Algorithm. CoRR abs/1104.3100 (2011) |
| i5 | | 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) |
| i4 | | 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 | ||
| c38 | | Paul Hunter, Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell: Computing Rational Radical Sums in Uniform TC^0. FSTTCS 2010: 308-316 |
| c37 | | |
| c36 | | Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell: Model Checking Succinct and Parametric One-Counter Automata. ICALP (2) 2010: 575-586 |
| c35 | | Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell: Alternating Timed Automata over Bounded Time. LICS 2010: 60-69 |
| 2009 | ||
| c34 | | Christoph Haase, Stephan Kreutzer, Joël Ouaknine, James Worrell: Reachability in Succinct and Parametric One-Counter Automata. CONCUR 2009: 369-383 |
| c33 | | |
| 2008 | ||
| j21 | | 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) |
| j20 | | 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) |
| j19 | | Kevin P. Gallagher, James Worrell: Organizing IT to promote agility. Information Technology and Management 9(1): 71-88 (2008) |
| j18 | | Franck van Breugel, Babita Sharma, James Worrell: Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems. Logical Methods in Computer Science 4(2) (2008) |
| c32 | | |
| c31 | | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell: On Expressiveness and Complexity in Real-Time Model Checking. ICALP (2) 2008: 124-135 |
| c30 | | James Worrell: Model Checking and Decision Procedures for Probabilistic Automata and Markov Chains. QEST 2008: 322 |
| c29 | | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell: On Termination for Faulty Channel Machines. STACS 2008: 121-132 |
| c28 | | Axel Legay, Andrzej S. Murawski, Joël Ouaknine, James Worrell: On Automated Verification of Probabilistic Programs. TACAS 2008: 173-187 |
| c27 | | |
| i3 | | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell: On Termination for Faulty Channel Machines. CoRR abs/0802.2839 (2008) |
| i2 | | Franck van Breugel, Babita Sharma, James Worrell: Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems. CoRR abs/0803.3796 (2008) |
| 2007 | ||
| j17 | | Michael W. Mislove, Dusko Pavlovic, James Worrell: Labelled Markov Processes as Generalised Stochastic Relations. Electr. Notes Theor. Comput. Sci. 172: 459-478 (2007) |
| j16 | | 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) |
| j15 | | Franck van Breugel, Claudio Hermida, Michael Makkai, James Worrell: Recursively defined metric spaces without contraction. Theor. Comput. Sci. 380(1-2): 143-163 (2007) |
| c26 | | Robert Hooker, Carmen Lewis, Molly Wasko, James Worrell, Tom E. Yoon: Network Governance in the E-Lance Economy. AMCIS 2007: 219 |
| c25 | | James Worrell: An Investigation of the Effects of ERP Post-Implementation Support Structure on ERP/Business Unit Fit. AMCIS 2007: 386 |
| c24 | | James Worrell, Ashley A. Bush: Perceptions of Information Technology Risk: A Delphi Study. AMCIS 2007: 446 |
| c23 | | Ranko Lazic, Thomas Christopher Newcomb, Joël Ouaknine, A. W. Roscoe, James Worrell: Nets with Tokens Which Carry Data. ICATPN 2007: 301-320 |
| c22 | | Sara Adams, Joël Ouaknine, James Worrell: Undecidability of Universality for Timed Automata with Minimal Resources. FORMATS 2007: 25-37 |
| c21 | | Franck van Breugel, Babita Sharma, James Worrell: Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems. FoSSaCS 2007: 123-137 |
| c20 | | Parosh Aziz Abdulla, Joël Ouaknine, Karin Quaas, James Worrell: Zone-Based Universality Analysis for Single-Clock Timed Automata. FSEN 2007: 98-112 |
| c19 | | James Worrell: Enhancing ERP/Business Fit in the Post-Implementation Phase: A Knowledge-Based Perspective. ICIS 2007: 68 |
| c18 | | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell: The Cost of Punctuality. LICS 2007: 109-120 |
| i1 | | Joël Ouaknine, James Worrell: On the decidability and complexity of Metric Temporal Logic over finite words. CoRR abs/cs/0702120 (2007) |
| 2006 | ||
| j14 | | Franck van Breugel, James Worrell: Approximating and computing behavioural distances in probabilistic transition systems. Theor. Comput. Sci. 360(1-3): 373-385 (2006) |
| c17 | | Dusko Pavlovic, Michael W. Mislove, James Worrell: Testing Semantics: Connecting Processes and Process Logics. AMAST 2006: 308-322 |
| c16 | | James Worrell, Kevin P. Gallagher, Robert M. Mason: Understanding the Structure of Post-Implementation ERP Teams. AMCIS 2006: 307 |
| c15 | | Joël Ouaknine, James Worrell: On Metric Temporal Logic and Faulty Turing Machines. FoSSaCS 2006: 217-230 |
| c14 | | |
| 2005 | ||
| j13 | | James Worrell: A note on coalgebras and presheaves. Mathematical Structures in Computer Science 15(3): 475-483 (2005) |
| j12 | | Franck van Breugel, James Worrell: A behavioural pseudometric for probabilistic transition systems. Theor. Comput. Sci. 331(1): 115-142 (2005) |
| j11 | | 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) |
| j10 | | James Worrell: On the final sequence of a finitary set functor. Theor. Comput. Sci. 338(1-3): 184-199 (2005) |
| c13 | | Franck van Breugel, Claudio Hermida, Michael Makkai, James Worrell: An Accessible Approach to Behavioural Pseudometrics. ICALP 2005: 1018-1030 |
| c12 | | Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, James Worrell: Decidability and Complexity Results for Timed Automata via Channel Machines. ICALP 2005: 1089-1101 |
| c11 | | |
| 2004 | ||
| j9 | | Michael W. Mislove, Joël Ouaknine, James Worrell: Axioms for Probability and Nondeterminism. Electr. Notes Theor. Comput. Sci. 96: 7-28 (2004) |
| j8 | | Keye Martin, Michael W. Mislove, James Worrell: Measuring the probabilistic powerdomain. Theor. Comput. Sci. 312(1): 99-119 (2004) |
| c10 | | Michael W. Mislove, Joël Ouaknine, Dusko Pavlovic, James Worrell: Duality for Labelled Markov Processes. FoSSaCS 2004: 393-407 |
| c9 | | Joël Ouaknine, James Worrell: On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap. LICS 2004: 54-63 |
| 2003 | ||
| j7 |  | Joël Ouaknine, James Worrell: Timed CSP = Closed Timed epsilon-automata. Nord. J. Comput. 10(2): 99-133 (2003) |
| c8 | | Franck van Breugel, Michael W. Mislove, Joël Ouaknine, James Worrell: An Intrinsic Characterization of Approximate Probabilistic Bisimilarity. FoSSaCS 2003: 200-215 |
| c7 | | Joël Ouaknine, James Worrell: Universality and Language Inclusion for Open and Closed Timed Automata. HSCC 2003: 375-388 |
| c6 | | Joël Ouaknine, James Worrell: Revisiting Digitization, Robustness, and Decidability for Timed Automata. LICS 2003: 198-207 |
| 2002 | ||
| j6 | | James Worrell: A Note on Coalgebras and Presheaves. Electr. Notes Theor. Comput. Sci. 65(1): 358-364 (2002) |
| j5 | | Joël Ouaknine, James Worrell: Timed CSP = Closed Timed Safety Automata. Electr. Notes Theor. Comput. Sci. 68(2): 142-159 (2002) |
| c5 | | Keye Martin, Michael W. Mislove, James Worrell: Measuring the Probabilistic Powerdomain. ICALP 2002: 463-475 |
| c4 | | Franck van Breugel, Steven Shalit, James Worrell: Testing Labelled Markov Processes. ICALP 2002: 537-548 |
| 2001 | ||
| j4 | | 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) |
| c3 | | Franck van Breugel, James Worrell: An Algorithm for Quantitative Verification of Probabilistic Transition Systems. CONCUR 2001: 336-350 |
| c2 | | Franck van Breugel, James Worrell: Towards Quantitative Verification of Probabilistic Transition Systems. ICALP 2001: 421-432 |
| 2000 | ||
| j3 | | James Worrell: Coinduction for recursive data types: partial orders, metric spaces and Omega-categories. Electr. Notes Theor. Comput. Sci. 33: 337-356 (2000) |
| 1999 | ||
| j2 | | James Worrell: Terminal sequences for accessible endofunctors. Electr. Notes Theor. Comput. Sci. 19: 24-38 (1999) |
| 1998 | ||
| j1 | | James Worrell: Toposes of Coalgebras and Hidden Algebras. Electr. Notes Theor. Comput. Sci. 11: 212-230 (1998) |
| c1 | | Peter Johnstone, John Power, Toru Tsujishita, Hiroshi Watanabe, James Worrell: An Axiomatics for Categories of Transition Systems as Coalgebras. LICS 1998: 207-213 |
Colors in the list of coauthors
Last update Sun May 26 04:21:39 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page