3 papers
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…
cs.LO2025
Parameterized Model-checking of Discrete-Timed Networks and Symmetric-Broadcast Systems
Benjamin Aminof, Sasha Rubin, Francesco Spegni +1
We study the complexity of the model-checking problem for parameterized discrete-timed systems with arbitrarily many anonymous and identical processes, with and without a distingui…
cs.LO2024
LTLf+ and PPLTL+: Extending LTLf and PPLTL to Infinite Traces
Benjamin Aminof, Giuseppe De Giacomo, Sasha Rubin +1
We introduce LTLf+ and PPLTL+, two logics to express properties of infinite traces, that are based on the linear-time temporal logics LTLf and PPLTL on finite traces. LTLf+/PPLTL+…