BibSLEIGH — James

Travelled to:

1 × Canada
1 × Croatia
1 × Denmark
1 × Estonia
1 × Finland
1 × France
1 × Greece
1 × Hungary
1 × Iceland
1 × Italy
1 × Japan
1 × Latvia
1 × Norway
1 × Switzerland
2 × Austria
2 × Poland
2 × Portugal
2 × Spain
2 × United Kingdom
6 × USA

Collaborated with:

J.Ouaknine F.v.Breugel S.Kiefer A.S.Murawski M.W.Mislove B.Wachter P.Hunter ∅ S.Göller C.Haase M.Jenkins A.Rabinovich P.Bouyer N.Markey M.Benedikt R.Lenhardt I.Marusic A.Lechner V.Chonev D.Chen D.Bundala B.Sharma S.Shalit K.Martin T.Antonopoulos S.Raza A.Legay P.A.Abdulla J.Deneux C.Hermida M.Makkai D.Pavlovic D.Kröning O.Strichman T.Wahl L.Zhang P.Johnstone J.Power T.Tsujishita H.Watanabe T.Brihaye L.Doyen G.Geeraerts J.Raskin S.Benaim W.Charatonik E.Kieronski F.Mazowiecki P.J.Armstrong M.Goldsmith G.Lowe H.Palikareva A.W.Roscoe

Talks about:

automata (11) time (10) probabilist (9) problem (6) complex (6) model (6) logic (6) decid (6) check (6) metric (5)

Person: James Worrell

DBLP: Worrell:James

Contributed to:

2015

2014

2013

2012

2011

2010

2008

2007

2006

2005

2004

2003

2002

2001

1998

Wrote 41 papers:

FoSSaCS-2015-AntonopoulosHRW #logic #realtime: Three Variables Suffice for Real-Time Logic (TA, PH, SR, JW), pp. 361–374.
FoSSaCS-2015-KieferMW #automaton #multi: Minimisation of Multiplicity Tree Automata (SK, IM, JW), pp. 297–311.
LICS-2015-LechnerOW #complexity #linear #on the: On the Complexity of Linear Arithmetic with Divisibility (AL, JO, JW), pp. 667–676.
ICALP-v2-2014-OuaknineW #linear #on the #problem #sequence: On the Positivity Problem for Simple Linear Recurrence Sequences, (JO, JW), pp. 318–329.
ICALP-v2-2014-OuaknineW14a #decidability #linear #sequence: Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences (JO, JW), pp. 330–341.
ICALP-v2-2013-BenaimBCKLMW #complexity #finite #logic: Complexity of Two-Variable Logic on Finite Trees (SB, MB, WC, EK, RL, FM, JW), pp. 74–88.
ICALP-v2-2013-Worrell #automaton #equivalence #finite #multi #problem: Revisiting the Equivalence Problem for Finite Multitape Automata (JW), pp. 422–433.
LICS-2013-HunterOW #logic #metric: Expressive Completeness for Metric Temporal Logic (PH, JO, JW), pp. 349–357.
STOC-2013-ChonevOW #problem: The orbit problem in higher dimensions (VC, JO, JW), pp. 941–950.
TACAS-2013-BenediktLW #ltl #markov #model checking: LTL Model Checking of Interval Markov Chains (MB, RL, JW), pp. 32–46.
CAV-2012-ArmstrongGLOPRW: Recent Developments in FDR (PJA, MG, GL, JO, HP, AWR, JW), pp. 699–704.
CAV-2012-KieferMOWW #named #probability #source code: APEX: An Analyzer for Open Probabilistic Programs (SK, ASM, JO, BW, JW), pp. 693–698.
FoSSaCS-2012-ChenBW #complexity #on the #probability #similarity: On the Complexity of Computing Probabilistic Bisimilarity (DC, FvB, JW), pp. 437–451.
FoSSaCS-2012-GollerHOW #automaton #model checking #parametricity: Branching-Time Model Checking of Parametric One-Counter Automata (SG, CH, JO, JW), pp. 406–420.
FoSSaCS-2012-KieferMOWW #automaton #complexity #equivalence #on the #probability #problem: On the Complexity of the Equivalence Problem for Probabilistic Automata (SK, ASM, JO, BW, JW), pp. 467–481.
LICS-2012-BundalaOW #bound #model checking #on the: On the Magnitude of Completeness Thresholds in Bounded Model Checking (DB, JO, JW), pp. 155–164.
CAV-2011-KieferMOWW #automaton #equivalence #probability: Language Equivalence for Probabilistic Automata (SK, ASM, JO, BW, JW), pp. 526–540.
CAV-2011-KroeningOSWW #bound #linear #model checking: Linear Completeness Thresholds for Bounded Model Checking (DK, JO, OS, TW, JW), pp. 557–572.
CSL-2011-JenkinsORW #metric #problem #synthesis: The Church Synthesis Problem with Metric (MJ, JO, AR, JW), pp. 307–321.
ICALP-v2-2011-BrihayeDGORW #automaton #bound #hybrid #on the #reachability: On Reachability for Hybrid Automata over Bounded Time (TB, LD, GG, JO, JFR, JW), pp. 416–427.
ICALP-v2-2011-KieferMOWZ #algorithm #on the: On Stabilization in Herman’s Algorithm (SK, ASM, JO, JW, LZ), pp. 466–477.
ICALP-v2-2010-GollerHOW #automaton #model checking #parametricity: Model Checking Succinct and Parametric One-Counter Automata (SG, CH, JO, JW), pp. 575–586.
ICALP-v2-2010-OuaknineW #bound #formal method #towards #verification: Towards a Theory of Time-Bounded Verification (JO, JW), pp. 22–37.
LICS-2010-JenkinsORW #automaton #bound: Alternating Timed Automata over Bounded Time (MJ, JO, AR, JW), pp. 60–69.
ICALP-B-2008-BouyerMOW #complexity #model checking #on the #realtime: On Expressiveness and Complexity in Real-Time Model Checking (PB, NM, JO, JW), pp. 124–135.
TACAS-2008-LegayMOW #automation #on the #probability #source code #verification: On Automated Verification of Probabilistic Programs (AL, ASM, JO, JW), pp. 173–187.
FoSSaCS-2007-BreugelSW #approximate #behaviour #probability #pseudo: Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems (FvB, BS, JW), pp. 123–137.
LICS-2007-BouyerMOW #cost analysis: The Cost of Punctuality (PB, NM, JO, JW), pp. 109–120.
FoSSaCS-2006-OuaknineW #logic #metric #on the #turing machine: On Metric Temporal Logic and Faulty Turing Machines (JO, JW), pp. 217–230.
TACAS-2006-OuaknineW #decidability #logic #metric #safety: Safety Metric Temporal Logic Is Fully Decidable (JO, JW), pp. 411–425.
ICALP-2005-AbdullaDOW #automaton #complexity #decidability: Decidability and Complexity Results for Timed Automata via Channel Machines (PAA, JD, JO, JW), pp. 1089–1101.
ICALP-2005-BreugelHMW #approach #behaviour #pseudo: An Accessible Approach to Behavioural Pseudometrics (FvB, CH, MM, JW), pp. 1018–1030.
LICS-2005-OuaknineW #decidability #logic #metric #on the: On the Decidability of Metric Temporal Logic (JO, JW), pp. 188–197.
FoSSaCS-2004-MisloveOPW #markov #process: Duality for Labelled Markov Processes (MWM, JO, DP, JW), pp. 393–407.
LICS-2004-OuaknineW #automaton #decidability #on the #problem: On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap (JO, JW), pp. 54–63.
FoSSaCS-2003-BreugelMOW #approximate #probability #similarity: An Intrinsic Characterization of Approximate Probabilistic Bisimilarity (FvB, MWM, JO, JW), pp. 200–215.
LICS-2003-OuaknineW #automaton #decidability #robust: Revisiting Digitization, Robustness, and Decidability for Timed Automata (JO, JW), pp. 198–207.
ICALP-2002-BreugelSW #markov #process #testing: Testing Labelled Markov Processes (FvB, SS, JW), pp. 537–548.
ICALP-2002-MartinMW #probability: Measuring the Probabilistic Powerdomain (KM, MWM, JW), pp. 463–475.
ICALP-2001-BreugelW #probability #towards #verification: Towards Quantitative Verification of Probabilistic Transition Systems (FvB, JW), pp. 421–432.
LICS-1998-JohnstonePTWW #algebra #axiom #category theory: An Axiomatics for Categories of Transition Systems as Coalgebras (PJ, JP, TT, HW, JW), pp. 207–213.