1 citations · 1 across the 1 of their papers we have counts for
4 papers
sweap: Reactive Synthesis for Infinite-State Integer Problems
Shaun Azzopardi, Luca Di Stefano, Nir Piterman
Recent years have seen a significant increase in the interest in reactive synthesis from specifications that relate to infinite state spaces. We present sweap, a tool for synthesis…
Symbolic Ï-automata with obligations
Luca Di Stefano
Extensions of Ï-automata to infinite alphabets typically rely on symbolic guards to keep the transition relation finite, and on registers or memory cells to preserve information f…
Execution and monitoring of HOA automata with HOAX
Luca Di Stefano
We present a tool called Hoax for the execution of Ï-automata expressed in the popular HOA format. The tool leverages the notion of trap sets to enable runtime monitoring of any (…
Full LTL Synthesis over Infinite-state Arenas
Shaun Azzopardi, Luca Di Stefano, Nir Piterman +1
Recently, interest has increased in applying reactive synthesis to richer-than-Boolean domains. A major (undecidable) challenge in this area is to establish when certain repeating…