The following pages link to James Worrell (Q391131):
Displaying 50 items.
- (Q197933) (redirect page) (← links)
- Addendum to ``Recursively defined metric spaces without contraction'' (Q391132) (← links)
- Reachability problems for Markov chains (Q477610) (← links)
- On the final sequence of a finitary set functor (Q557796) (← links)
- Porous invariants (Q832262) (← links)
- Domain theory, testing and simulation for labelled Markov processes (Q1770416) (← links)
- A behavioural pseudometric for probabilistic transition systems (Q1770428) (← links)
- Measuring the probabilistic powerdomain (Q1884874) (← links)
- On termination and invariance for faulty channel machines (Q1941874) (← links)
- Three tokens in Herman's algorithm (Q1941880) (← links)
- First-order orbit queries (Q2048201) (← links)
- Probabilistic automata of bounded ambiguity (Q2064517) (← links)
- Costs and rewards in priced timed automata (Q2064528) (← links)
- Algebraic model checking for discrete linear dynamical systems (Q2112097) (← links)
- Algorithmic probabilistic game semantics. Playing games with automata (Q2248076) (← links)
- Language equivalence of probabilistic pushdown automata (Q2252520) (← links)
- Complete semialgebraic invariant synthesis for the Kannan-Lipton orbit problem (Q2321928) (← links)
- Effective definability of the reachability relation in timed automata (Q2338218) (← links)
- Recursively defined metric spaces without contraction (Q2373743) (← links)
- Approximating and computing behavioural distances in probabilistic transition systems (Q2503333) (← links)
- When are emptiness and containment decidable for probabilistic automata? (Q2662671) (← links)
- (Q2788371) (← links)
- A Note on Coalgebras and Presheaves (Q2842566) (← links)
- Timed CSP = Closed Timed Automata1 (Q2842610) (← links)
- (Q2847403) (← links)
- A Static Analysis Framework for Livelock Freedom in CSP (Q2848369) (← links)
- Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian (Q2849950) (← links)
- Labelled Markov Processes as Generalised Stochastic Relations (Q2864159) (← links)
- Branching-Time Model Checking of Parametric One-Counter Automata (Q2892786) (← links)
- On the Complexity of Computing Probabilistic Bisimilarity (Q2892788) (← links)
- On the Complexity of the Equivalence Problem for Probabilistic Automata (Q2892790) (← links)
- (Q2908860) (← links)
- (Q2915691) (← links)
- Complexity of Equivalence and Learning for Multiplicity Tree Automata (Q2922034) (← links)
- Minimisation of Multiplicity Tree Automata (Q2949446) (← links)
- Three Variables Suffice for Real-Time Logic (Q2949451) (← links)
- (Q2955006) (← links)
- Bisimilarity of Probabilistic Pushdown Automata (Q2957520) (← links)
- Relating Reachability Problems in Timed and Counter Automata (Q2968526) (← links)
- On the Magnitude of Completeness Thresholds in Bounded Model Checking (Q2986792) (← links)
- On Reachability for Hybrid Automata over Bounded Time (Q3012937) (← links)
- On Stabilization in Herman’s Algorithm (Q3012941) (← links)
- Linear Completeness Thresholds for Bounded Model Checking (Q3088266) (← links)
- Tractable Reasoning in a Fragment of Separation Logic (Q3090833) (← links)
- Static Livelock Analysis in CSP (Q3090843) (← links)
- Two Variable vs. Linear Temporal Logic in Model Checking and Games (Q3090852) (← links)
- On Process-Algebraic Extensions of Metric Temporal Logic (Q3163409) (← links)
- Model Checking Real-Time Systems (Q3176387) (← links)
- On the Complexity of the Orbit Problem (Q3177796) (← links)
- Reachability in Succinct and Parametric One-Counter Automata (Q3184686) (← links)
