activity
20192026
most citedData-Driven Abstraction-Based Control Synthesis

5 citations · 11 across the 8 of their papers we have counts for

collaborators

10 papers

cs.PF2026

Learning Metastable Dynamics

Rupak Majumdar, Mahmoud Salamati, Nikhil Singh +1

Metastability---a phenomenon where systems remain trapped in quasi-stable states before abruptly transitioning under rare perturbations---is ubiquitous in physical systems. Althoug…

cs.PF2025

Formal Analysis of Metastable Failures in Software Systems

Peter Alvaro, Rebecca Isaacs, Rupak Majumdar +3

Many large-scale software systems demonstrate metastable failures. In this class of failures, a stressor such as a temporary spike in workload causes the system performance to drop…

eess.SY2024

Logic-based Knowledge Awareness for Autonomous Agents in Continuous Spaces

Arabinda Ghosh, Mahmoud Salamati, Sadegh Soudjani

This paper presents a step towards a formal controller design method for autonomous agents based on knowledge awareness to improve decision-making. Our approach is to first create…

cs.AI2024

Regret-Free Reinforcement Learning for LTL Specifications

Rupak Majumdar, Mahmoud Salamati, Sadegh Soudjani

Learning to control an unknown dynamical system with respect to high-level temporal specifications is an important problem in control theory. We present the first regret-free onlin…

eess.SY2023★ 1 cited

Neural Abstraction-Based Controller Synthesis and Deployment

Rupak Majumdar, Mahmoud Salamati, Sadegh Soudjani

Abstraction-based techniques are an attractive approach for synthesizing correct-by-construction controllers to satisfy high-level temporal requirements. A main bottleneck for succ…

eess.SY2022★ 5 cited

Data-Driven Abstraction-Based Control Synthesis

Milad Kazemi, Rupak Majumdar, Mahmoud Salamati +2

This paper studies formal synthesis of controllers for continuous-space systems with unknown dynamics to satisfy requirements expressed as linear temporal logic formulas. Formal ab…

cs.LO2022

The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems

Julian D'Costa, Toghrul Karimov, Rupak Majumdar +3

We study fundamental reachability problems on pseudo-orbits of linear dynamical systems. Pseudo-orbits can be viewed as a model of computation with limited precision and pseudo-rea…

eess.SY2020★ 3 cited

On Decidability of Time-bounded Reachability in CTMDPs

Rupak Majumdar, Mahmoud Salamati, Sadegh Soudjani

We consider the time-bounded reachability problem for continuous-time Markov decision processes. We show that the problem is decidable subject to Schanuel's conjecture. Our decisio…

eess.SY2019

A Lyapunov Approach for Time Bounded Reachability of CTMCs and CTMDPs

Mahmoud Salamati, Sadegh Soudjani, Rupak Majumdar

Time bounded reachability is a fundamental problem in model checking continuous-time Markov chains (CTMCs) and Markov decision processes (CTMDPs) for specifications in continuous s…

cs.LG2019★ 2 cited

Perception-in-the-Loop Adversarial Examples

Mahmoud Salamati, Sadegh Soudjani, Rupak Majumdar

We present a scalable, black box, perception-in-the-loop technique to find adversarial examples for deep neural network classifiers. Black box means that our procedure only has inp…