activity
20112026
most citedReasoning About Strategies: On the Model-Checking Problem

59 citations · 68 across the 20 of their papers we have counts for

collaborators
Showing 2026Show all

5 papers · 1 filter

cs.FL2026

From Ramsey-Based to Congruence-Based Constructions for Büchi Complementation

Yih-Kuen Tsay, Moshe Y. Vardi

The very first construction by J. Richard Büchi himself for complementing a Büchi automaton relies on a fundamental lemma about the division of an arbitrary infinite word into cons…

cs.LO2026

The Stochastic Target Discounted-Sum Problem

Nathalie Bertrand, Pranav Ghorpade, Senthil Rajasekaran +2

The target discounted-sum problem (TDS) asks, given a finite integer alphabet , a rational discount factor , and a rational target , whether some infinite sequence over $Σ…

cs.AI2026

Categorizer Automata for Discounted-Sum Payoffs

Nathalie Bertrand, Pranav Ghorpade, Senthil Rajasekaran +2

Categorizing continuous data into discrete bins is a fundamental operation in artificial intelligence. We introduce the categorizer automaton, a deterministic automaton that reads…

cs.GT2026

Modeling Concurrent Multi-Agent Systems

Senthil Rajasekaran, Moshe Y. Vardi

Recent work in the field of multi-agent systems has sought to use techniques and concepts from the field of formal methods to provide rigorous theoretical analysis and guarantees o…

cs.AI2026

TIDE: A Trace-Informed Depth-First Exploration for Planning with Temporally Extended Goals

Yuliia Suprun, Khen Elimelech, Lydia E. Kavraki +1

Task planning with temporally extended goals (TEGs) is a critical challenge in AI and robotics, enabling agents to achieve complex sequences of objectives over time rather than add…