54 citations · 95 across the 24 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.LO2019
Coverability in 1-VASS with Disequality Tests
Shaull Almagor, Nathann Cohen, Guillermo A. Pérez +2
We study a class of reachability problems in weighted graphs with constraints on the accumulated weight of paths. The problems we study can equivalently be formulated in the model…
cs.CC2019★ 1 cited
The Semialgebraic Orbit Problem
Shaull Almagor, Joël Oukanine, James Worrell
The Semialgebraic Orbit Problem is a fundamental reachability question that arises in the analysis of discrete-time linear dynamical systems such as automata, Markov chains, recurr…