James Worrell

According to our database1, James Worrell authored at least 129 papers between 1998 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
The Semialgebraic Orbit Problem.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

On the decidability of reachability in linear time-invariant systems.
Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control, 2019

2018
Model Checking Real-Time Systems.
Proceedings of the Handbook of Model Checking., 2018

Reachability Problems 2014: Special issue.
Theor. Comput. Sci., 2018

Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata.
Logical Methods in Computer Science, 2018

Polynomial Invariants for Affine Programs.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Costs and Rewards in Priced Timed Automata.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

When is Containment Decidable for Probabilistic Automata?.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

O-Minimal Invariants for Linear Loops.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Effective Divergence Analysis for Linear Recurrence Sequences.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

On Rationality of Nonnegative Matrix Factorization.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Revisiting reachability in timed automata.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Polynomial automata: Zeroness and applications.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

The Zero Problem for Exponential Polynomials.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

The Polytope-Collision Problem.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

On the Polytope Escape Problem for Continuous Linear Dynamical Systems.
Proceedings of the 20th International Conference on Hybrid Systems: Computation and Control, 2017

Probabilistic Automata of Bounded Ambiguity.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

Timed Temporal Logics.
Proceedings of the Models, Algorithms, Logics and Tools, 2017

2016
Zeno, Hercules, and the Hydra: Safety Metric Temporal Logic is Ackermann-Complete.
ACM Trans. Comput. Log., 2016

On the Complexity of the Orbit Problem.
J. ACM, 2016

Relating Reachability Problems in Timed and Counter Automata.
Fundam. Inform., 2016

Solvability of Matrix-Exponential Equations.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

On Recurrent Reachability for Continuous Linear Dynamical Systems.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

On the Skolem Problem for Continuous Linear Dynamical Systems.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

On Restricted Nonnegative Matrix Factorization.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Proving the Herman-Protocol Conjecture.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Model Checking Flat Freeze LTL on One-Counter Automata.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

Markov Chains and Unambiguous Büchi Automata.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015
On linear recurrence sequences and loop termination.
SIGLOG News, 2015

Reachability problems for Markov chains.
Inf. Process. Lett., 2015

On Matrix Powering in Low Dimensions.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

On Termination of Integer Linear Loops.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

The Polyhedron-Hitting Problem.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

On the Complexity of Linear Arithmetic with Divisibility.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Reachability Problems for Continuous Linear Dynamical Systems (Invited Talk).
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Minimisation of Multiplicity Tree Automata.
Proceedings of the Foundations of Software Science and Computation Structures, 2015

Three Variables Suffice for Real-Time Logic.
Proceedings of the Foundations of Software Science and Computation Structures, 2015

Reachability Problems for Continuous Linear Dynamical Systems (Invited Paper).
Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014
Language equivalence of probabilistic pushdown automata.
Inf. Comput., 2014

Positivity Problems for Low-Order Linear Recurrence Sequences.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Online Monitoring of Metric Temporal Logic.
Proceedings of the Runtime Verification - 5th International Conference, 2014

Complexity of Equivalence and Learning for Multiplicity Tree Automata.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

On the Positivity Problem for Simple Linear Recurrence Sequences, .
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata.
Proceedings of the Horizons of the Mind. A Tribute to Prakash Panangaden, 2014

2013
Addendum to "Recursively defined metric spaces without contraction" [TCS 380 (1/2) (2007) 143-163].
Theor. Comput. Sci., 2013

Algorithmic probabilistic game semantics - Playing games with automata.
Formal Methods in System Design, 2013

A Static Analysis Framework for Livelock Freedom in CSP
Logical Methods in Computer Science, 2013

Two Variable vs. Linear Temporal Logic in Model Checking and Games
Logical Methods in Computer Science, 2013

On the Complexity of Equivalence and Minimisation for Q-weighted Automata
Logical Methods in Computer Science, 2013

LTL Model Checking of Interval Markov Chains.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

The orbit problem in higher dimensions.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Expressive Completeness for Metric Temporal Logic.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Revisiting the Equivalence Problem for Finite Multitape Automata.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Complexity of Two-Variable Logic on Finite Trees.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points.
Proceedings of the Automated Technology for Verification and Analysis, 2013

2012
Three tokens in Herman's algorithm.
Formal Asp. Comput., 2012

On termination and invariance for faulty channel machines.
Formal Asp. Comput., 2012

Decision Problems for Linear Recurrence Sequences.
Proceedings of the Reachability Problems - 6th International Workshop, 2012

On the Relationship between Reachability Problems in Timed and Counter Automata.
Proceedings of the Reachability Problems - 6th International Workshop, 2012

Verification of Two-Variable Logic Revisited.
Proceedings of the Ninth International Conference on Quantitative Evaluation of Systems, 2012

On the Magnitude of Completeness Thresholds in Bounded Model Checking.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Bisimilarity of Probabilistic Pushdown Automata.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

On the Complexity of the Equivalence Problem for Probabilistic Automata.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

Branching-Time Model Checking of Parametric One-Counter Automata.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

On the Complexity of Computing Probabilistic Bisimilarity.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

APEX: An Analyzer for Open Probabilistic Programs.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

Recent Developments in FDR.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

2011
On Stabilization in Herman's Algorithm.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

On Reachability for Hybrid Automata over Bounded Time.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

The Church Synthesis Problem with Metric.
Proceedings of the Computer Science Logic, 2011

Static Livelock Analysis in CSP.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

Tractable Reasoning in a Fragment of Separation Logic.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

Two Variable vs. Linear Temporal Logic in Model Checking and Games.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

Linear Completeness Thresholds for Bounded Model Checking.
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

Language Equivalence for Probabilistic Automata.
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

2010
Alternating Timed Automata over Bounded Time.
Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

Towards a Theory of Time-Bounded Verification.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Model Checking Succinct and Parametric One-Counter Automata.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Computing Rational Radical Sums in Uniform TC^0.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

On Process-Algebraic Extensions of Metric Temporal Logic.
Proceedings of the Reflections on the Work of C. A. R. Hoare., 2010

2009
Time-Bounded Verification.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

Reachability in Succinct and Parametric One-Counter Automata.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008
Universality Analysis for One-Clock Timed Automata.
Fundam. Inform., 2008

Real-Time Model Checking: Algorithms and Complexity.
Proceedings of the 15th International Symposium on Temporal Representation and Reasoning, 2008

On Automated Verification of Probabilistic Programs.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

On Termination for Faulty Channel Machines.
Proceedings of the STACS 2008, 2008

Model Checking and Decision Procedures for Probabilistic Automata and Markov Chains.
Proceedings of the Fifth International Conference on the Quantitative Evaluaiton of Systems (QEST 2008), 2008

On Expressiveness and Complexity in Real-Time Model Checking.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Some Recent Results in Metric Temporal Logic.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2008

2007
Recursively defined metric spaces without contraction.
Theor. Comput. Sci., 2007

On the decidability and complexity of Metric Temporal Logic over finite words.
Logical Methods in Computer Science, 2007

Labelled Markov Processes as Generalised Stochastic Relations.
Electr. Notes Theor. Comput. Sci., 2007

The Cost of Punctuality.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

Zone-Based Universality Analysis for Single-Clock Timed Automata.
Proceedings of the International Symposium on Fundamentals of Software Engineering, 2007

Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems.
Proceedings of the Foundations of Software Science and Computational Structures, 2007

Undecidability of Universality for Timed Automata with Minimal Resources.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2007

Nets with Tokens Which Carry Data.
Proceedings of the Petri Nets and Other Models of Concurrency, 2007

2006
Approximating and computing behavioural distances in probabilistic transition systems.
Theor. Comput. Sci., 2006

Safety Metric Temporal Logic Is Fully Decidable.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2006

On Metric Temporal Logic and Faulty Turing Machines.
Proceedings of the Foundations of Software Science and Computation Structures, 2006

Testing Semantics: Connecting Processes and Process Logics.
Proceedings of the Algebraic Methodology and Software Technology, 2006

2005
On the final sequence of a finitary set functor.
Theor. Comput. Sci., 2005

A behavioural pseudometric for probabilistic transition systems.
Theor. Comput. Sci., 2005

Domain theory, testing and simulation for labelled Markov processes.
Theor. Comput. Sci., 2005

A note on coalgebras and presheaves.
Mathematical Structures in Computer Science, 2005

On the Decidability of Metric Temporal Logic.
Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

An Accessible Approach to Behavioural Pseudometrics.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Decidability and Complexity Results for Timed Automata via Channel Machines.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004
Axioms for Probability and Nondeterminism.
Electr. Notes Theor. Comput. Sci., 2004

On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

Duality for Labelled Markov Processes.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

2003
Timed CSP = Closed Timed epsilon-automata.
Nord. J. Comput., 2003

Revisiting Digitization, Robustness, and Decidability for Timed Automata.
Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

Universality and Language Inclusion for Open and Closed Timed Automata.
Proceedings of the Hybrid Systems: Computation and Control, 2003

An Intrinsic Characterization of Approximate Probabilistic Bisimilarity.
Proceedings of the Foundations of Software Science and Computational Structures, 2003

2002
A Note on Coalgebras and Presheaves.
Electr. Notes Theor. Comput. Sci., 2002

Timed CSP = Closed Timed Safety Automata.
Electr. Notes Theor. Comput. Sci., 2002

Measuring the Probabilistic Powerdomain.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Testing Labelled Markov Processes.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001
On the structure of categories of coalgebras.
Theor. Comput. Sci., 2001

Towards Quantitative Verification of Probabilistic Transition Systems.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

An Algorithm for Quantitative Verification of Probabilistic Transition Systems.
Proceedings of the CONCUR 2001, 2001

2000
Coinduction for recursive data types: partial orders, metric spaces and Omega-categories.
Electr. Notes Theor. Comput. Sci., 2000

1999
Terminal sequences for accessible endofunctors.
Electr. Notes Theor. Comput. Sci., 1999

1998
Toposes of Coalgebras and Hidden Algebras.
Electr. Notes Theor. Comput. Sci., 1998

An Axiomatics for Categories of Transition Systems as Coalgebras.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998


  Loading...