Cover Image

On-the-fly LTLf Synthesis under Partial Observability

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Alon, Nadav, Chakraborty, Supratik, Duret-Lutz, Alexandre, Fried, Dror, Tabajara, Lucas M., Vardi, Moshe Y., Zhu, Shufang
Format:	Preprint
Published:	2026
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

LTLf Synthesis Under Unreliable Input
by: Hagemeier, Christian, et al.
Published: (2024)

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

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

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

Engineering an LTLf Synthesis Tool
by: Duret-Lutz, Alexandre, et al.
Published: (2025)

LTLf+ and PPLTL+: Extending LTLf and PPLTL to Infinite Traces
by: Aminof, Benjamin, et al.
Published: (2024)

Optimal LTLf Synthesis
by: Cao, Yujian, et al.
Published: (2026)

On-the-fly Synthesis for LTL over Finite Traces: An Efficient Approach that Counts
by: Xiao, Shengping, et al.
Published: (2024)

A Compositional Framework for On-the-Fly LTLf Synthesis
by: Li, Yongkang, et al.
Published: (2025)

Extending CDCL-based Model Enumeration with Weights
by: Spallitta, Giuseppe, et al.
Published: (2026)

Automata Linear Dynamic Logic on Finite Traces
by: Smith, Kevin W., et al.
Published: (2021)

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

Verifying Equilibria in Finite-Horizon Probabilistic Concurrent Game Systems
by: Rajasekaran, Senthil, et al.
Published: (2025)

Computing Short SAT Implicants via Ising/QUBO Encodings
by: Spallitta, Giuseppe, et al.
Published: (2026)

First-Order LTLf Synthesis with Lookback (Extended Version)
by: Winkler, Sarah
Published: (2025)

Dynamic Boolean Synthesis with Zero-suppressed Decision Diagrams
by: Lin, Yi, et al.
Published: (2025)

Efficient Incremental #SAT via Cross-Instance Knowledge Reuse
by: Bartal, Uriya, et al.
Published: (2026)

Algorithmic Perspective on Toda's Theorem
by: Fried, Dror, et al.
Published: (2025)

Multi-Property Synthesis
by: Weinhuber, Christoph, et al.
Published: (2026)

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

LTLf Synthesis on First-Order Agent Programs in Nondeterministic Environments
by: Hofmann, Till, et al.
Published: (2024)

Presburger Functional Synthesis: Complexity and Tractable Normal Forms
by: Akshay, S., et al.
Published: (2025)

Simplifying LTL Model Checking Given Prior Knowledge
by: Duret-Lutz, Alexandre, et al.
Published: (2025)

Program Synthesis for Non-Linear Real Arithmetic: Going Beyond Realizability
by: Akshay, S., et al.
Published: (2026)

Understanding CDCL Solvers via Scalability Studies and Proofdoors
by: Zhang, Shimin, et al.
Published: (2026)

Computing unsatisfiable cores for LTLf specifications
by: Roveri, Marco, et al.
Published: (2022)

Counting Answer Sets of Disjunctive Answer Set Programs
by: Kabir, Mohimenul, et al.
Published: (2025)

Enumerating Minimal Unsatisfiable Cores of LTLf formulas
by: Ielo, Antonio, et al.
Published: (2024)

Programming and Reasoning in Partially Observable Probabilistic Environments
by: Gürtler, Tobias, et al.
Published: (2025)

Forward and Backward Simulations for Partially Observable Probability
by: Chen, Chris, et al.
Published: (2025)

A Unified Automata-Theoretic Approach to LTLf Modulo Theories (Extended Version)
by: Faella, Marco, et al.
Published: (2024)

From Coalgebraic Determinization to Belief Construction for Partial Observability
by: Kori, Mayuko, et al.
Published: (2026)

The Trembling-Hand Problem for LTLf Planning
by: Yu, Pian, et al.
Published: (2024)

Solving MDPs with LTLf+ and PPLTL+ Temporal Objectives
by: De Giacomo, Giuseppe, et al.
Published: (2025)

A shallow dive into the depths of non-termination checking for C programs
by: Metta, Ravindra, et al.
Published: (2024)

Measuring Rule-based LTLf Process Specifications: A Probabilistic Data-driven Approach
by: Cecconi, Alessio, et al.
Published: (2023)

Thinking Out of the Box: Hybrid SAT Solving by Unconstrained Continuous Optimization
by: Zhang, Zhiwei, et al.
Published: (2025)

Incremental LTLf Synthesis
by: De Giacomo, Giuseppe, et al.
Published: (2026)

Knowledge Compilation for Quantification in Alternating Automata
by: Akshay, S., et al.
Published: (2026)

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