30 citations · 51 across the 11 of their papers we have counts for
8 papers · 1 filter
Integer Programming with GCD Constraints
Rémy Defossez, Christoph Haase, Alessio Mansutti +1
We study the non-linear extension of integer programming with greatest common divisor constraints of the form , where and are linear polynomials, is a…
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…
The Complexity of Reachability in Parametric Markov Decision Processes
Sebastian Junges, Joost-Pieter Katoen, Guillermo A. Pérez +1
This article presents the complexity of reachability decision problems for parametric Markov decision processes (pMDPs), an extension to Markov decision processes (MDPs) where tran…
The Extended HOA Format for Synthesis
Guillermo A. Perez
We propose a small extension to the Hanoi Omega-Automata format to define reactive-synthesis problems. Namely, we add a "controllable-AP" header item specifying the subset of atomi…
On the Complexity of Reachability in Parametric Markov Decision Processes
Tobias Winkler, Sebastian Junges, Guillermo A. Pérez +1
This paper studies parametric Markov decision processes (pMDPs), an extension to Markov decision processes (MDPs) where transitions probabilities are described by polynomials over…
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…