52 citations · 142 across the 23 of their papers we have counts for
26 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…
Reaching as Cheap as Possible in 1-clock Robust Weighted Timed Games
Nathalie Bertrand, Maëlle Gautrin, Julie Parreaux
The value problem for 2-player games on graph generally consists in determining the minimal value Min can ensure against any possible strategy for Max. We consider here the value p…
Holistic Verification of Blockchain Consensus
Nathalie Bertrand, Vincent Gramoli, Igor Konnov +3
Blockchain has recently attracted the attention of the industry due, in part, to its ability to automate asset transfers. It requires distributed participants to reach a consensus…
Parameterized safety verification of round-based shared-memory systems
Nathalie Bertrand, Nicolas Markey, Ocan Sankur +1
We consider the parameterized verification problem for distributed algorithms where the goal is to develop techniques to prove the correctness of a given algorithm regardless of th…