1 citations · 1 across the 5 of their papers we have counts for
4 papers · 1 filter
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…
Presburger Functional Synthesis: Complexity and Tractable Normal Forms
S. Akshay, A. R. Balasubramanian, Supratik Chakraborty +1
Given a relational specification between inputs and outputs as a logic formula, the problem of functional synthesis is to automatically synthesize a function from inputs to outputs…
On Dependent Variables in Reactive Synthesis
S. Akshay, Eliyahu Basa, Supratik Chakraborty +1
Given a Linear Temporal Logic (LTL) formula over input and output variables, reactive synthesis requires us to design a deterministic Mealy machine that gives the values of outputs…
Auditable Algorithms for Approximate Model Counting
Kuldeep S. Meel, Supratik Chakraborty, S. Akshay
Model counting, or counting the satisfying assignments of a Boolean formula, is a fundamental problem with diverse applications. Given #P-hardness of the problem, developing algori…