2 papers
cs.LO2022
The Geometry of Reachability in Continuous Vector Addition Systems with States
Shaull Almagor, Arka Ghosh, Tim Leys +1
We study the geometry of reachability sets of continuous vector addition systems with states (VASS). In particular we establish that they are almost Minkowski sums of convex cones…
cs.FL2021
Continuous One-Counter Automata
Michael Blondin, Tim Leys, Filip Mazowiecki +2
We study the reachability problem for continuous one-counter automata, COCA for short. In such automata, transitions are guarded by upper and lower bound tests against the counter…