[论文解读] Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality

Marvin Künnemann, Filip Mazowiecki+3 more|arXiv (Cornell University)|Jan 1, 2023

semigroups and automata theory被引用 2

一句话总结

该论文通过将Rackoff的上界从$ n^{2^{O(d\log d)}} $改进为$ n^{2^{O(d)}} $，填补了向量自动机带状态（VASS）可覆盖性问题复杂度的长期空白，与Lipton的$ n^{2^{\Omega(d)}} $下界相匹配。通过指数时间假设（ETH）证明了条件最优性，表明不存在确定性$ n^{2^{o(d)}} $-时间算法，并进一步在k-环和超图团假设下证明了线性有界VASS的近似最优性。

ABSTRACT

Seminal results establish that the coverability problem for Vector Addition Systems with States (VASS) is in EXPSPACE (Rackoff, '78) and is EXPSPACE-hard already under unary encodings (Lipton, '76). More precisely, Rosier and Yen later utilise Rackoff's bounding technique to show that if coverability holds then there is a run of length at most $n^{2^{\mathcal{O}(d \log d)}}$, where $d$ is the dimension and $n$ is the size of the given unary VASS. Earlier, Lipton showed that there exist instances of coverability in $d$-dimensional unary VASS that are only witnessed by runs of length at least $n^{2^{Ω(d)}}$. Our first result closes this gap. We improve the upper bound by removing the twice-exponentiated $\log(d)$ factor, thus matching Lipton's lower bound. This closes the corresponding gap for the exact space required to decide coverability. This also yields a deterministic $n^{2^{\mathcal{O}(d)}}$-time algorithm for coverability. Our second result is a matching lower bound, that there does not exist a deterministic $n^{2^{o(d)}}$-time algorithm, conditioned upon the Exponential Time Hypothesis. When analysing coverability, a standard proof technique is to consider VASS with bounded counters. Bounded VASS make for an interesting and popular model due to strong connections with timed automata. Withal, we study a natural setting where the counter bound is linear in the size of the VASS. Here the trivial exhaustive search algorithm runs in $\mathcal{O}(n^{d+1})$-time. We give evidence to this being near-optimal. We prove that in dimension one this trivial algorithm is conditionally optimal, by showing that $n^{2-o(1)}$-time is required under the $k$-cycle hypothesis. In general fixed dimension $d$, we show that $n^{d-2-o(1)}$-time is required under the 3-uniform hyperclique hypothesis.

研究动机与目标

• 填补d维单位制VASS中见证可覆盖性的运行长度的上下界之间的差距。
• 建立可覆盖性所需运行长度的紧致、最优上界$ n^{2^{O(d)}} $。
• 通过证明在指数时间假设（ETH）下，不存在确定性$ n^{2^{o(d)}} $-时间算法，从而证明该上界的条件最优性。
• 分析线性有界单位制VASS中可覆盖性和可达性的复杂度，表明平凡的$ O(n^{d+1}) $算法在时间复杂度上近乎最优。

提出的方法

• 通过消除指数部分中$ \log d $因子，改进了Rackoff的有界技术，从而得到更紧致的$ n^{2^{O(d)}} $上界。
• 应用k-环假设和3-均匀超图团假设，推导出时间复杂度的条件下界。
• 采用受Czerwiński和Orlikowski启发的控制计数器技术，在更高维VASS中隐式模拟零测试。
• 将3-均匀超图中寻找4维超图团的问题，约化为(d+2)-VASS中的可达性问题，并控制计数器更新。
• 构建了一个单位制(poly(d)·n^{4+o(1)}, d+2)-VASS，其中可达性对应于超图团的存在性，从而实现复杂度的转移。
• 利用运行结构和零测试行为的特性，通过修改后的引理5.10确保模拟的正确性。

实验结果

研究问题

• RQ1 d维单位制VASS中可覆盖性的运行长度上界能否改进至与Lipton的下界相匹配？
• RQ2 在指数时间假设下，$ n^{2^{O(d)}} $上界是否条件最优？
• RQ3 线性有界VASS的平凡$ O(n^{d+1}) $枚举搜索算法在时间复杂度上是否近乎最优？
• RQ4 VASS有界性问题的复杂度差距是否也能以类似方式填补？

主要发现

• 该论文在d维单位制VASS中，为见证可覆盖性的运行长度建立了紧致的上界$ n^{2^{O(d)}} $，与Lipton的$ n^{2^{\Omega(d)}} $下界相匹配。
• 由此得出一个确定性$ n^{2^{O(d)}} $-时间的可覆盖性算法，该算法在指数时间假设下条件最优。
• 在指数时间假设下，d维单位制VASS中不存在确定性$ n^{2^{o(d)}} $-时间算法用于可覆盖性问题。
• 对于线性有界1-VASS，平凡的$ O(n^{2}) $算法在k-环假设下条件最优，需花费$ n^{2-o(1)} $时间。
• 在一般固定维度d下，线性有界(d+2)-VASS中的可达性在3-均匀超图团假设下需花费$ n^{d-2-o(1)} $时间。
• 结果表明，线性有界VASS的平凡$ O(n^{d+1}) $算法在时间复杂度上近乎最优，仅在指数部分存在微小差距。