5 citations · 6 across the 9 of their papers we have counts for
11 papers
MENTOR: Procedural Shielding of Tool-Using LLM Agents
Ashwani Anand, Ivi Chatzi, Ritam Raha +1
Tool-using LLM agents are increasingly used to automate workflows governed by procedural manuals, such as company rules for booking travel or procuring hardware. These manuals are…
MANTRA: Synthesizing SMT-Validated Compliance Benchmarks for Tool-Using LLM Agents
Ashwani Anand, Ivi Chatzi, Ritam Raha +1
Tool-using large language model (LLM) agents are increasingly deployed in settings where their reliable behavior is governed by strict procedural manuals. Ensuring that such agents…
About Time: Model-free Reinforcement Learning with Timed Reward Machines
Rajarshi Roy, Anirban Majumdar, Ritam Raha +2
Reward specification plays a central role in reinforcement learning (RL), guiding the agent's behavior. To express non-Markovian rewards, formalisms such as reward machines have be…
Maximal Adaptation, Minimal Guidance: Permissive Reactive Robot Task Planning with Humans in the Loop
Oz Gitelson, Satya Prakash Nayak, Ritam Raha +1
We present a novel framework for human-robot \emph{logical} interaction that enables robots to reliably satisfy (infinite horizon) temporal logic tasks while effectively collaborat…
Follow the STARs: Dynamic -Regular Shielding of Learned Policies
Ashwani Anand, Satya Prakash Nayak, Ritam Raha +1
This paper presents a novel dynamic post-shielding framework that enforces the full class of -regular correctness properties over pre-computed probabilistic policies. This const…
Quantitative Strategy Templates
Ashwani Anand, Satya Prakash Nayak, Ritam Raha +2
This paper presents (permissive) \emph{Quantitative Strategy Templates} (QaSTels) to succinctly represent infinitely many winning strategies in two-player energy and mean-payoff ga…
Fair Quantitative Games
Ashwani Anand, Satya Prakash Nayak, Ritam Raha +2
We examine two-player games over finite weighted graphs with quantitative (mean-payoff or energy) objective, where one of the players additionally needs to satisfy a fairness objec…
Synthesizing Efficiently Monitorable Formulas in Metric Temporal Logic
Ritam Raha, Rajarshi Roy, Nathanael Fijalkow +2
In runtime verification, manually formalizing a specification for monitoring system executions is a tedious and error-prone process. To address this issue, we consider the problem…
Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic
Ritam Raha, Rajarshi Roy, Nathanaël Fijalkow +1
Linear temporal logic (LTL) is a specification language for finite sequences (called traces) widely used in program verification, motion planning in robotics, process mining, and m…
Revisiting Parameter Synthesis for One-Counter Automata
Guillermo A. Pérez, Ritam Raha
We study the (parameter) synthesis problem for one-counter automata with parameters. One-counter automata are obtained by extending classical finite-state automata with a counter w…
Reachability Games with Relaxed Energy Constraints
Loïc Hélouët, Nicolas Markey, Ritam Raha
We study games with reachability objectives under energy constraints. We first prove that under strict energy constraints (either only lower-bound constraint or interval constraint…