Safety problems in networks with shared counters become solvable under restrictions

Safety Analysis of Parameterized Networks with Shared Counters

Logic in Computer Science

Summary

The paper looks at computer networks with many processes sharing counters that can be changed or checked for zero. It studies whether a certain state can be reached by one or all processes, which is usually impossible to decide. The authors found that if there is only one counter or if zero-checks are not allowed, these problems become solvable with efficient methods. Their work helps understand exactly when these types of safety checks can be done by computers.

What this means in practice

A theory result. No direct application yet.

Authors

June Roupin, Arnaud Sangnier

Abstract

We study networks with an unbounded number of processes sharing some natural counters that can be decremented, incremented and tested to zero. We look at two safety problems: the first one asks whether there is a network with an execution bringing a process in a given final state and the other one asks the execution to bring all the processes in the final state. In their full generality, these two problems are undecidable, but we show that decidability can be regained by either using a single counter or by forbidding the use of zero-tests (as it is is the case in Vector Addition Systems with States). For these decidable cases, we obtain low complexity results, the problems being solvable either in non-deterministic logarithmic space or in polynomial time.