activity
20172026
most citedLTLf Synthesis under Partial Observability: From Theory to Practice

7 citations · 17 across the 10 of their papers we have counts for

collaborators

11 papers

cs.LO2026

On-the-fly LTLf Synthesis under Partial Observability

Nadav Alon, Supratik Chakraborty, Alexandre Duret-Lutz +4

LTLf synthesis under partial observability requires reasoning about unobservable environment variables, which is typically handled by constructing a belief-state DFA via subset con…

cs.FL2024

Dynamic Programming for Symbolic Boolean Realizability and Synthesis

Yi Lin, Lucas M. Tabajara, Moshe Y. Vardi

Inspired by recent progress in dynamic programming approaches for weighted model counting, we investigate a dynamic-programming approach in the context of boolean realizability and…

cs.FL2023★ 2 cited

Model Checking Strategies from Synthesis Over Finite Traces

Suguman Bansal, Yong Li, Lucas Martinelli Tabajara +2

The innovations in reactive synthesis from {\em Linear Temporal Logics over finite traces} (LTLf) will be amplified by the ability to verify the correctness of the strategies gener…

cs.FL2021★ 1 cited

Adapting Behaviors via Reactive Synthesis

Gal Amram, Suguman Bansal, Dror Fried +3

In the \emph{Adapter Design Pattern}, a programmer implements a \emph{Target} interface by constructing an \emph{Adapter} that accesses an existing \emph{Adaptee} code. In this wor…

cs.LO2020★ 7 cited

LTLf Synthesis under Partial Observability: From Theory to Practice

Lucas M. Tabajara, Moshe Y. Vardi

LTL synthesis is the problem of synthesizing a reactive system from a formal specification in Linear Temporal Logic. The extension of allowing for partial observability, where the…

cs.FL2020★ 4 cited

On the Power of Automata Minimization in Reactive Synthesis

Shufang Zhu, Lucas M. Tabajara, Geguang Pu +1

Temporal logic is often used to describe temporal properties in AI applications. The most popular language for doing so is Linear Temporal Logic (LTL). Recently, LTL on finite trac…

cs.FL2019

Witnessing Secure Compilation

Kedar S. Namjoshi, Lucas M. Tabajara

Compiler optimizations are designed to improve run-time performance while preserving input-output behavior. Correctness in this sense does not necessarily preserve security: it is…

cs.LO2019

Hybrid Compositional Reasoning for Reactive Synthesis from Finite-Horizon Specifications

Suguman Bansal, Yong Li, Lucas M. Tabajara +1

LTLf synthesis is the automated construction of a reactive system from a high-level description, expressed in LTLf, of its finite-horizon behavior. So far, the conversion of LTLf f…

cs.LO2018

Functional Synthesis via Input-Output Separation

Supratik Chakraborty, Dror Fried, Lucas M. Tabajara +1

Boolean functional synthesis is the process of constructing a Boolean function from a Boolean specification that relates input and output variables. Despite significant recent deve…

cs.LO2017★ 2 cited

A Symbolic Approach to Safety LTL Synthesis

Shufang Zhu, Lucas M. Tabajara, Jianwen Li +2

Temporal synthesis is the automated design of a system that interacts with an environment, using the declarative specification of the system's behavior. A popular language for prov…

cs.LO2017★ 1 cited

Symbolic LTLf Synthesis

Shufang Zhu, Lucas M. Tabajara, Jianwen Li +2

LTLf synthesis is the process of finding a strategy that satisfies a linear temporal specification over finite traces. An existing solution to this problem relies on a reduction to…