2 papers
cs.GT2026
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…
cs.LO2026
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…