Cover Image

sweap: Reactive Synthesis for Infinite-State Integer Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Azzopardi, Shaun, Di Stefano, Luca, Piterman, Nir
Format:	Preprint
Published:	2026
Subjects:	Logic in Computer Science Formal Languages and Automata Theory Systems and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Full LTL Synthesis over Infinite-state Arenas
by: Azzopardi, Shaun, et al.
Published: (2023)

A Direct Translation from LTL with Past to Deterministic Rabin Automata
by: Azzopardi, Shaun, et al.
Published: (2024)

Fast Obligation Translation and Synthesis
by: Duret-Lutz, Alexandre, et al.
Published: (2026)

Symbolic Synthesis for LTLf+ Obligations
by: De Giacomo, Giuseppe, et al.
Published: (2026)

Symbolic ω-automata with obligations
by: Di Stefano, Luca
Published: (2025)

Execution and monitoring of HOA automata with HOAX
by: Di Stefano, Luca
Published: (2025)

Emerson-Lei and Manna-Pnueli Games for LTLf+ and PPLTL+ Synthesis
by: Hausmann, Daniel, et al.
Published: (2025)

On Dependent Variables in Reactive Synthesis
by: Akshay, S., et al.
Published: (2024)

Safety Verification of Stochastic Systems under Signal Temporal Logic Specifications
by: Ma, Liqian, et al.
Published: (2025)

Algorithmic analysis of systems with affine input and polynomial state
by: Clemente, Lorenzo
Published: (2025)

Synthesis of Computable Regular Functions of Infinite Words
by: Dave, V., et al.
Published: (2019)

Parikh Automata on Finite and Infinite Words
by: Grobler, Mario, et al.
Published: (2023)

Large Scale Geometries of Infinite Strings
by: Khoussainov, Bakhadyr, et al.
Published: (2019)

Beyond Decisiveness of Infinite Markov Chains
by: Barbot, Benoît, et al.
Published: (2024)

Quasi-Isometric Reductions Between Infinite Strings
by: Celine, Karen Frilya, et al.
Published: (2024)

Automaton-based Characterisations of First Order Logic over Infinite Trees
by: Benerecetti, Massimo, et al.
Published: (2026)

Synthesizing Computable Functions from Rational Specifications over Infinite Words
by: Filiot, Emmanuel, et al.
Published: (2021)

An Automaton-based Characterisation of First-Order Logic over Infinite Trees
by: Benerecetti, Massimo, et al.
Published: (2025)

From Sound Workflow Nets to LTLf Declarative Specifications by Casting Three Spells
by: Barbaro, Luca, et al.
Published: (2025)

Faster and Smaller Solutions of Obliging Games
by: Hausmann, Daniel, et al.
Published: (2024)

Integrating Graceful Degradation and Recovery through Requirement-driven Adaptation
by: Chu, Simon, et al.
Published: (2024)

Data-Driven Abstractions via Binary-Tree Gaussian Processes for Formal Verification
by: Schön, Oliver, et al.
Published: (2024)

Decidability Problems for Micro-Stipula
by: Delzanno, Giorgio, et al.
Published: (2025)

On the Reachability Problem for Two-Dimensional Branching VASS
by: Bizière, Clotilde, et al.
Published: (2025)

A Uniform Framework for Language Inclusion Problems
by: Doveri, Kyveli, et al.
Published: (2024)

Policy Synthesis for Interval MDPs via Polyhedral Lyapunov Functions
by: Monir, Negar, et al.
Published: (2026)

The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations
by: Bozga, Marius, et al.
Published: (2023)

Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
by: Mandrioli, Dino, et al.
Published: (2020)

The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
by: Daviaud, Laure, et al.
Published: (2023)

Dynamic Programming for Symbolic Boolean Realizability and Synthesis
by: Lin, Yi, et al.
Published: (2024)

Proceedings of the Combined 32nd International Workshop on Expressiveness in Concurrency and 22nd Workshop on Structural Operational Semantics
by: Di Giusto, Cinzia, et al.
Published: (2025)

Proceedings Combined 31st International Workshop on Expressiveness in Concurrency and 21st Workshop on Structural Operational Semantics
by: Caltais, Georgiana, et al.
Published: (2024)

Automata-less Monitoring via Trace-Checking (Extended Version)
by: Brunello, Andrea, et al.
Published: (2025)

From Trees to Tree-Like: Distribution and Synthesis for Asynchronous Automata
by: Lehaut, Mathieu, et al.
Published: (2026)

On the Impact of the Communication Model on Realisability
by: Di Giusto, Cinzia, et al.
Published: (2025)

Verifying Asynchronous Hyperproperties in Reactive Systems
by: Beutner, Raven, et al.
Published: (2025)

The Tractability Border of Reachability in Simple Vector Addition Systems with States
by: Chistikov, Dmitry, et al.
Published: (2024)

Reachability in Vector Addition System with States Parameterized by Geometric Dimension
by: Zheng, Yangluo
Published: (2024)

HornStr: Invariant Synthesis for Regular Model Checking as Constrained Horn Clauses(Technical Report)
by: Jiang, Hongjian, et al.
Published: (2025)

Adding Reconfiguration to Zielonka's Asynchronous Automata
by: Lehaut, Mathieu, et al.
Published: (2023)