James Worrell

发表

Reachability Problems for Continuous Linear Dynamical Systems (Invited Paper)

James Worrell, 2015, CONCUR.

Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points

Joël Ouaknine, James Worrell, Jean-François Raskin, 2013, ATVA.

Coinduction for recursive data types: partial orders, metric spaces and Omega-categories

James Worrell, J. Worrell, 2000, CMCS.

Model Checking Succinct and Parametric One-Counter Automata

Joël Ouaknine, James Worrell, Christoph Haase, 2010, ICALP.

Decision Problems for Linear Recurrence Sequences

Joël Ouaknine, James Worrell, 2012, RP.

Measuring the probabilistic powerdomain

James Worrell, Michael W. Mislove, Keye Martin, 2004, Theor. Comput. Sci..

Toposes of Coalgebras and Hidden Algebras

James Worrell, 1998, CMCS.

On termination and invariance for faulty channel machines

Philippe Schnoebelen, Joël Ouaknine, James Worrell, 2012, Formal Aspects of Computing.

Effective Divergence Analysis for Linear Recurrence Sequences

Joël Ouaknine, James Worrell, Shaull Almagor, 2018, CONCUR.

James Worrell, Stefan Kiefer, Petr Jancar, 2012, FSTTCS.

Testing Semantics: Connecting Processes and Process Logics

James Worrell, Michael W. Mislove, Dusko Pavlovic, 2006, AMAST.

Revisiting digitization, robustness, and decidability for timed automata

Joël Ouaknine, James Worrell, J. Worrell, 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

On Rationality of Nonnegative Matrix Factorization

James Worrell, Stefan Kiefer, Mahsa Shirmohammadi, 2017, SODA.

An accessible approach to behavioural pseudometrics : With an application to probabilistic systems

James Worrell, Claudio Hermida, Franck van Breugel, 2005 .

The Cost of Punctuality

Joël Ouaknine, James Worrell, Patricia Bouyer, 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

Probabilistic Automata of Bounded Ambiguity

James Worrell, Cristian Riveros, Nathanaël Fijalkow, 2020, CONCUR.

Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences pdf

Joël Ouaknine, James Worrell, J. Ouaknine, 2013, ICALP.

Proceedings of the 27th International Conference on Concurrency Theory (CONCUR 2016)

Joël Ouaknine, James Worrell, Amaury Pouly, 2016, CONCUR 2016.

Language equivalence of probabilistic pushdown automata

James Worrell, Stefan Kiefer, Petr Jancar, 2014, Inf. Comput..

On the Magnitude of Completeness Thresholds in Bounded Model Checking

Joël Ouaknine, James Worrell, Daniel Bundala, 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

On Ranking Function Synthesis and Termination for Polynomial Programs

James Worrell, Eike Neumann, Joël Ouaknine, 2020, CONCUR.

Complexity of equivalence and learning for multiplicity tree automata pdf

James Worrell, Ines Marusic, 2014, J. Mach. Learn. Res..

Revisiting the Equivalence Problem for Finite Multitape Automata

James Worrell, 2013, ICALP.

On the Complexity of Linear Arithmetic with Divisibility

Joël Ouaknine, James Worrell, Antonia Lechner, 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

On the Decidability of the Bounded Continuous Skolem Problem pdf

Joël Ouaknine, James Worrell, Ventsislav Chonev, 2015, ArXiv.

An axiomatics for categories of transition systems as coalgebras

James Worrell, John Power, Hiroshi Watanabe, 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

Timed CSP = closed timed ε-automata

Joël Ouaknine, James Worrell, J. Ouaknine, 2003 .

Testing Labelled Markov Processes

James Worrell, Franck van Breugel, Steven Shalit, 2002, ICALP.

Recent Developments in FDR

Joël Ouaknine, James Worrell, Michael Goldsmith, 2012, CAV.

Recursively defined metric spaces without contraction

James Worrell, Claudio Hermida, Franck van Breugel, 2007, Theor. Comput. Sci..

On the Positivity Problem for Simple Linear Recurrence Sequences,

Joël Ouaknine, James Worrell, J. Ouaknine, 2013, ICALP.

Timed CSP = Closed Timed epsilon-automata

Joël Ouaknine, James Worrell, J. Ouaknine, 2003, Nordic Journal of Computing.

On the Complexity of the Orbit Problem

Joël Ouaknine, James Worrell, Ventsislav Chonev, 2013, J. ACM.

Zone-based universality analysis for single-clock timed automata

Parosh Aziz Abdulla, Joël Ouaknine, James Worrell, 2007, FSEN'07.

Computing Rational Radical Sums in Uniform TC^0

Joël Ouaknine, James Worrell, Patricia Bouyer, 2010, FSTTCS.

On the Complexity of Computing Probabilistic Bisimilarity

James Worrell, Di Chen, Franck van Breugel, 2012, FoSSaCS.

On the language inclusion problem for timed automata: closing a decidability gap

Joël Ouaknine, James Worrell, J. Ouaknine, 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

APEX: An Analyzer for Open Probabilistic Programs

Joël Ouaknine, James Worrell, Andrzej S. Murawski, 2012, CAV.

Reachability Problems for Continuous Linear Dynamical Systems (Invited Talk)

James Worrell, J. Worrell, 2015, Foundations of Software Technology and Theoretical Computer Science.

Deciding ω-regular properties on linear recurrence sequences

Joël Ouaknine, James Worrell, Shaull Almagor, 2020, Proc. ACM Program. Lang..

Decidability and Complexity Results for Timed Automata via Channel Machines

Parosh Aziz Abdulla, Joël Ouaknine, James Worrell, 2005, ICALP.

Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints pdf

Joël Ouaknine, James Worrell, Jean-François Raskin, 2012, ArXiv.

Three tokens in Herman’s algorithm

Joël Ouaknine, James Worrell, Andrzej S. Murawski, 2012, Formal Aspects of Computing.

Two Variable vs. Linear Temporal Logic in Model Checking and Games

James Worrell, Michael Benedikt, Rastislav Lenhardt, 2011, CONCUR.

Timed Temporal Logics

Joël Ouaknine, James Worrell, Patricia Bouyer, 2017, Models, Algorithms, Logics and Tools.

Language Equivalence for Probabilistic Automata

Joël Ouaknine, James Worrell, Andrzej S. Murawski, 2011, CAV.

On the Complexity of Multitape Automata Equivalence pdf

James Worrell, J. Worrell, 2013, arXiv.org.

On the Decidability of the Continuous Infinite Zeros Problem pdf

Joël Ouaknine, James Worrell, Ventsislav Chonev, 2015, ArXiv.

Controlling the Depth, Size, and Number of Subtrees for Two-variable Logic on Trees pdf

James Worrell, Michael Benedikt, Rastislav Lenhardt, 2013, ArXiv.

Expressive Completeness for Metric Temporal Logic

Joël Ouaknine, James Worrell, Paul Hunter, 2012, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

On the Complexity of the Equivalence Problem for Probabilistic Automata pdf

Joël Ouaknine, James Worrell, Andrzej S. Murawski, 2011, FoSSaCS.

Alternating Timed Automata over Bounded Time

Joël Ouaknine, James Worrell, Alexander Moshe Rabinovich, 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem

Joël Ouaknine, James Worrell, Pierre Ohlmann, 2017, STACS.

On the final sequence of a finitary set functor

James Worrell, J. Worrell, 2005, Theor. Comput. Sci..

Algorithmic probabilistic game semantics

Joël Ouaknine, James Worrell, Andrzej S. Murawski, 2013, Formal Methods Syst. Des..

Termination of Linear Loops over the Integers

James Worrell, Mehran Hosseini, Joel Ouaknine, 2019, ICALP.

Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem

Joël Ouaknine, James Worrell, Pierre Ohlmann, 2019, Theory of Computing Systems.

Tractable Reasoning in a Fragment of Separation Logic

Joël Ouaknine, James Worrell, Matthew J. Parkinson, 2011, CONCUR.

Towards Quantitative Verification of Probabilistic Transition Systems

James Worrell, Franck van Breugel, 2001, ICALP.

Addendum to "Recursively defined metric spaces without contraction" [TCS 380 (1/2) (2007) 143-163]

James Worrell, Claudio Hermida, Franck van Breugel, 2013, Theor. Comput. Sci..

Three Variables are Enough for Real-Time Specification pdf

James Worrell, Paul Hunter, Timos Antonopoulos, 2014, ArXiv.

Verification of Two-Variable Logic Revisited

James Worrell, Michael Benedikt, Rastislav Lenhardt, 2012, 2012 Ninth International Conference on Quantitative Evaluation of Systems.

Reachability Problems 2014: Special issue

Joël Ouaknine, James Worrell, Igor Potapov, 2018, Theoretical Computer Science.

Towards a Theory of Time-Bounded Verification

Joël Ouaknine, James Worrell, J. Worrell, 2010, ICALP.

An Accessible Approach to Behavioural Pseudometrics

James Worrell, Claudio Hermida, Franck van Breugel, 2005, ICALP.

On the Relationship between Reachability Problems in Timed and Counter Automata

Joël Ouaknine, James Worrell, Christoph Haase, 2012, RP.

Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata

James Worrell, Stefan Kiefer, Petr Jancar, 2018, Log. Methods Comput. Sci..

On the Expressiveness and Monitoring of Metric Temporal Logic pdf

Joël Ouaknine, James Worrell, Hsi-Ming Ho, 2019, Log. Methods Comput. Sci..

Measuring the probabilistic powerdomain

James Worrell, Michael W. Mislove, Keye Martin, 2002, Theoretical Computer Science.

Zeno, Hercules, and the Hydra

Joël Ouaknine, James Worrell, Ranko Lazic, 2016, ACM Trans. Comput. Log..

The orbit problem in higher dimensions pdf

Joël Ouaknine, James Worrell, Ventsislav Chonev, 2013, STOC '13.

Domain theory, testing and simulation for labelled Markov processes

Joël Ouaknine, James Worrell, Michael W. Mislove, 2005, Theor. Comput. Sci..

Solvability of Matrix-Exponential Equations

Joël Ouaknine, João Sousa Pinto, James Worrell, 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK

James Worrell, Igor Potapov, Paul Spirakis, 2018, MFCS.

Safety Metric Temporal Logic Is Fully Decidable

Joël Ouaknine, James Worrell, J. Ouaknine, 2006, TACAS.

On the Skolem Problem for Continuous Linear Dynamical Systems

Joël Ouaknine, James Worrell, Ventsislav Chonev, 2015, ICALP.

The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata

James Worrell, Franck van Breugel, J. Worrell, 2014, Horizons of the Mind.

On the decidability of metric temporal logic

Joël Ouaknine, James Worrell, J. Ouaknine, 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

Nonnegative Matrix Factorization Requires Irrationality

James Worrell, Stefan Kiefer, Mahsa Shirmohammadi, 2017, SIAM J. Appl. Algebra Geom..

Terminal sequences for accessible endofunctors

James Worrell, J. Worrell, 1999, CMCS.

Undecidability of Universality for Timed Automata with Minimal Resources

Joël Ouaknine, James Worrell, Sara Adams, 2007, FORMATS.

On Reachability for Hybrid Automata over Bounded Time pdf

Joël Ouaknine, James Worrell, Jean-François Raskin, 2011, ICALP.

Relating Reachability Problems in Timed and Counter Automata

Joël Ouaknine, James Worrell, Christoph Haase, 2016, Fundam. Informaticae.

Reachability in Succinct and Parametric One-Counter Automata

Joël Ouaknine, James Worrell, Stephan Kreutzer, 2009, CONCUR.

On the Complexity of Equivalence and Minimisation for Q-weighted Automata

Joël Ouaknine, James Worrell, Andrzej S. Murawski, 2013, Log. Methods Comput. Sci..

Model Checking Flat Freeze LTL on One-Counter Automata

Joël Ouaknine, James Worrell, Amaury Pouly, 2018, Log. Methods Comput. Sci..

Approximating and computing behavioural distances in probabilistic transition systems

James Worrell, Franck van Breugel, J. Worrell, 2006, Theor. Comput. Sci..

Model Checking Markov Chains Against Unambiguous Buchi Automata pdf

James Worrell, Michael Benedikt, Rastislav Lenhardt, 2014, ArXiv.

Some Recent Results in Metric Temporal Logic

Joël Ouaknine, James Worrell, J. Ouaknine, 2008, FORMATS.

Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems

James Worrell, Franck van Breugel, Babita Sharma, 2007, Log. Methods Comput. Sci..

On the Decidability of Membership in Matrix-exponential Semigroups

Joël Ouaknine, João Sousa Pinto, James Worrell, 2019, J. ACM.

Nets with Tokens which Carry Data

Joël Ouaknine, James Worrell, A. W. Roscoe, 2008, Fundam. Informaticae.

Online Monitoring of Metric Temporal Logic

Joël Ouaknine, James Worrell, Hsi-Ming Ho, 2014, RV.

Revisiting reachability in timed automata

James Worrell, Karin Quaas, Mahsa Shirmohammadi, 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

Two Variable vs. Linear Temporal Logic in Model Checking and Games

James Worrell, Michael Benedikt, Rastislav Lenhardt, 2011, CONCUR.

Complexity of Two-Variable Logic on Finite Trees

James Worrell, Witold Charatonik, Michael Benedikt, 2013, ACM Trans. Comput. Log..

Real-Time Model Checking: Algorithms and Complexity

James Worrell, 2008, 2008 15th International Symposium on Temporal Representation and Reasoning.

Effective Definability of the Reachability Relation in Timed Automata

James Worrell, Martin Fränzle, Karin Quaas, 2019, Inf. Process. Lett..

Labelled Markov Processes as Generalised Stochastic Relations

James Worrell, Michael W. Mislove, Dusko Pavlovic, 2007, Computation, Meaning, and Logic.

A Static Analysis Framework for Livelock Freedom in CSP

Joël Ouaknine, James Worrell, A. W. Roscoe, 2013, Log. Methods Comput. Sci..

On Stabilization in Herman's Algorithm

Joël Ouaknine, James Worrell, Lijun Zhang, 2011, ICALP.

A Note on Coalgebras and Presheaves

James Worrell, 2002, CMCS.

Timed CSP = Closed Timed Safety Automata

Joël Ouaknine, James Worrell, J. Ouaknine, 2002, EXPRESS.

Static Livelock Analysis in CSP

Joël Ouaknine, James Worrell, A. W. Roscoe, 2011, CONCUR.

The Zero Problem for Exponential Polynomials

James Worrell, 2017, ISSAC.

Polynomial Invariants for Affine Programs

Joël Ouaknine, James Worrell, Ehud Hrushovski, 2018, LICS.

Algebraic Invariants for Linear Hybrid Automata

Joël Ouaknine, James Worrell, Rupak Majumdar, 2020, CONCUR.

Markov Chains and Unambiguous Büchi Automata pdf

Christel Baier, James Worrell, Joachim Klein, 2016, CAV.

Model Checking Flat Freeze LTL on One-Counter Automata pdf

Joël Ouaknine, James Worrell, Amaury Pouly, 2016, CONCUR.

Positivity Problems for Low-Order Linear Recurrence Sequences pdf

Joël Ouaknine, James Worrell, J. Ouaknine, 2013, SODA.

LTL Model Checking of Interval Markov Chains

James Worrell, Michael Benedikt, Rastislav Lenhardt, 2013, TACAS.

The Semialgebraic Orbit Problem

Joël Ouaknine, James Worrell, Shaull Almagor, 2019, STACS.

Three Variables Suffice for Real-Time Logic

James Worrell, Paul Hunter, Timos Antonopoulos, 2015, FoSSaCS.

A behavioural pseudometric for probabilistic transition systems

James Worrell, Franck van Breugel, J. Worrell, 2005, Theor. Comput. Sci..

Proving the Herman-Protocol Conjecture

Joël Ouaknine, James Worrell, Radu Grigore, 2015, ICALP.

On Matrix Powering in Low Dimensions

Joël Ouaknine, James Worrell, Esther Galby, 2015, STACS.

On reachability problems for low dimensional matrix semigroups

Joël Ouaknine, James Worrell, Thomas Colcombet, 2019, International Colloquium on Automata, Languages and Programming.

Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems

James Worrell, Franck van Breugel, Babita Sharma, 2007, FoSSaCS.

On the decidability of reachability in linear time-invariant systems

Joël Ouaknine, João Sousa Pinto, James Worrell, 2018, HSCC.

On the structure of categories of coalgebras

James Worrell, John Power, Hiroshi Watanabe, 2001, Theor. Comput. Sci..

Coverability in 1-VASS with Disequality Tests pdf

James Worrell, Guillermo A. Pérez, Nathann Cohen, 2020, CONCUR.

Branching-Time Model Checking of Parametric One-Counter Automata

Joël Ouaknine, James Worrell, Christoph Haase, 2012, FoSSaCS.

On Expressiveness and Complexity in Real-Time Model Checking

Joël Ouaknine, James Worrell, Patricia Bouyer, 2008, ICALP.

The Polytope-Collision Problem

Joël Ouaknine, James Worrell, Shaull Almagor, 2017, ICALP.

Universality Analysis for One-Clock Timed Automata

Parosh Aziz Abdulla, Joël Ouaknine, James Worrell, 2009, Fundam. Informaticae.

On Automated Verification of Probabilistic Programs

Joël Ouaknine, James Worrell, Axel Legay, 2008, TACAS.

Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian

Joël Ouaknine, James Worrell, Ranko Lazic, 2013, MFCS.

Minimisation of Multiplicity Tree Automata

James Worrell, Stefan Kiefer, Ines Marusic, 2015, FoSSaCS.

An Algorithm for Quantitative Verification of Probabilistic Transition Systems

James Worrell, Franck van Breugel, J. Worrell, 2001, CONCUR.

Model-Checking for Real-Time Systems

Joël Ouaknine, James Worrell, Kim G. Larsen, 1995, FCT.

Polynomial automata: Zeroness and applications

James Worrell, Timothy Duff, Michael Benedikt, 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

On Restricted Nonnegative Matrix Factorization pdf

James Worrell, Stefan Kiefer, Mahsa Shirmohammadi, 2016, ICALP.

The Polyhedron-Hitting Problem pdf

Joël Ouaknine, James Worrell, Ventsislav Chonev, 2014, SODA.

Universality and Language Inclusion for Open and Closed Timed Automata

Joël Ouaknine, James Worrell, J. Ouaknine, 2003, HSCC.

On Process-Algebraic Extensions of Metric Temporal Logic

Joël Ouaknine, James Worrell, Christoph Haase, 2010, Reflections on the Work of C. A. R. Hoare.

O-Minimal Invariants for Linear Loops

Joël Ouaknine, James Worrell, Shaull Almagor, 2018, ICALP.

Complexity of Two-Variable Logic on Finite Trees

James Worrell, Witold Charatonik, Michael Benedikt, 2013, ICALP.

On reachability problems for low dimensional matrix semigroups pdf

Joël Ouaknine, James Worrell, Thomas Colcombet, 2019, ICALP.

On Metric Temporal Logic and Faulty Turing Machines

Joël Ouaknine, James Worrell, J. Ouaknine, 2006, FoSSaCS.

On Recurrent Reachability for Continuous Linear Dynamical Systems

Joël Ouaknine, James Worrell, Ventsislav Chonev, 2015, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

An Intrinsic Characterization of Approximate Probabilistic Bisimilarity

Joël Ouaknine, James Worrell, Michael W. Mislove, 2003, FoSSaCS.

Time-Bounded Verification

Joël Ouaknine, James Worrell, Alexander Moshe Rabinovich, 2009, CONCUR.

Costs and Rewards in Priced Timed Automata

James Worrell, Martin Fränzle, Mani Swaminathan, 2018, ICALP.

The Church Synthesis Problem with Metric

Joël Ouaknine, James Worrell, Alexander Moshe Rabinovich, 2011, CSL.

Reachability problems for Markov chains

Joël Ouaknine, James Worrell, Timos Antonopoulos, 2015, Inf. Process. Lett..

Effective Positivity Problems for Simple Linear Recurrence Sequences pdf

Joël Ouaknine, James Worrell, J. Ouaknine, 2013, ArXiv.

On Termination for Faulty Channel Machines pdf

Philippe Schnoebelen, Joël Ouaknine, James Worrell, 2008, STACS.

On the Polytope Escape Problem for Continuous Linear Dynamical Systems

Joël Ouaknine, João Sousa Pinto, James Worrell, 2015, HSCC.

Duality for Labelled Markov Processes

Joël Ouaknine, James Worrell, Michael W. Mislove, 2004, FoSSaCS.

Linear Completeness Thresholds for Bounded Model Checking

Joël Ouaknine, James Worrell, Daniel Kroening, 2011, CAV.

Model Checking and Decision Procedures for Probabilistic Automata and Markov Chains

James Worrell, 2008, 2008 Fifth International Conference on Quantitative Evaluation of Systems.

When is Containment Decidable for Probabilistic Automata?

James Worrell, Guillermo A. Pérez, Marcin Jurdzinski, 2018, ICALP.

Axioms for Probability and Nondeterminism

Joël Ouaknine, James Worrell, Michael W. Mislove, 2004, EXPRESS.

On the decidability and complexity of Metric Temporal Logic over finite words

Joël Ouaknine, James Worrell, J. Ouaknine, 2007, Log. Methods Comput. Sci..

On linear recurrence sequences and loop termination

Joël Ouaknine, James Worrell, J. Ouaknine, 2015, SIGL.

O-Minimal Invariants for Discrete-Time Dynamical Systems

James Worrell, Shaull Almagor, Dmitry Chistikov, 2022, ACM Transactions on Computational Logic.

Cyclotomic Identity Testing and Applications

James Worrell, Mahsa Shirmohammadi, Sylvain Perifel, 2020, ISSAC.

On the Computation of the Algebraic Closure of Finitely Generated Groups of Matrices pdf

James Worrell, Amaury Pouly, Mahsa Shirmohammadi, 2021, ArXiv.

On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets

James Worrell, Eike Neumann, Engel Lefaucheux, 2021, MFCS.

LIPIcs, Volume 198, ICALP 2021, Complete Volume

James Worrell, Nikhil Bansal, Emanuela Merelli, 2021 .

The Orbit Problem for Parametric Linear Dynamical Systems pdf

Christel Baier, James Worrell, Markus A. Whiteland, 2021, CONCUR.

Decision Problems for Second-Order Holonomic Recurrences

Joël Ouaknine, James Worrell, Eike Neumann, 2021, ICALP.

The Pseudo-Skolem Problem is Decidable

Joël Ouaknine, James Worrell, Rupak Majumdar, 2021, MFCS.

Porous Invariants

James Worrell, Engel Lefaucheux, David Purser, 2021, CAV.

Universal Skolem Sets

Joël Ouaknine, James Worrell, Florian Luca, 2021, 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

Costs and rewards in priced timed automata

James Worrell, Martin Fränzle, Mani Swaminathan, 2022, Inf. Comput..

When are emptiness and containment decidable for probabilistic automata?

James Worrell, Guillermo A. Pérez, Marcin Jurdzinski, 2021, J. Comput. Syst. Sci..

First-Order Orbit Queries

Joël Ouaknine, James Worrell, Shaull Almagor, 2020, Theory of Computing Systems.

Testing for Simulation and Bisimulation inLabelled Markov Pro esses

James Worrell, Michael W. Mislove, J. Ouaknine, 2003 .

Static Livelock Analysis in CSP : Full Version

Joël Ouaknine, James Worrell, A. W. Roscoe, 2011 .

Markov Chains and Unambiguous Automata

Christel Baier, James Worrell, Joachim Klein, 2016 .