113 citations · 260 across the 57 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.LO2014★ 1 cited
The Cyclic-Routing UAV Problem is PSPACE-Complete
Hsi-Ming Ho, Joel Ouaknine
Consider a finite set of targets, with each target assigned a relative deadline, and each pair of targets assigned a fixed transit flight time. Given a flock of identical UAVs, can…
cs.CC2014
On Termination of Integer Linear Loops
Joël Ouaknine, João Sousa Pinto, James Worrell
A fundamental problem in program verification concerns the termination of simple linear loops of the form x := u ; while Bx >= b do {x := Ax + a} where x is a vector of variables,…
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…