9 citations · 9 across the 3 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2017
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…
cs.CC2014
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…
cs.CC2013
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…