most citedsweap: Reactive Synthesis for Infinite-State Integer Problems

1 citations · 2 across the 5 of their papers we have counts for

collaborators
Showing cs.LOShow all

5 papers · 1 filter

cs.LO20261 cited

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…

cs.LO2026

Symbolic Synthesis for LTLf+ Obligations

Giuseppe De Giacomo, Christian Hagemeier, Daniel Hausmann +1

We study synthesis for obligation properties expressed in LTLfp, the extension of LTLf to infinite traces. Obligation properties are positive Boolean combinations of safety and gua…

cs.LO2025

Emerson-Lei and Manna-Pnueli Games for LTLf+ and PPLTL+ Synthesis

Daniel Hausmann, Shufang Zhu, Gianmarco Parretti +3

Recently, the Manna-Pnueli Hierarchy has been used to define the temporal logics LTLfp and PPLTLp, which allow to use finite-trace LTLf/PPLTL techniques in infinite-trace settings…

cs.LO2025

On Reconfigurable Bisimulation, with an Application to the Distributed Synthesis Problem

Yehia Abd Alrahman, Nir Piterman

We consider the problem of distributing a centralised transition system to a set of asynchronous agents recognising the same language. Existing solutions are either manual or invol…

cs.LO2025

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…