1 citations · 1 across the 4 of their papers we have counts for
5 papers
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 $Σ…
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…
Parameterized Verification of Asynchronous Round-Based Distributed Algorithms via Reduction to Finite-Counter Systems
Nathalie Bertrand, Pranav Ghorpade, Sasha Rubin
Traditional model-checking techniques typically verify distributed algorithms only for a fixed number of finite-state processes. Parameterized model checking generalizes this to an…
Reusable Formal Verification of DAG-based Consensus Protocols
Nathalie Bertrand, Pranav Ghorpade, Sasha Rubin +2
Blockchains use consensus protocols to reach agreement, e.g., on the ordering of transactions. DAG-based consensus protocols are increasingly adopted by blockchain companies to red…
A Game of Pawns
Guy Avni, Pranav Ghorpade, Shibashis Guha
We introduce and study pawn games, a class of two-player zero-sum turn-based graph games. A turn-based graph game proceeds by placing a token on an initial vertex, and whoever cont…