Discrete mathematics, Decidability, Coalgebra, Probabilistic logic and Model checking are his primary areas of study. The various areas that he examines in his Discrete mathematics study include Separation logic and Preferential entailment. His research integrates issues of Timed automaton and Reachability in his study of Decidability.
James Worrell focuses mostly in the field of Probabilistic logic, narrowing it down to matters related to Pseudometric space and, in some cases, Probability measure. His biological study spans a wide range of topics, including Linear temporal logic and Temporal logic. His work carried out in the field of Temporal logic brings together such families of science as Satisfiability and Boolean satisfiability problem.
His primary areas of study are Discrete mathematics, Decidability, Combinatorics, Automaton and Theoretical computer science. His biological study deals with issues like Bounded function, which deal with fields such as Real number. His study on Undecidable problem is often connected to Skolem problem as part of broader study in Decidability.
He combines subjects such as Matrix, Upper and lower bounds, PSPACE and Algebraic number with his study of Combinatorics. His research in Automaton intersects with topics in Reduction and Mathematical optimization. His Theoretical computer science research is multidisciplinary, relying on both Computational complexity theory, Algorithm and Probabilistic logic.
His primary areas of investigation include Discrete mathematics, Decidability, Combinatorics, Reachability and Automaton. His work in Discrete mathematics tackles topics such as Path which are related to areas like Time complexity. His work in the fields of Decidability, such as Undecidable problem, intersects with other areas such as Square matrix.
His work on Integer and Number theory is typically connected to Skolem problem and Trajectory as part of general Combinatorics study, connecting several disciplines of science. His Timed automaton study in the realm of Automaton connects with subjects such as Relation. His Dimension research includes themes of Model checking and Point.
James Worrell spends much of his time researching Decidability, Discrete mathematics, Reachability, Combinatorics and Affine transformation. His Decidability research incorporates elements of Open problem and Invariant. His Discrete mathematics study frequently intersects with other fields, such as Automaton.
His study in the field of Timed automaton is also linked to topics like Relation. As a part of the same scientific family, James Worrell mostly works in the field of Reachability, focusing on Matrix and, on occasion, Dimension, Algebraic number and Diophantine approximation. In general Combinatorics study, his work on Existential quantification, Number theory and Conjecture often relates to the realm of Skolem problem and Initial value problem, thereby connecting several areas of interest.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
On the decidability of metric temporal logic
J. Ouaknine;J. Worrell.
logic in computer science (2005)
On the decidability of metric temporal logic
J. Ouaknine;J. Worrell.
logic in computer science (2005)
Some Recent Results in Metric Temporal Logic
Joël Ouaknine;James Worrell.
formal modeling and analysis of timed systems (2008)
Some Recent Results in Metric Temporal Logic
Joël Ouaknine;James Worrell.
formal modeling and analysis of timed systems (2008)
Nets with Tokens which Carry Data
Ranko Lazic;Tom Newcomb;Joël Ouaknine;A. W. Roscoe.
applications and theory of petri nets (2008)
Nets with Tokens which Carry Data
Ranko Lazic;Tom Newcomb;Joël Ouaknine;A. W. Roscoe.
applications and theory of petri nets (2008)
A behavioural pseudometric for probabilistic transition systems
Franck van Breugel;James Worrell.
international colloquium on automata languages and programming (2005)
A behavioural pseudometric for probabilistic transition systems
Franck van Breugel;James Worrell.
international colloquium on automata languages and programming (2005)
Towards Quantitative Verification of Probabilistic Transition Systems
Franck van Breugel;James Worrell.
international colloquium on automata languages and programming (2001)
Towards Quantitative Verification of Probabilistic Transition Systems
Franck van Breugel;James Worrell.
international colloquium on automata languages and programming (2001)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Max Planck Institute for Software Systems
University of Oxford
University of Paris-Saclay
Université Libre de Bruxelles
University of Oxford
TU Dresden
University of Oxford
Uppsala University
Max Planck Institute for Software Systems
Georgia Institute of Technology
French Institute for Research in Computer Science and Automation - INRIA
Publications: 11
London Business School
ETH Zurich
ETH Zurich
National Academies of Sciences, Engineering, and Medicine
King Abdullah University of Science and Technology
University of California, Santa Cruz
Oak Ridge National Laboratory
University of Chicago
Cardiff University
University of Michigan–Ann Arbor
Nihon University
National Center for Atmospheric Research
Istituto Sperimentale Italiano Lazzaro Spallanzani
Florida Atlantic University
University of Chicago
University of Canberra