34 citations · 174 across the 26 of their papers we have counts for
5 papers · 1 filter
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…
Partial Solvers for Generalized Parity Games
Véronique Bruyère, Guillermo A. Pérez, Jean-François Raskin +1
Parity games have been broadly studied in recent years for their applications to controller synthesis and verification. In practice, partial solvers for parity games that execute i…
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…
Alternating Weak Automata from Universal Trees
Laure Daviaud, Marcin Jurdziński, Karoliina Lehtinen
An improved translation from alternating parity automata on infinite words to alternating weak automata is given. The blow-up of the number of states is related to the size of the…
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…