2025/05/19 by Yousef Shakiba, Shakiba, Yousef, Henry Sinclair-Banks +3 · 1 citation
Computer Science · #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO) #Machine Learning and Algorithms #Quantum Computing Algorithms and Architecture #Quantum-Dot Cellular Automata
paper · pdf · doi:10.48550/arxiv.2505.13749
openalex publication_date 2025/05/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In many kinds of infinite-state systems, the coverability problem has significantly lower complexity than the reachability problem. In order to delineate the border of computational hardness between coverability and reachability, we propose to place these problems in a more general context, which makes it possible to prove complexity dichotomies. The more general setting arises as follows. We note that for coverability, we are given a vector t and are asked if there is a reachable vector x satisfying the relation x≥ t. For reachability, we want to satisfy the relation x=t. In the more general setting, there is a Presburger formula φ(t,x), and we are given t and are asked if there is a reachable x with φ(t,x). We study this setting for systems with one counter and binary updates: (i) integer VASS, (ii) Parikh automata, and (i) standard (non-negative) VASS. In each of these cases, reachability is NP-complete, but coverability is known to be in polynomial time. Our main results are three dichotomy theorems, one for each of the cases (i)--(iii). In each case, we show that for every φ, the problem is either NP-complete or belongs to AC1, a circuit complexity class within polynomial time. We also show that it is decidable on which side of the dichotomy a given formula falls.