( en | de | ru )

 

Disambiguation of "Worrell, James"

Author of the publication

copydeleteadd this publication to your clipboard
Timed Temporal Logics.

, , , , and . Models, Algorithms, Logics and Tools, volume 10460 of Lecture Notes in Computer Science, page 211-230. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Michael James

Audrein James

Katherine James

Ammini James-Mammoottil

Rojin James

 

Other publications of authors with the same name

Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata., , , and . CoRR, (2017)Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems., , and . Logical Methods in Computer Science, (2008)An Investigation of the Effects of ERP Post-Implementation Support Structure on ERP/Business Unit Fit.. AMCIS, page 386. Association for Information Systems, (2007)Effective definability of the reachability relation in timed automata., , , and . Inf. Process. Lett., (2020)Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems., , and . FoSSaCS, volume 4423 of Lecture Notes in Computer Science, page 123-137. Springer, (2007)On the Monniaux Problem in Abstract Interpretation., , , , , and . SAS, volume 11822 of Lecture Notes in Computer Science, page 162-180. Springer, (2019)On the structure of categories of coalgebras., , , , and . Theor. Comput. Sci., 260 (1-2): 87-117 (2001)On the Computation of the Algebraic Closure of Finitely Generated Groups of Matrices., , , and . CoRR, (2021)Markov chains and unambiguous automata., , , , and . J. Comput. Syst. Sci., (2023)When are emptiness and containment decidable for probabilistic automata?, , , , , and . J. Comput. Syst. Sci., (2021)