10 citations · 16 across the 18 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2026
Certifying Almost-Sure Reachability in Unknown MDPs
S Akshay, Suguman Bansal, Gaurav Mahla
{\em Specification-Guided Reinforcement Learning (RL)} has largely concerned itself with \emph{learning} an optimal policy against a formal specification in an unknown {\em Markov…
cs.LO2025
INTERLEAVE: A Faster Symbolic Algorithm for Maximal End Component Decomposition
Suguman Bansal, Ramneet Singh
This paper presents a novel symbolic algorithm for the Maximal End Component (MEC) decomposition of a Markov Decision Process (MDP). The key idea behind our algorithm INTERLEAVE 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…