default search action
James Worrell 0001
James B. Worrell
Person information
- affiliation: University of Oxford, Department of Computer Science, UK
Other persons with the same name
- James Worrell 0002 (aka: James L. Worrell) — University of Alabama at Birmingham, Department of Accounting and Finance, AL, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j52]Valérie Berthé, Toghrul Karimov, Joris Nieuwveld, Joël Ouaknine, Mihir Vahanwala
, James Worrell:
The monadic theory of toric words. Theor. Comput. Sci. 1025: 114959 (2025) - 2024
- [j51]Engel Lefaucheux, Joël Ouaknine
Porous invariants for linear systems. Formal Methods Syst. Des. 63(1): 235-271 (2024) - [j50]Alex Buna-Marginean
On Learning Polynomial Recursive Programs. Proc. ACM Program. Lang. 8(POPL): 1001-1027 (2024) - [c146]Bertrand Teguia Tabuguia
On Rational Recursion for Holonomic Sequences. CASC 2024: 314-327 - [c145]Quentin Guilmant, Engel Lefaucheux, Joël Ouaknine, James Worrell:
The 2-Dimensional Constraint Loop Problem Is Decidable. ICALP 2024: 140:1-140:21 - [c144]Pavol Kebis, Florian Luca, Joël Ouaknine, Andrew Scoones, James Worrell:
On Transcendence of Numbers Related to Sturmian and Arnoux-Rauzy Words. ICALP 2024: 144:1-144:15 - [c143]Valérie Berthé
On the Decidability of Monadic Second-Order Logic with Arithmetic Predicates. LICS 2024: 11:1-11:14 - [c142]Julian D'Costa, Joël Ouaknine, James Worrell:
Nonnegativity Problems for Matrix Semigroups. STACS 2024: 27:1-27:16 - [e5]Naoki Kobayashi
Foundations of Software Science and Computation Structures - 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part I. Lecture Notes in Computer Science 14574, Springer 2024, ISBN 978-3-031-57227-2 [contents] - [e4]Naoki Kobayashi
Foundations of Software Science and Computation Structures - 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part II. Lecture Notes in Computer Science 14575, Springer 2024, ISBN 978-3-031-57230-2 [contents] - [i87]Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell:
Multiple Reachability in Linear Dynamical Systems. CoRR abs/2403.06515 (2024) - [i86]Bertrand Teguia Tabuguia, James Worrell:
On Rational Recursion for Holonomic Sequences. CoRR abs/2404.19136 (2024) - [i85]Pavol Kebis, Florian Luca, Joël Ouaknine, Andrew Scoones, James Worrell:
On Transcendence of Numbers Related to Sturmian and Arnoux-Rauzy Words. CoRR abs/2405.05279 (2024) - [i84]Valérie Berthé, Toghrul Karimov, Joris Nieuwveld, Joël Ouaknine, Mihir Vahanwala, James Worrell:
On the Decidability of Monadic Second-Order Logic with Arithmetic Predicates. CoRR abs/2405.07953 (2024) - [i83]Quentin Guilmant, Engel Lefaucheux, Joël Ouaknine, James Worrell:
The 2-Dimensional Constraint Loop Problem is Decidable. CoRR abs/2405.12992 (2024) - [i82]Rida Ait El Manssour, George Kenison, Mahsa Shirmohammadi, James Worrell:
Determination Problems for Orbit Closures and Matrix Groups. CoRR abs/2407.04626 (2024) - [i81]Toghrul Karimov, Florian Luca, Joris Nieuwveld, Joël Ouaknine, James Worrell:
On the Decidability of Presburger Arithmetic Expanded with Powers. CoRR abs/2407.05191 (2024) - [i80]Rida Ait El Manssour, Vincent Cheval, Mahsa Shirmohammadi, James Worrell:
On Tree Automata, Generating Functions, and Differential Equations. CoRR abs/2407.08218 (2024) - [i79]Andrew Scoones, Mahsa Shirmohammadi, James Worrell:
Reachability for Multi-Priced Timed Automata with Positive and Negative Rates. CoRR abs/2407.18131 (2024) - [i78]Rida Ait El Manssour, Nikhil Balaji, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
A parametric version of the Hilbert Nullstellensatz. CoRR abs/2408.13027 (2024) - [i77]Toghrul Karimov, Joël Ouaknine, James Worrell:
Verification of Linear Dynamical Systems via O-Minimality of Real Numbers. CoRR abs/2410.13053 (2024) - 2023
- [j49]Ventsislav Chonev
On the Zeros of Exponential Polynomials. J. ACM 70(4): 26:1-26:26 (2023) - [j48]Ehud Hrushovski, Joël Ouaknine, Amaury Pouly, James Worrell:
On Strongest Algebraic Program Invariants. J. ACM 70(5): 29:1-29:22 (2023) - [j47]Christel Baier
Markov chains and unambiguous automata. J. Comput. Syst. Sci. 136: 113-134 (2023) - [j46]Yuri Bilu, Florian Luca, Joris Nieuwveld, Joël Ouaknine, James Worrell:
On the 𝑝-adic zeros of the Tribonacci sequence. Math. Comput. 93(347): 1333-1353 (2023) - [c141]James Worrell:
The Skolem Landscape (Invited Talk). ICALP 2023: 5:1-5:2 - [c140]George Kenison, Joris Nieuwveld, Joël Ouaknine, James Worrell:
Positivity Problems for Reversible Linear Recurrence Sequences. ICALP 2023: 130:1-130:17 - [c139]George Kenison
The Membership Problem for Hypergeometric Sequences with Quadratic Parameters. ISSAC 2023: 407-416 - [c138]Nikhil Balaji
Multiplicity Problems on Algebraic Series and Context-Free Grammars. LICS 2023: 1-12 - [c137]Toghrul Karimov, Edon Kelmendi, Joris Nieuwveld, Joël Ouaknine, James Worrell:
The Power of Positivity. LICS 2023: 1-11 - [i76]George Kenison, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
The Membership Problem for Hypergeometric Sequences with Quadratic Parameters. CoRR abs/2303.09204 (2023) - [i75]Nikhil Balaji, Lorenzo Clemente, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
Multiplicity Problems on Algebraic Series and Context-Free Grammars. CoRR abs/2304.14145 (2023) - [i74]Florian Luca, James Maynard, Armand Noubissie, Joël Ouaknine, James Worrell:
Skolem Meets Bateman-Horn. CoRR abs/2308.01152 (2023) - [i73]Florian Luca, Joël Ouaknine, James Worrell:
Transcendence of Sturmian Numbers over an Algebraic Base. CoRR abs/2308.13657 (2023) - [i72]Alex Buna-Marginean, Vincent Cheval, Mahsa Shirmohammadi, James Worrell:
On Learning Polynomial Recursive Programs. CoRR abs/2310.14725 (2023) - [i71]Valérie Berthé, Toghrul Karimov, Joël Ouaknine, Mihir Vahanwala, James Worrell:
The Monadic Theory of Toric Words. CoRR abs/2311.04895 (2023) - [i70]Julian D'Costa, Joël Ouaknine, James Worrell:
Nonnegativity Problems for Matrix Semigroups. CoRR abs/2311.06241 (2023) - 2022
- [j45]Nathanaël Fijalkow, Cristian Riveros
Probabilistic automata of bounded ambiguity. Inf. Comput. 282: 104648 (2022) - [j44]Martin Fränzle
Costs and rewards in priced timed automata. Inf. Comput. 282: 104656 (2022) - [j43]Toghrul Karimov
What's decidable about linear loops? Proc. ACM Program. Lang. 6(POPL): 1-25 (2022) - [j42]Shaull Almagor, Dmitry Chistikov, Joël Ouaknine, James Worrell:
O-Minimal Invariants for Discrete-Time Dynamical Systems. ACM Trans. Comput. Log. 23(2): 9:1-9:20 (2022) - [c136]Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell:
What's Decidable About Discrete Linear Dynamical Systems? Principles of Systems Design 2022: 21-38 - [c135]Christel Baier
Parameter Synthesis for Parametric Probabilistic Dynamical Systems and Prefix-Independent Specifications. CONCUR 2022: 10:1-10:16 - [c134]Florian Luca, Joël Ouaknine, James Worrell:
Algebraic Model Checking for Discrete Linear Dynamical Systems. FORMATS 2022: 3-15 - [c133]Pascale Gourdeau, Varun Kanade, Marta Kwiatkowska, James Worrell:
Sample Complexity Bounds for Robustly Learning Decision Lists against Evasion Attacks. IJCAI 2022: 3022-3028 - [c132]Klara Nosan, Amaury Pouly, Sylvain Schmitz, Mahsa Shirmohammadi, James Worrell:
On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices. ISSAC 2022: 129-138 - [c131]Klara Nosan, Amaury Pouly, Mahsa Shirmohammadi, James Worrell:
The Membership Problem for Hypergeometric Sequences with Rational Parameters. ISSAC 2022: 381-389 - [c130]Richard Lipton, Florian Luca, Joris Nieuwveld, Joël Ouaknine, David Purser, James Worrell:
On the Skolem Problem and the Skolem Conjecture. LICS 2022: 5:1-5:9 - [c129]Nikhil Balaji
Identity Testing for Radical Expressions. LICS 2022: 8:1-8:11 - [c128]Yuri Bilu
Skolem Meets Schanuel. MFCS 2022: 20:1-20:15 - [c127]Julian D'Costa, Engel Lefaucheux
Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set. MFCS 2022: 39:1-39:14 - [c126]Julian D'Costa
The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems. MFCS 2022: 40:1-40:13 - [c125]Florian Luca
A Universal Skolem Set of Positive Lower Density. MFCS 2022: 73:1-73:12 - [c124]Pascale Gourdeau, Varun Kanade, Marta Kwiatkowska, James Worrell:
When are Local Queries Useful for Robust Learning? NeurIPS 2022 - [i69]Klara Nosan, Amaury Pouly, Mahsa Shirmohammadi, James Worrell:
The Membership Problem for Hypergeometric Sequences with Rational Parameters. CoRR abs/2202.07416 (2022) - [i68]Nikhil Balaji, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
Identity testing for radical expressions. CoRR abs/2202.07961 (2022) - [i67]Julian D'Costa, Toghrul Karimov, Joël Ouaknine, Mahmoud Salamati, James Worrell:
The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems. CoRR abs/2204.12253 (2022) - [i66]Yuri Bilu, Florian Luca, Joris Nieuwveld, Joël Ouaknine, David Purser, James Worrell:
Skolem Meets Schanuel. CoRR abs/2204.13417 (2022) - [i65]Pascale Gourdeau, Varun Kanade, Marta Kwiatkowska, James Worrell:
Sample Complexity Bounds for Robustly Learning Decision Lists against Evasion Attacks. CoRR abs/2205.06127 (2022) - [i64]Nathanaël Fijalkow, Cristian Riveros, James Worrell:
Probabilistic Automata of Bounded Ambiguity. CoRR abs/2205.08175 (2022) - [i63]Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell:
What's Decidable about Discrete Linear Dynamical Systems? CoRR abs/2206.11412 (2022) - [i62]Julian D'Costa, Engel Lefaucheux, Eike Neumann, Joël Ouaknine, James Worrell:
Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set. CoRR abs/2207.01550 (2022) - [i61]Pascale Gourdeau, Varun Kanade, Marta Kwiatkowska, James Worrell:
When are Local Queries Useful for Robust Learning? CoRR abs/2210.06089 (2022) - 2021
- [j41]Laure Daviaud
When are emptiness and containment decidable for probabilistic automata? J. Comput. Syst. Sci. 119: 78-96 (2021) - [j40]Pascale Gourdeau, Varun Kanade, Marta Kwiatkowska, James Worrell:
On the Hardness of Robust Classification. J. Mach. Learn. Res. 22: 273:1-273:29 (2021) - [j39]Shaull Almagor, Joël Ouaknine, James Worrell:
First-Order Orbit Queries. Theory Comput. Syst. 65(4): 638-661 (2021) - [j38]Shaull Almagor
Deciding ω-regular properties on linear recurrence sequences. Proc. ACM Program. Lang. 5(POPL): 1-24 (2021) - [c123]Engel Lefaucheux
Porous Invariants. CAV (2) 2021: 172-194 - [c122]Christel Baier
The Orbit Problem for Parametric Linear Dynamical Systems. CONCUR 2021: 28:1-28:17 - [c121]Eike Neumann, Joël Ouaknine, James Worrell:
Decision Problems for Second-Order Holonomic Recurrences. ICALP 2021: 99:1-99:20 - [c120]Nikhil Balaji
Cyclotomic Identity Testing and Applications. ISSAC 2021: 35-42 - [c119]Florian Luca, Joël Ouaknine, James Worrell:
Universal Skolem Sets. LICS 2021: 1-6 - [c118]Julian D'Costa, Engel Lefaucheux, Eike Neumann, Joël Ouaknine, James Worrell:
On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets. MFCS 2021: 33:1-33:21 - [c117]Julian D'Costa, Toghrul Karimov
The Pseudo-Skolem Problem is Decidable. MFCS 2021: 34:1-34:21 - [c116]George Kenison
On Positivity and Minimality for Second-Order Holonomic Sequences. MFCS 2021: 67:1-67:15 - [e3]Nikhil Bansal, Emanuela Merelli
48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference). LIPIcs 198, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-195-5 [contents] - [i60]Christel Baier, Florian Funke, Simon Jantsch, Engel Lefaucheux, Florian Luca, Joël Ouaknine, David Purser, Markus A. Whiteland, James Worrell:
The Orbit Problem for Parametric Linear Dynamical Systems. CoRR abs/2104.10634 (2021) - [i59]Engel Lefaucheux, Joël Ouaknine, David Purser, James Worrell:
Porous Invariants. CoRR abs/2106.00662 (2021) - [i58]Klara Nosan, Amaury Pouly, Mahsa Shirmohammadi, James Worrell:
On the Computation of the Algebraic Closure of Finitely Generated Groups of Matrices. CoRR abs/2106.01853 (2021) - [i57]Julian D'Costa, Engel Lefaucheux, Eike Neumann, Joël Ouaknine, James Worrell:
On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets. CoRR abs/2107.02060 (2021) - 2020
- [j37]Martin Fränzle
Effective definability of the reachability relation in timed automata. Inf. Process. Lett. 153 (2020) - [c115]Eike Neumann, Joël Ouaknine, James Worrell:
On Ranking Function Synthesis and Termination for Polynomial Programs. CONCUR 2020: 15:1-15:15 - [c114]Rupak Majumdar, Joël Ouaknine, Amaury Pouly
Algebraic Invariants for Linear Hybrid Automata. CONCUR 2020: 32:1-32:17 - [c113]Shaull Almagor
Coverability in 1-VASS with Disequality Tests. CONCUR 2020: 38:1-38:20 - [c112]Shaull Almagor
Invariants for Continuous Linear Dynamical Systems. ICALP 2020: 107:1-107:15 - [c111]George Kenison
On the skolem problem and prime powers. ISSAC 2020: 289-296 - [c110]Toghrul Karimov
On LTL Model Checking for Low-Dimensional Discrete Linear Dynamical Systems. MFCS 2020: 54:1-54:14 - [c109]Julian D'Costa, Engel Lefaucheux, Joël Ouaknine, James Worrell:
How Fast Can You Escape a Compact Polytope? STACS 2020: 49:1-49:11 - [c108]Catalin-Andrei Ilie, James B. Worrell:
Parametric Model Checking Continuous-Time Markov Chains. TIME 2020: 7:1-7:18 - [i56]Shaull Almagor, Edon Kelmendi, Joël Ouaknine, James Worrell:
Invariants for Continuous Linear Dynamical Systems. CoRR abs/2004.11661 (2020) - [i55]George Kenison, Richard Lipton, Joël Ouaknine, James Worrell:
On the Skolem Problem and Prime Powers. CoRR abs/2006.07432 (2020) - [i54]Toghrul Karimov, Joël Ouaknine, James Worrell:
On LTL Model Checking for Low-Dimensional Discrete Linear Dynamical Systems. CoRR abs/2007.02911 (2020) - [i53]George Kenison, Oleksiy Klurman, Engel Lefaucheux, Florian Luca, Pieter Moree, Joël Ouaknine, Markus A. Whiteland, James Worrell:
On Positivity and Minimality for Second-Order Holonomic Sequences. CoRR abs/2007.12282 (2020) - [i52]Nikhil Balaji, Sylvain Perifel, Mahsa Shirmohammadi, James Worrell:
Cyclotomic Identity Testing and Applications. CoRR abs/2007.13179 (2020) - [i51]Shaull Almagor, Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell:
Deciding ω-Regular Properties on Linear Recurrence Sequences. CoRR abs/2010.14432 (2020)
2010 – 2019
- 2019
- [j36]Joël Ouaknine, Amaury Pouly, João Sousa Pinto
On the Decidability of Membership in Matrix-exponential Semigroups. J. ACM 66(3): 15:1-15:24 (2019) - [j35]Hsi-Ming Ho
On the Expressiveness and Monitoring of Metric Temporal Logic. Log. Methods Comput. Sci. 15(2) (2019) - [j34]Nathanaël Fijalkow
Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. Theory Comput. Syst. 63(5): 1027-1048 (2019) - [c107]Nathanaël Fijalkow
On the decidability of reachability in linear time-invariant systems. HSCC 2019: 77-86 - [c106]Thomas Colcombet
On Reachability Problems for Low-Dimensional Matrix Semigroups. ICALP 2019: 44:1-44:15 - [c105]Mehran Hosseini
Termination of Linear Loops over the Integers. ICALP 2019: 118:1-118:13 - [c104]Florent Guépin, Christoph Haase
On the Existential Theories of Büchi Arithmetic and Linear p-adic Fields. LICS 2019: 1-10 - [c103]Pascale Gourdeau, Varun Kanade, Marta Kwiatkowska, James Worrell:
On the Hardness of Robust Classification. NeurIPS 2019: 7444-7453 - [c102]Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
On the Monniaux Problem in Abstract Interpretation. SAS 2019: 162-180 - [c101]Shaull Almagor, Joël Ouaknine, James Worrell
The Semialgebraic Orbit Problem. STACS 2019: 6:1-6:15 - [i50]Shaull Almagor, Joël Ouaknine, James Worrell:
The Semialgebraic Orbit Problem. CoRR abs/1901.11023 (2019) - [i49]Shaull Almagor, Nathann Cohen, Guillermo A. Pérez, Mahsa Shirmohammadi, James Worrell:
Coverability in 1-VASS with Disequality Tests. CoRR abs/1902.06576 (2019) - [i48]Mehran Hosseini, Joël Ouaknine, James Worrell:
On Termination of Integer Linear Loops. CoRR abs/1902.07465 (2019) - [i47]Thomas Colcombet, Joël Ouaknine, Pavel Semukhin, James Worrell:
On reachability problems for low dimensional matrix semigroups. CoRR abs/1902.09597 (2019) - [i46]Rupak Majumdar, Joël Ouaknine, Amaury Pouly, James Worrell:
Algebraic Invariants for Linear Hybrid Automata. CoRR abs/1902.10452 (2019) - [i45]Martin Fränzle, Karin Quaas, Mahsa Shirmohammadi, James Worrell:
Effective Definability of the Reachability Relation in Timed Automata. CoRR abs/1903.09773 (2019) - [i44]Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell:
On the Monniaux Problem in Abstract Interpretation. CoRR abs/1907.08257 (2019) - [i43]Pascale Gourdeau, Varun Kanade, Marta Kwiatkowska, James Worrell:
On the Hardness of Robust Classification. CoRR abs/1909.05822 (2019) - [i42]Pascale Gourdeau, Varun Kanade, Marta Kwiatkowska, James Worrell:
On the Hardness of Robust Classification. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j33]Vojtech Forejt, Petr Jancar
Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata. Log. Methods Comput. Sci. 14(4) (2018) - [j32]Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell
Model Checking Flat Freeze LTL on One-Counter Automata. Log. Methods Comput. Sci. 14(4) (2018) - [j31]Joël Ouaknine, Igor Potapov, James Worrell
Reachability Problems 2014: Special issue. Theor. Comput. Sci. 735: 1 (2018) - [c100]Shaull Almagor, Brynmor Chapman, Mehran Hosseini
Effective Divergence Analysis for Linear Recurrence Sequences. CONCUR 2018: 42:1-42:15 - [c99]Shaull Almagor, Dmitry Chistikov, Joël Ouaknine, James Worrell
O-Minimal Invariants for Linear Loops. ICALP 2018: 114:1-114:14 - [c98]Laure Daviaud
When is Containment Decidable for Probabilistic Automata?. ICALP 2018: 121:1-121:14 - [c97]Martin Fränzle
Costs and Rewards in Priced Timed Automata. ICALP 2018: 125:1-125:14 - [c96]Ehud Hrushovski, Joël Ouaknine, Amaury Pouly, James Worrell
Polynomial Invariants for Affine Programs. LICS 2018: 530-539 - [p2]Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen
Model Checking Real-Time Systems. Handbook of Model Checking 2018: 1001-1046 - [e2]Igor Potapov, Paul G. Spirakis, James Worrell:
43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK. LIPIcs 117, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-086-6 [contents] - [i41]Ehud Hrushovski, Joël Ouaknine, Amaury Pouly, James Worrell:
Polynomial Invariants for Affine Programs. CoRR abs/1802.01810 (2018) - [i40]Nathanaël Fijalkow, Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell:
On the Decidability of Reachability in Linear Time-Invariant Systems. CoRR abs/1802.06575 (2018) - [i39]Shaull Almagor, Dmitry Chistikov, Joël Ouaknine, James Worrell:
O-Minimal Invariants for Linear Loops. CoRR abs/1802.09263 (2018) - [i38]Martin Fränzle, Mahsa Shirmohammadi, Mani Swaminathan, James Worrell:
Costs and Rewards in Priced Timed Automata. CoRR abs/1803.01914 (2018) - [i37]Hsi-Ming Ho, Joël Ouaknine, James Worrell:
On the Expressiveness and Monitoring of Metric Temporal Logic. CoRR abs/1803.02653 (2018) - [i36]Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell:
When is Containment Decidable for Probabilistic Automata? CoRR abs/1804.09077 (2018) - [i35]Shaull Almagor, Brynmor Chapman, Mehran Hosseini, Joël Ouaknine, James Worrell:
Effective Divergence Analysis for Linear Recurrence Sequences. CoRR abs/1806.07740 (2018) - 2017
- [j30]Stefan Kiefer, Ines Marusic, James Worrell
Minimisation of Multiplicity Tree Automata. Log. Methods Comput. Sci. 13(1) (2017) - [j29]Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell:
Nonnegative Matrix Factorization Requires Irrationality. SIAM J. Appl. Algebra Geom. 1(1): 285-307 (2017) - [c95]Patricia Bouyer, François Laroussinie, Nicolas Markey
Timed Temporal Logics. Models, Algorithms, Logics and Tools 2017: 211-230 - [c94]Nathanaël Fijalkow
Probabilistic Automata of Bounded Ambiguity. CONCUR 2017: 19:1-19:14 - [c93]Joël Ouaknine, João Sousa Pinto
On the Polytope Escape Problem for Continuous Linear Dynamical Systems. HSCC 2017: 11-17 - [c92]Shaull Almagor
The Polytope-Collision Problem. ICALP 2017: 24:1-24:14 - [c91]James Worrell
The Zero Problem for Exponential Polynomials. ISSAC 2017: 5 - [c90]Michael Benedikt, Timothy Duff
Polynomial automata: Zeroness and applications. LICS 2017: 1-12 - [c89]Karin Quaas, Mahsa Shirmohammadi, James Worrell
Revisiting reachability in timed automata. LICS 2017: 1-12 - [c88]Dmitry Chistikov
On Rationality of Nonnegative Matrix Factorization. SODA 2017: 1290-1305 - [c87]Nathanaël Fijalkow
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. STACS 2017: 29:1-29:13 - [i34]Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell:
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. CoRR abs/1701.02162 (2017) - [i33]Karin Quaas, Mahsa Shirmohammadi, James Worrell:
Revisiting Reachability in Timed Automata. CoRR abs/1702.03450 (2017) - [i32]Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell:
Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata. CoRR abs/1711.06120 (2017) - 2016
- [j28]Christoph Haase
Relating Reachability Problems in Timed and Counter Automata. Fundam. Informaticae 143(3-4): 317-338 (2016) - [j27]Ventsislav Chonev, Joël Ouaknine, James Worrell
On the Complexity of the Orbit Problem. J. ACM 63(3): 23:1-23:18 (2016) - [j26]Ranko Lazic, Joël Ouaknine, James Worrell
Zeno, Hercules, and the Hydra: Safety Metric Temporal Logic is Ackermann-Complete. ACM Trans. Comput. Log. 17(3): 16 (2016) - [j25]Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski
Complexity of Two-Variable Logic on Finite Trees. ACM Trans. Comput. Log. 17(4): 32 (2016) - [c86]Christel Baier
Markov Chains and Unambiguous Büchi Automata. CAV (1) 2016: 23-42 - [c85]Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell
Model Checking Flat Freeze LTL on One-Counter Automata. CONCUR 2016: 29:1-29:14 - [c84]Ventsislav Chonev, Joël Ouaknine, James Worrell
On the Skolem Problem for Continuous Linear Dynamical Systems. ICALP 2016: 100:1-100:13 - [c83]Dmitry Chistikov
On Restricted Nonnegative Matrix Factorization. ICALP 2016: 103:1-103:14 - [c82]Maria Bruna
Proving the Herman-Protocol Conjecture. ICALP 2016: 104:1-104:12 - [c81]Ventsislav Chonev, Joël Ouaknine, James Worrell
On Recurrent Reachability for Continuous Linear Dynamical Systems. LICS 2016: 515-524 - [c80]Joël Ouaknine, Amaury Pouly, João Sousa Pinto
Solvability of Matrix-Exponential Equations. LICS 2016: 798-806 - [i31]Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell:
Solvability of Matrix-Exponential Equations. CoRR abs/1601.05002 (2016) - [i30]Christel Baier, Stefan Kiefer, Joachim Klein, Sascha Klüppelholz, David Müller, James Worrell:
Markov Chains and Unambiguous Büchi Automata. CoRR abs/1605.00950 (2016) - [i29]Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell:
Nonnegative Matrix Factorization Requires Irrationality. CoRR abs/1605.06848 (2016) - [i28]Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell:
On Restricted Nonnegative Matrix Factorization. CoRR abs/1605.07061 (2016) - [i27]Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell:
Model Checking Flat Freeze LTL on One-Counter Automata. CoRR abs/1606.02643 (2016) - [i26]Shaull Almagor, Joël Ouaknine, James Worrell:
The Polytope-Collision Problem. CoRR abs/1611.01344 (2016) - 2015
- [j24]S. Akshay, Timos Antonopoulos, Joël Ouaknine
Reachability problems for Markov chains. Inf. Process. Lett. 115(2): 155-158 (2015) - [j23]Ines Marusic, James Worrell:
Complexity of equivalence and learning for multiplicity tree automata. J. Mach. Learn. Res. 16: 2465-2500 (2015) - [j22]Joël Ouaknine, James Worrell:
On linear recurrence sequences and loop termination. ACM SIGLOG News 2(2): 4-13 (2015) - [c79]James Worrell:
Reachability Problems for Continuous Linear Dynamical Systems (Invited Paper). CONCUR 2015: 17-17 - [c78]Stefan Kiefer, Ines Marusic, James Worrell
Minimisation of Multiplicity Tree Automata. FoSSaCS 2015: 297-311 - [c77]Timos Antonopoulos, Paul Hunter
Three Variables Suffice for Real-Time Logic. FoSSaCS 2015: 361-374 - [c76]James Worrell:
Reachability Problems for Continuous Linear Dynamical Systems (Invited Talk). FSTTCS 2015: 5-6 - [c75]Antonia Lechner, Joël Ouaknine
On the Complexity of Linear Arithmetic with Divisibility. LICS 2015: 667-676 - [c74]Ventsislav Chonev, Joël Ouaknine, James Worrell:
The Polyhedron-Hitting Problem. SODA 2015: 940-956 - [c73]Joël Ouaknine, João Sousa Pinto
On Termination of Integer Linear Loops. SODA 2015: 957-969 - [c72]Esther Galby
On Matrix Powering in Low Dimensions. STACS 2015: 329-340 - [i25]Maria Bruna, Radu Grigore, Stefan Kiefer, Joël Ouaknine, James Worrell:
Proving the Herman-Protocol Conjecture. CoRR abs/1504.01130 (2015) - [i24]Ventsislav Chonev, Joël Ouaknine, James Worrell:
On the Decidability of the Bounded Continuous Skolem Problem. CoRR abs/1506.00695 (2015) - [i23]Joël Ouaknine, João Sousa Pinto, James Worrell:
The Polyhedral Escape Problem is Decidable. CoRR abs/1507.03166 (2015) - [i22]Ventsislav Chonev, Joël Ouaknine, James Worrell:
On the Decidability of the Continuous Infinite Zeros Problem. CoRR abs/1507.03632 (2015) - 2014
- [j21]Vojtech Forejt, Petr Jancar
Language equivalence of probabilistic pushdown automata. Inf. Comput. 237: 1-11 (2014) - [c71]Franck van Breugel, James Worrell
The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata. Horizons of the Mind 2014: 191-213 - [c70]Joël Ouaknine
On the Positivity Problem for Simple Linear Recurrence Sequences, . ICALP (2) 2014: 318-329 - [c69]Joël Ouaknine
Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences. ICALP (2) 2014: 330-341 - [c68]Ines Marusic, James Worrell
Complexity of Equivalence and Learning for Multiplicity Tree Automata. MFCS (1) 2014: 414-425 - [c67]Hsi-Ming Ho, Joël Ouaknine, James Worrell:
Online Monitoring of Metric Temporal Logic. RV 2014: 178-192 - [c66]Joël Ouaknine, James Worrell:
Positivity Problems for Low-Order Linear Recurrence Sequences. SODA 2014: 366-379 - [e1]Joël Ouaknine, Igor Potapov, James Worrell:
Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings. Lecture Notes in Computer Science 8762, Springer 2014, ISBN 978-3-319-11438-5 [contents] - [i21]Ines Marusic, James Worrell:
Complexity of Equivalence and Learning for Multiplicity Tree Automata. CoRR abs/1405.0514 (2014) - [i20]Michael Benedikt, Rastislav Lenhardt, James Worrell:
Model Checking Markov Chains Against Unambiguous Buchi Automata. CoRR abs/1405.4560 (2014) - [i19]Ventsislav Chonev, Joël Ouaknine, James Worrell:
The Polyhedron-Hitting Problem. CoRR abs/1407.1889 (2014) - [i18]Joël Ouaknine, João Sousa Pinto, James Worrell:
On Termination of Integer Linear Loops. CoRR abs/1407.1891 (2014) - [i17]Timos Antonopoulos, Paul Hunter, Shahab Raza, James Worrell:
Three Variables are Enough for Real-Time Specification. CoRR abs/1408.1851 (2014) - 2013
- [j20]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell:
On the Complexity of Equivalence and Minimisation for Q-weighted Automata. Log. Methods Comput. Sci. 9(1) (2013) - [j19]Michael Benedikt
Two Variable vs. Linear Temporal Logic in Model Checking and Games. Log. Methods Comput. Sci. 9(2) (2013) - [j18]Joël Ouaknine
A Static Analysis Framework for Livelock Freedom in CSP. Log. Methods Comput. Sci. 9(3) (2013) - [j17]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine
Algorithmic probabilistic game semantics - Playing games with automata. Formal Methods Syst. Des. 43(2): 285-312 (2013) - [j16]Franck van Breugel, Claudio Hermida, Michael Makkai, James Worrell:
Addendum to "Recursively defined metric spaces without contraction" [TCS 380 (1/2) (2007) 143-163]. Theor. Comput. Sci. 492: 117-122 (2013) - [c65]Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine
Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points. ATVA 2013: 55-70 - [c64]Saguy Benaim, Michael Benedikt
Complexity of Two-Variable Logic on Finite Trees. ICALP (2) 2013: 74-88 - [c63]James Worrell
Revisiting the Equivalence Problem for Finite Multitape Automata. ICALP (2) 2013: 422-433 - [c62]Paul Hunter
Expressive Completeness for Metric Temporal Logic. LICS 2013: 349-357 - [c61]Ranko Lazic, Joël Ouaknine
Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian. MFCS 2013: 643-654 - [c60]Ventsislav Chonev, Joël Ouaknine
The orbit problem in higher dimensions. STOC 2013: 941-950 - [c59]Michael Benedikt
LTL Model Checking of Interval Markov Chains. TACAS 2013: 32-46 - [i16]Ventsislav Chonev, Joël Ouaknine, James Worrell:
The Orbit Problem in Higher Dimensions. CoRR abs/1303.2981 (2013) - [i15]James Worrell:
On the Complexity of Multitape Automata Equivalence. CoRR abs/1303.6704 (2013) - [i14]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) - [i13]Joël Ouaknine, James Worrell:
Positivity Problems for Low-Order Linear Recurrence Sequences. CoRR abs/1307.2779 (2013) - [i12]Joël Ouaknine, James Worrell:
Effective Positivity Problems for Simple Linear Recurrence Sequences. CoRR abs/1309.1550 (2013) - [i11]Joël Ouaknine, James Worrell:
Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences. CoRR abs/1309.1914 (2013) - 2012
- [j15]Patricia Bouyer, Nicolas Markey
On termination and invariance for faulty channel machines. Formal Aspects Comput. 24(4-6): 595-607 (2012) - [j14]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine
Three tokens in Herman's algorithm. Formal Aspects Comput. 24(4-6): 671-678 (2012) - [c58]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine
APEX: An Analyzer for Open Probabilistic Programs. CAV 2012: 693-698 - [c57]Philip J. Armstrong, Michael Goldsmith, Gavin Lowe, Joël Ouaknine
Recent Developments in FDR. CAV 2012: 699-704 - [c56]Stefan Göller, Christoph Haase
Branching-Time Model Checking of Parametric One-Counter Automata. FoSSaCS 2012: 406-420 - [c55]Di Chen, Franck van Breugel, James Worrell
On the Complexity of Computing Probabilistic Bisimilarity. FoSSaCS 2012: 437-451 - [c54]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine
On the Complexity of the Equivalence Problem for Probabilistic Automata. FoSSaCS 2012: 467-481 - [c53]Vojtech Forejt, Petr Jancar
Bisimilarity of Probabilistic Pushdown Automata. FSTTCS 2012: 448-460 - [c52]Daniel Bundala, Joël Ouaknine
On the Magnitude of Completeness Thresholds in Bounded Model Checking. LICS 2012: 155-164 - [c51]Michael Benedikt
Verification of Two-Variable Logic Revisited. QEST 2012: 114-123 - [c50]Joël Ouaknine
Decision Problems for Linear Recurrence Sequences. RP 2012: 21-28 - [c49]Christoph Haase
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
- [c48]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine
Language Equivalence for Probabilistic Automata. CAV 2011: 526-540 - [c47]Daniel Kroening
Linear Completeness Thresholds for Bounded Model Checking. CAV 2011: 557-572 - [c46]Byron Cook, Christoph Haase
Tractable Reasoning in a Fragment of Separation Logic. CONCUR 2011: 235-249 - [c45]Joël Ouaknine
Static Livelock Analysis in CSP. CONCUR 2011: 389-403 - [c44]Michael Benedikt
Two Variable vs. Linear Temporal Logic in Model Checking and Games. CONCUR 2011: 497-511 - [c43]Mark Jenkins, Joël Ouaknine
The Church Synthesis Problem with Metric. CSL 2011: 307-321 - [c42]Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine
On Reachability for Hybrid Automata over Bounded Time. ICALP (2) 2011: 416-427 - [c41]Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine
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
- [c40]Paul Hunter
Computing Rational Radical Sums in Uniform TC^0. FSTTCS 2010: 308-316 - [c39]Joël Ouaknine
Towards a Theory of Time-Bounded Verification. ICALP (2) 2010: 22-37 - [c38]Stefan Göller, Christoph Haase
Model Checking Succinct and Parametric One-Counter Automata. ICALP (2) 2010: 575-586 - [c37]Mark Jenkins, Joël Ouaknine
Alternating Timed Automata over Bounded Time. LICS 2010: 60-69 - [p1]Christoph Haase
On Process-Algebraic Extensions of Metric Temporal Logic. Reflections on the Work of C. A. R. Hoare 2010: 283-300
2000 – 2009
- 2009
- [c36]Christoph Haase
Reachability in Succinct and Parametric One-Counter Automata. CONCUR 2009: 369-383 - [c35]Joël Ouaknine
Time-Bounded Verification. CONCUR 2009: 496-510 - 2008
- [j13]Ranko Lazic, Thomas Christopher Newcomb, Joël Ouaknine, A. W. Roscoe, James Worrell:
Nets with Tokens which Carry Data. Fundam. Informaticae 88(3): 251-274 (2008) - [j12]Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, Karin Quaas, James Worrell:
Universality Analysis for One-Clock Timed Automata. Fundam. Informaticae 89(4): 419-450 (2008) - [j11]Franck van Breugel, Babita Sharma, James Worrell
Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems. Log. Methods Comput. Sci. 4(2) (2008) - [c34]Joël Ouaknine
Some Recent Results in Metric Temporal Logic. FORMATS 2008: 1-13 - [c33]Patricia Bouyer, Nicolas Markey
On Expressiveness and Complexity in Real-Time Model Checking. ICALP (2) 2008: 124-135 - [c32]James Worrell:
Model Checking and Decision Procedures for Probabilistic Automata and Markov Chains. QEST 2008: 322 - [c31]Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell:
On Termination for Faulty Channel Machines. STACS 2008: 121-132 - [c30]Axel Legay, Andrzej S. Murawski, Joël Ouaknine
On Automated Verification of Probabilistic Programs. TACAS 2008: 173-187 - [c29]James Worrell
Real-Time Model Checking: Algorithms and Complexity. TIME 2008: 19 - [i3]Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe 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
- [j10]Joël Ouaknine, James Worrell
On the decidability and complexity of Metric Temporal Logic over finite words. Log. Methods Comput. Sci. 3(1) (2007) - [j9]Franck van Breugel, Claudio Hermida, Michael Makkai, James Worrell
Recursively defined metric spaces without contraction. Theor. Comput. Sci. 380(1-2): 143-163 (2007) - [c28]Ranko Lazic, Thomas Christopher Newcomb, Joël Ouaknine, A. W. Roscoe, James Worrell:
Nets with Tokens Which Carry Data. ICATPN 2007: 301-320 - [c27]Sara Adams, Joël Ouaknine, James Worrell:
Undecidability of Universality for Timed Automata with Minimal Resources. FORMATS 2007: 25-37 - [c26]Franck van Breugel, Babita Sharma, James Worrell:
Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems. FoSSaCS 2007: 123-137 - [c25]Parosh Aziz Abdulla, Joël Ouaknine, Karin Quaas, James Worrell:
Zone-Based Universality Analysis for Single-Clock Timed Automata. FSEN 2007: 98-112 - [c24]Patricia Bouyer, Nicolas Markey
The Cost of Punctuality. LICS 2007: 109-120 - [c23]Michael W. Mislove
Labelled Markov Processes as Generalised Stochastic Relations. Computation, Meaning, and Logic 2007: 459-478 - [i1]Joël Ouaknine, James Worrell:
On the decidability and complexity of Metric Temporal Logic over finite words. CoRR abs/cs/0702120 (2007) - 2006
- [j8]Franck van Breugel, James Worrell
Approximating and computing behavioural distances in probabilistic transition systems. Theor. Comput. Sci. 360(1-3): 373-385 (2006) - [c22]Dusko Pavlovic, Michael W. Mislove
Testing Semantics: Connecting Processes and Process Logics. AMAST 2006: 308-322 - [c21]Joël Ouaknine
On Metric Temporal Logic and Faulty Turing Machines. FoSSaCS 2006: 217-230 - [c20]Joël Ouaknine
Safety Metric Temporal Logic Is Fully Decidable. TACAS 2006: 411-425 - 2005
- [j7]James Worrell
A note on coalgebras and presheaves. Math. Struct. Comput. Sci. 15(3): 475-483 (2005) - [j6]Franck van Breugel, James Worrell
A behavioural pseudometric for probabilistic transition systems. Theor. Comput. Sci. 331(1): 115-142 (2005) - [j5]Franck van Breugel, Michael W. Mislove
Domain theory, testing and simulation for labelled Markov processes. Theor. Comput. Sci. 333(1-2): 171-197 (2005) - [j4]James Worrell
On the final sequence of a finitary set functor. Theor. Comput. Sci. 338(1-3): 184-199 (2005) - [c19]Franck van Breugel, Claudio Hermida, Michael Makkai, James Worrell:
An Accessible Approach to Behavioural Pseudometrics. ICALP 2005: 1018-1030 - [c18]Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, James Worrell:
Decidability and Complexity Results for Timed Automata via Channel Machines. ICALP 2005: 1089-1101 - [c17]Joël Ouaknine, James Worrell:
On the Decidability of Metric Temporal Logic. LICS 2005: 188-197 - 2004
- [j3]Keye Martin, Michael W. Mislove
Measuring the probabilistic powerdomain. Theor. Comput. Sci. 312(1): 99-119 (2004) - [c16]Michael W. Mislove
Duality for Labelled Markov Processes. FoSSaCS 2004: 393-407 - [c15]Joël Ouaknine, James Worrell:
On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap. LICS 2004: 54-63 - 2003
- [j2]Joël Ouaknine, James Worrell:
Timed CSP = Closed Timed epsilon-automata. Nord. J. Comput. 10(2): 99-133 (2003) - [c14]Franck van Breugel, Michael W. Mislove
An Intrinsic Characterization of Approximate Probabilistic Bisimilarity. FoSSaCS 2003: 200-215 - [c13]Joël Ouaknine, James Worrell:
Universality and Language Inclusion for Open and Closed Timed Automata. HSCC 2003: 375-388 - [c12]Joël Ouaknine, James Worrell:
Revisiting Digitization, Robustness, and Decidability for Timed Automata. LICS 2003: 198-207 - [c11]Michael W. Mislove
Axioms for Probability and Nondeterminism. EXPRESS 2003: 7-28 - 2002
- [c10]Keye Martin, Michael W. Mislove
Measuring the Probabilistic Powerdomain. ICALP 2002: 463-475 - [c9]Franck van Breugel, Steven Shalit, James Worrell:
Testing Labelled Markov Processes. ICALP 2002: 537-548 - [c8]Joël Ouaknine, James Worrell
Timed CSP = Closed Timed Safety Automata. EXPRESS 2002: 142-159 - [c7]James Worrell
A Note on Coalgebras and Presheaves. CMCS 2002: 358-364 - 2001
- [j1]Peter T. Johnstone, John Power
On the structure of categories of coalgebras. Theor. Comput. Sci. 260(1-2): 87-117 (2001) - [c6]Franck van Breugel, James Worrell:
An Algorithm for Quantitative Verification of Probabilistic Transition Systems. CONCUR 2001: 336-350 - [c5]Franck van Breugel, James Worrell:
Towards Quantitative Verification of Probabilistic Transition Systems. ICALP 2001: 421-432 - 2000
- [c4]James Worrell
Coinduction for recursive data types: partial orders, metric spaces and Omega-categories. CMCS 2000: 337-356
1990 – 1999
- 1999
- [c3]James Worrell
Terminal sequences for accessible endofunctors. CMCS 1999: 24-38 - 1998
- [c2]Peter T. Johnstone, John Power, Toru Tsujishita, Hiroshi Watanabe
An Axiomatics for Categories of Transition Systems as Coalgebras. LICS 1998: 207-213 - [c1]James Worrell
Toposes of Coalgebras and Hidden Algebras. CMCS 1998: 212-230
Coauthor Index
[j52] [j51] [c145] [c144] [c143] [c142] [i87] [i85] [i84] [i83] [i81] [i77] [j49] [j48] [j46] [c140] [c137] [i74] [i73] [i71] [i70] [j43] [j42] [c136] [c135] [c134] [c130] [c128] [c127] [c126] [c125] [i67] [i66] [i63] [i62] [j39] [j38] [c123] [c122] [c121] [c119] [c118] [c117] [c116] [i60] [i59] [i57] [c115] [c114] [c112] [c111] [c110] [c109] [i56] [i55] [i54] [i53] [i51] [j36] [j35] [j34] [c107] [c106] [c105] [c102] [c101] [i50] [i48] [i47] [i46] [i44] [j32] [j31] [c100] [c99] [c96] [p2] [i41] [i40] [i39] [i37] [i35] [c95] [c93] [c92] [c87] [i34] [j28] [j27] [j26] [c85] [c84] [c82] [c81] [c80] [i31] [i27] [i26] [j24] [j22] [c75] [c74] [c73] [c72] [i25] [i24] [i23] [i22] [c70] [c69] [c67] [c66] [e1] [i19] [i18] [j20] [j18] [j17] [c65] [c62] [c61] [c60] [i16] [i13] [i12] [i11] [j15] [j14] [c58] [c57] [c56] [c54] [c52] [c50] [c49] [i10] [i9] [i7] [c48] [c47] [c46] [c45] [c43] [c42] [c41] [i6] [i5] [i4] [c40] [c39] [c38] [c37] [p1] [c36] [c35] [j13] [j12] [c34] [c33] [c31] [c30] [i3] [j10] [c28] [c27] [c25] [c24] [i1] [c21] [c20] [j5] [c18] [c17] [c16] [c15] [j2] [c14] [c13] [c12] [c11] [c8]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 20:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: