Arrow Research search

Author name cluster

Ventsislav Chonev

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers
2 author rows

Possible papers

3

Highlights Conference 2016 Conference Abstract

On Recurrent Reachability for Continuous Linear Dynamical Systems

  • Ventsislav Chonev

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 equations. In this presentation we focus on the decision problem of whether the solution of a system of linear differential equations reaches a target halfspace infinitely often. This recurrent reachability problem can equivalently be formulated as the following Infinite Zeros Problem: does a real-valued function satisfying a given linear differential equation have infinitely many zeros on the non-negative reals? In our publication at LICS’16, we establish decidability in the case of a differential equation of order at most 7. On the other hand, in the same paper we show that a decision procedure for the Infinite Zeros Problem at order 9 (and above) would entail a major breakthrough in Diophantine Approximation, specifically an algorithm for computing the Lagrange constants of arbitrary real algebraic numbers to arbitrary precision. In this presentation, we will offer a high-level overview of the problem, followed by an outline of the techniques from model theory and transcendental number theory which proved most useful in establishing our results.

SODA Conference 2015 Conference Paper

The Polyhedron-Hitting Problem

  • Ventsislav Chonev
  • Joël Ouaknine
  • James Worrell 0001

We consider polyhedral versions of Kannan and Lip-ton's Orbit Problem [14, 13]—determining whether a target polyhedron V may be reached from a starting point x under repeated applications of a linear transformation A in an ambient vector space ℚ m. In the context of program verification, very similar reachability questions were also considered and left open by Lee and Yannakakis in [15], and by Braverman in [4]. We present what amounts to a complete characterisation of the decidability landscape for the Polyhedron-Hitting Problem, expressed as a function of the dimension m of the ambient space, together with the dimension of the polyhedral target V: more precisely, for each pair of dimensions, we either establish decidability, or show hardness for longstanding number-theoretic open problems.

STOC Conference 2013 Conference Paper

The orbit problem in higher dimensions

  • Ventsislav Chonev
  • Joël Ouaknine
  • James Worrell 0001

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 applications of a linear transformation A . Answering two questions posed by Kannan and Lipton in the 1980s, we show that when V has dimension one, this problem is solvable in polynomial time, and when V has dimension two or three, the problem is in NP RP .

v2026.09.13