10 citations · 16 across the 18 of their papers we have counts for
6 papers · 1 filter
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…
A Framework for Transforming Specifications in Reinforcement Learning
Rajeev Alur, Suguman Bansal, Osbert Bastani +1
Reactive synthesis algorithms allow automatic construction of policies to control an environment modeled as a Markov Decision Process (MDP) that are optimal with respect to high-le…
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…
Comparator automata in quantitative verification
Suguman Bansal, Swarat Chaudhuri, Moshe Y. Vardi
The notion of comparison between system runs is fundamental in formal verification. This concept is implicitly present in the verification of qualitative systems, and is more prono…