9 citations · 9 across the 3 of their papers we have counts for
6 papers
Infinite-Duration Bidding Games
Guy Avni, Thomas A. Henzinger, Ventsislav Chonev
Two-player games on graphs are widely studied in formal methods as they model the interaction between a system and its environment. The game is played by moving a token throughout…
Reachability in Augmented Interval Markov Chains
Ventsislav Chonev
In this paper we propose augmented interval Markov chains (AIMCs): a generalisation of the familiar interval Markov chains (IMCs) where uncertain transition probabilities are in ad…
On Recurrent Reachability for Continuous Linear Dynamical Systems
Ventsislav Chonev, Joel Ouaknine, James Worrell
The continuous evolution of a wide variety of systems, including continuous-time Markov chains and linear hybrid automata, can be described in terms of linear differential equation…
On the Skolem Problem for Continuous Linear Dynamical Systems
Ventsislav Chonev, Joel Ouaknine, James Worrell
The Continuous Skolem Problem asks whether a real-valued function satisfying a linear differential equation has a zero in a given interval of real numbers. This is a fundamental re…
The Polyhedron-Hitting Problem
Ventsislav Chonev, Joël Ouaknine, James Worrell
We consider polyhedral versions of Kannan and Lipton's Orbit Problem (STOC '80 and JACM '86)---determining whether a target polyhedron V may be reached from a starting point x unde…
On the Complexity of the Orbit Problem
Ventsislav Chonev, Joël Ouaknine, James Worrell
We consider higher-dimensional versions of Kannan and Lipton's Orbit Problem---determining whether a target vector space V may be reached from a starting point x under repeated app…