no code implementations • 28 Jan 2021 • Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Oftermatt, Guillermo A. Pérez
Our three main results are as follows: (1) We prove that the reachability problem for COCA with global upper and lower bound tests is in NC2; (2) that, in general, the problem is decidable in polynomial time; and (3) that it is decidable in the polynomial hierarchy for COCA with parametric counter updates and bound tests.
Formal Languages and Automata Theory Logic in Computer Science
no code implementations • 7 May 2020 • Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kučera, Philipp J. Meyer
We present a sound and complete method for the verification of qualitative liveness properties of replicated systems under stochastic scheduling.
Logic in Computer Science Distributed, Parallel, and Cluster Computing
