1 citations · 2 across the 6 of their papers we have counts for
7 papers
Synthesis from Satisficing and Temporal Goals
Suguman Bansal, Lydia Kavraki, Moshe Y. Vardi +1
Reactive synthesis from high-level specifications that combine hard constraints expressed in Linear Temporal Logic LTL with soft constraints expressed by discounted-sum (DS) reward…
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…
On Satisficing in Quantitative Games
Suguman Bansal, Krishnendu Chatterjee, Moshe Y. Vardi
Several problems in planning and reactive synthesis can be reduced to the analysis of two-player quantitative graph games. {\em Optimization} is one form of analysis. We argue that…
Automata-based Quantitative Verification
Suguman Bansal
Quantitative analysis of computing systems is an emerging area in automated formal analysis. Such properties address aspects such as costs and rewards, quality measures, resource c…
Synthesis of coordination programs from linear temporal logic
Suguman Bansal, Kedar S. Namjoshi, Yaniv Sa'ar
This paper presents a method for synthesizing a reactive program which coordinates the actions of a group of other reactive programs, so that the combined system satisfies a tempor…
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…