July 16, 2026
A VASS can be viewed as a finite-state automaton manipulating a fixed number (called its dimension) of counters holding non-negative values. The reachability problem, asking whether there is a run from one configuration, defined by a state and values of the counters, to another configuration, has been a long-standing algorithmic challenge in theoretical computer science. When the dimension is part of the input, the problem has been shown to be ACKERMANN-complete in 2021. For fixed dimension greater than 2, and in particular for dimension 3, the exact complexity of the reachability problem remains unclear. For a long time the known algorithms for the \(3\)-dimensional VASS reachability problem had been non-elementary, while the best known lower bound is merely PSPACE hardness inherited from dimension 2. A recent breakthrough in (Czerwiński, Jecker, Lasota, Orlikowski, ICALP 2025) gave the first elementary upper bound for the problem, namely \(2\)-\({\normalfont\textsf{EXPSPACE}}\). In this paper it is shown that the reachability problem in 3-VASS belongs to \({\normalfont\textsf{EXPSPACE}}\). The proof is based on a hierarchical pumpability analysis, yielding a doubly-exponential length bound on the shortest runs between two configurations.
Petri nets are a fundamental model of concurrency with numerous applications across theoretical computer science. Algorithmically, they are equivalent to vector addition systems with states (VASS). A \(d\)-dimensional VASS (\(d\)-VASS) is a finite automaton equipped with \(d\) counters whose values range over nonnegative integers and can be updated by applying transition rules. In the terminology of Petri net theory a counter value represents the number of tokens in a place; it is never negative. Let \(\mathbb{N}\) be the set of natural numbers and \(\mathbb{Z}\) be the set of integers. Formally, a \(d\)-dimensional vector addition system with states (\(d\)-VASS) \(V\) is a tuple \((Q,T)\), where \(Q\) is a finite set of states and \(T \subseteq Q \times \mathbb{Z}^d \times Q\) is a finite set of transitions. A \(\mathbb{Z}\)-configuration \(p(\boldsymbol{x})\) is specified by a state \(p\) and a vector \(\boldsymbol{x}\in\mathbb{Z}^d\). A transition \((p,\boldsymbol{t},q) \in T\), also denoted by \(p\xrightarrow{\boldsymbol{t}}q\), induces a transition relation on \(\mathbb{Z}\)-configurations defined by \(p(\boldsymbol{x}) \stackrel{\mathbf{t}}{\longrightarrow}_{\mathbb{Z}} q(\boldsymbol{x}\,{+}\,\boldsymbol{t})\) for all \(\boldsymbol{x} \in \mathbb{Z}^d\). A \(\mathbb{Z}\)-configuration \(p(\boldsymbol{a})\) is a configuration if \(\boldsymbol{a} \in \mathbb{N}^d\). We write \(p(\boldsymbol{a})\xrightarrow{\boldsymbol{t}}q(\boldsymbol{a}\,{+}\,\boldsymbol{t})\) if \(\boldsymbol{a},\boldsymbol{a}\,{+}\,\boldsymbol{t}\in\mathbb{N}^d\). The following directed graph defines a 3-VASS [1].
Figure 1:
.
It contains 2 states labeled by \(p,q\) and 4 transition rules labeled by \(\boldsymbol{t}_0:=(0,1,-1)\), \(\boldsymbol{t}_1:=(0,0,0)\), \(\boldsymbol{t}_2:=(0,-1,2)\) and \(\boldsymbol{t}_3:=(1,0,0)\) respectively. A (\(\mathbb{Z}\))-run is a finite sequence of (\(\mathbb{Z}\))-configurations defined by a sequence of transition instances. The following is a particular run. \[p(0,0,1) \stackrel{\boldsymbol{t}_0}{\longrightarrow} p(0,1,0) \stackrel{\boldsymbol{t}_1}{\longrightarrow} q(0,1,0) \stackrel{\boldsymbol{t}_2}{\longrightarrow} q(0,0,2) \stackrel{\boldsymbol{t}_3}{\longrightarrow} p(1,0,2).\] We write \(p(0,0,1) \rightarrow p(0,1,0) \rightarrow q(0,1,0) \rightarrow q(0,0,2) \rightarrow p(1,0,2)\) even \(p(0,0,1) \xrightarrow{*} p(1,0,2)\), where \(\xrightarrow{*}\) is the reflexive and transitive closure of \(\rightarrow\), if we are not concerned with the labels. By repeating the transition sequence, one gets \(p(0, 0, 1) \xrightarrow{*} p(n, 0, 2^n)\).
A central algorithmic question for VASS is the reachability problem: Given a VASS \(V\) and two configurations \(s=p(\boldsymbol{a}),t=q(\boldsymbol{b})\), determine whether \(s\xrightarrow{*}t\). We shall call the tuple \((V,s,t)\) a reachability instance. In the general VASS reachability problem, denoted by \(\mathbb{VASS}\), the number of counters, or the dimension of VASS, is unfixed. The complexity of \(\mathbb{VASS}\) has been studied for nearly five decades. Lipton established \({\normalfont\textsf{EXPSPACE}}{}\)-hardness already in 1976 [2], while decidability was first proved by Mayr [3]. Subsequent works simplified and refined the original proof techniques [4], [5]. Their decidability algorithm is now known as the KLM algorithm. Later, Leroux and Schmitz showed that the problem admits an Ackermannian upper bound [6]. On the lower-bound end, the complexity was successively improved from \({\normalfont\textsf{TOWER}}{}\)-hardness [7] to \({\normalfont\textsf{ACKERMANN}}{}\)-hardness [8], [9], thereby matching the upper bound.
In the \(d\)-dimensional VASS reachability problem, denoted by \(\mathbb{VASS}^d\), the number of counters \(d\) is fixed. The most recent refinement of the KLM algorithm [10] has revealed that \(\mathbb{VASS}^d\) is in \(\mathsf{F}_{d}\) for all \(d>2\), which improves the previous upper bound \(\mathsf{F}_{d+4}\) [6]. The complexity classes \(\mathsf{F}_3,\mathsf{F}_4,\ldots,\mathsf{F}_i,\ldots\) are non-elementary complexity classes rendering true the inclusion sequence \({\normalfont\textsf{TOWER}}{}=\mathsf{F}_3\subseteq\mathsf{F}_4\subseteq\ldots\subseteq\mathsf{F}_i\subseteq\ldots {\normalfont\textsf{ACKERMANN}}{}\). For more on these classes, consult [11].
The size of a reachability instance \((V,s,t)\), denoted by \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,t)\), is the encoding of \((V,s,t)\) in either binary or unary. The difference matters for \(\mathbb{VASS}^1\) and \(\mathbb{VASS}^2\). It is immaterial for the current upper bound results about \(\mathbb{VASS}^d\) with \(d>2\). \(\mathbb{VASS}^1\) is \({\normalfont\textsf{NP}}{}\)-complete [12] under binary encoding and \({\normalfont\textsf{NL}}{}\)-complete under unary encoding [13]. \(\mathbb{VASS}^2\) is \({\normalfont\textsf{PSPACE}}{}\)-complete [14] under binary encoding and \({\normalfont\textsf{NL}}{}\)-complete [15] under unary encoding. The insights into 2-dimensional runs are revealing. All \(2\)-dimensional runs are short in that they can be described by regular expressions, called linear path schemes, irrelevant to the source and target configurations [14]. When the encoding scheme is in binary, the linear path schemes are of exponential size and contain a polynomial number of \(*\)-expressions. This algebraic view helps see that \(2\)-dimensional runs can be characterized by linear Diophantine systems with a polynomial number of variables. Further studies show that all \(2\)-dimensional runs essentially take a zigzag shape in the first quadrant [16].
In recent years, a special class of VASS has been shown to play an important role in the studies of VASS reachability. A geometrically \(2\)-dimensional VASS is one in which all \(\mathbb{Z}\)-runs stay between two parallel 2-dimensional planes [10], [17]. It has been shown that the reachability problem of geometrically 2-dimensional VASS is also \({\normalfont\textsf{PSPACE}}{}\)-complete under binary encoding [17] and \({\normalfont\textsf{NP}}{}\)-complete under unary encoding [18]. Further properties of the geometrically \(2\)-dimensional runs have been unveiled in the recent work by Czerwinski et al. [19]. Using these properties, the authors have come up with a proof that the 3-VASS reachability problem is in \(2\)-\({\normalfont\textsf{EXPSPACE}}{}\).
| Reachability in \(d\)-dimensional VASS | ||
| Unary encoding | Binary encoding | |
| \(d=1\) | \(\NL{}\)-complete [13] | \(\NP{}\)-complete [12] |
| \(d=2\) | \(\NL{}\)-complete [15] | \(\PSPACE{}\)-complete [14] |
| \(d=3\) | \(\NP{}\)-hard [16] | \(\PSPACE{}\)-hard |
| \(2\)- [19], [ this paper] | ||
| \(d\geq 4\) | \(\mathsf{F}_{\lfloor(d-3)/2\rfloor}\)-hard for \(d\geq 9\) [20] | |
| \(\mathsf{F}_d\) [10] | ||
From the complexity theoretical viewpoint, \(\mathbb{VASS}^1\) and \(\mathbb{VASS}^2\) have been settled, confer 1. Lower bounds for dimensions 4–8 are studied in [21]. No completeness result however is known for \(\mathbb{VASS}^d\) for any \(d>2\). The priority of study is naturally given to \(\mathbb{VASS}^3\). Can the lower bound \({\normalfont\textsf{PSPACE}}{}\) and the upper bound \(2\)-\({\normalfont\textsf{EXPSPACE}}{}\) be improved? This paper partly answers this question.
Our main result improves the \(2\)-\({\normalfont\textsf{EXPSPACE}}{}\) upper bound of [19].
theoremVASSTINEXP The \(3\)-VASS reachability problem is in EXPSPACE.
It is worth pointing out that [thm:3-vass-in-exp-intro] is valid for both unary encoding and binary encoding. To state the main proposition from which the theorem is derived, we need to introduce some notations. Let \(\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t)\) denote the length of the shortest runs from \(s\) to \(t\) admitted by \(V\). A VASS is strongly connected if it is strongly connected as a directed graph. A run in a VASS traverses a series of distinct strongly connected components (SCC). To capture such a structure, sequential VASS is introduced in [19]. Let \((V_i)_{i \in [k]}\) be a sequence of strongly connected VASS, where \(V_i = (Q_i, T_i)\) for each \(i \in [k]\), and \((u_i)_{i \in [k-1]}\) be transitions, where \(u_i=(q_i, \boldsymbol{a}_i, p_{i+1})\) for some \(q_i \in Q_i\) and \(p_{i+1} \in Q_{i+1}\). A sequential VASS, presented as \((V_1) u_1 (V_2) u_2 \dots u_{k-1} (V_k)\), is a VASS \(V=(Q,T)\), where \[Q=\bigcup_{i \in [k]}Q_i\quad\text{and}\quad T=\bigcup_{i \in [k]} T_i \cup \{u_i\}_{i \in [k-1]}.\] Such a VASS \(V\) is a \(k\)-component (sequential) VASS in which \(V_1,\ldots,V_k\) are components and \(u_1,\ldots,u_{k-1}\) are bridges. Let \(\mathrm{Seq}\mathbb{VASS}^d\) be the subset of \(\mathbb{VASS}^d\) defined by the sequential \(d\)-VASS. Not every VASS is sequential of course. But the transition sequence of a run in \(V\) induces a sequence of SCC components of \(V\) connected by transitions. Such a sub-VASS is essentially sequential. From the viewpoint of reachability, \(\mathrm{Seq}\mathbb{VASS}^d\) is equivalent to \(\mathbb{VASS}^d\). We can now state the key proposition.
propositionpropThreeVASSlenboundIntro If \((V, s, t)\in\mathrm{Seq}\mathbb{VASS}^3\) has \(k\) components, \(\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t)\le\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V, s, t)^{2^{\mathop{\operatorname{\mathrm{poly}}}\nolimits({k})}}\).
[thm:3-vass-in-exp-intro] is an immediate consequence of [prop:3-VASS-lenbound-intro]. For completeness, we include the standard proof in 9. In the rest of the section, we take a look at the existing analyses for \(\mathbb{VASS}^3\), and outline how [prop:3-VASS-lenbound-intro], as the foundation of the new complexity bound, is proved.
Attempts to obtain a complexity upper bound for \(\mathbb{VASS}^3\) date back to the KLM algorithm. In [6], Leroux and Schmitz obtained an \(\mathsf{F}_{d+4}\) upper bound for \(\mathbb{VASS}\), yielding an \(\mathsf{F}_7\) upper bound for \(\mathbb{VASS}^3\). The core philosophy of the KLM algorithm is to reduce high-dimensional VASS instances into lower-dimensional ones. It is subsequently optimized by Fu, Yang, and Zheng [10] by sharpening the characterization of low-dimensional base cases. They utilized a more tractable equation system for geometrically \(2\)-VASS, thereby lowering the complexity to \(\mathsf{F}_d\) for \(\mathbb{VASS}^d\). Particularly, for \(\mathbb{VASS}^3\), the upper bound specializes to \(\mathsf{F}_3 = {\normalfont\textsf{TOWER}}{}\).
It is commonly accepted that the KLM algorithm is merely a brute-force construction of a possible run when the number of runs is finite. Upon receiving an input \((V,s,t)\), the KLM algorithm assumes that there is a run from \(s\) to \(t\), and then carries out a series of transformations on the VASS, while maintaining the reachability. This is done without considering any special properties of the input VASS. For \(3\)-VASS, the KLM algorithm probably reaches its efficiency bottleneck, because instances can be found that admit finitely many but \({\normalfont\textsf{TOWER}}{}\)-large runs.
The next refinement is due to Czerwiński, Jecker, Lasota and Orlikowski [19], who obtained the first elementary upper bound for \(\mathbb{VASS}^3\). To achieve that, they developed a number of techniques, chief among them is an efficient representation of the reachability set, which is the set of all vectors reachable from an initial configuration in a geometrically \(2\)-dimensional VASS. Quite a few properties about the efficient representation of the reachability set are established in [19]. The second main technique of [19] allows us to bound the length of shortest runs by induction on the number of components of a sequential VASS. Let \(h_k\) be an upper bound function for the length of the shortest runs of the \(k\)-component sequential VASS. Suppose \(V\) is \((V_1) u_1 (V_2) u_2 \dots u_{k-1} (V_k)\). Then \(\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t)\le h_k(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,t))\). Suppose \(s\stackrel{\pi_1}{\longrightarrow}s_1\stackrel{\pi'}{\longrightarrow}t\) is a shortest run from \(s\) to \(t\), where \(s\stackrel{\pi_1}{\longrightarrow}s_1\) is a run admitted by the VASS \((V_1)u_1\) and \(s_1\stackrel{\pi'}{\longrightarrow}t\) is a run admitted by the \((k{-}1)\)-component VASS \(V':=(V_2)u_2\dots u_{k-1}(V_k)\). The idea is to seek a suitable induction that bounds the length of \(s\stackrel{\pi_1}{\longrightarrow}s_1\) using the inductively obtained length bound of \(s_1\stackrel{\pi'}{\longrightarrow}t\). The trouble is that the size of \(s_1\) is unknown. The solution of [19] is to rewrite \(s\stackrel{\pi_1}{\longrightarrow}s_1\stackrel{\pi'}{\longrightarrow}t\) to some \(s\stackrel{\pi_1'}{\longrightarrow}s_1'\stackrel{\pi''}{\longrightarrow}t\) such that \(s_1'\) is small. Using a sophisticated argument, they are able to bound the length of \(\pi''\), the size of \(s_1'\), the size of \(s_1\), and the length of \(\pi'\) in turn, producing an upper bound of \(h_k\) by an expression of the form \(h_{k-1}(h_{k-1}(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V',s_1,t)))\). The nested occurrence of \(h_{k-1}\) explains the triple-exponential upper bound \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,t)^{2^{2^{\mathcal{O}(k)}}}\) for \(h_{k}(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,t))\).
The second invocation of \(h_{k-1}\) must be dispensed with in order to improve the upper bound from \(2\)-\({\normalfont\textsf{EXPSPACE}}{}\) to \({\normalfont\textsf{EXPSPACE}}{}\). We will prove some global properties about reachability sets in 4 and adopt a separation-of-concern proof strategy in 5 through 7. Using the finer-tuned approach, we can do away with the second reference to \(h_k\). Our ultimate goal is to show that for each \(k\)-component \((V,s,t)\in\mathrm{Seq}\mathbb{VASS}^3\), \[\label{2026-06-26-airport} \min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t)\le\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,t)^{2^{{\mathop{\operatorname{\mathrm{poly}}}\nolimits({k})}}}.\tag{1}\] The inequality (1 ) will be proved in a step-by-step fashion. The following is an outline of our method.
We start with a special subset \(\mathrm{Diag}\mathbb{VASS}^3\) of \(\mathrm{Seq}\mathbb{VASS}^3\). A sequential \(d\)-VASS is in \(\mathrm{Diag}\mathbb{VASS}^d\) if it is diagonal. The definition of diagonal \(d\)-VASS will be given in 3. It is shown in [19] that \(\mathrm{Diag}\mathbb{VASS}^3\in\) \(2\)-\({\normalfont\textsf{EXPSPACE}}{}\). We will strengthen this result to \(\mathrm{Diag}\mathbb{VASS}^3\in{\normalfont\textsf{EXPSPACE}}{}\). By enriching our knowledge about the efficient representation of the reachability sets of the geometrically \(2\)-dimensional VASS, and by sharpening the analysis of [19], we are able to establish the inequality (1 ) for the diagonal VASS. This is explained in 5.
Once there is an exponential space algorithm for \(\mathrm{Diag}\mathbb{VASS}^3\), it can be used as a subroutine to help solve \(\mathrm{Seq}\mathbb{VASS}^3\). However \(\mathrm{Seq}\mathbb{VASS}^3\) and \(\mathrm{Diag}\mathbb{VASS}^3\) are far apart as it were that it is difficult to see how to invoke an algorithm for the latter to solve the former. A key step in our approach is to introduce an intermediate problem \(\mathrm{Pump}\mathbb{VASS}^3\) such that \(\mathrm{Diag}\mathbb{VASS}^3\subsetneq\mathrm{Pump}\mathbb{VASS}^3\subsetneq\mathrm{Seq}\mathbb{VASS}^3\). The class \(\mathrm{Pump}\mathbb{VASS}^3\) contains all the pumpable instances in \(\mathrm{Seq}\mathbb{VASS}^3\), whose definition will be given in 3. We will define a reduction from \(\mathrm{Pump}\mathbb{VASS}^3\) to \(\mathrm{Diag}\mathbb{VASS}^3\) to show that the inequality (1 ) is valid for the pumpable VASS, using the fact that it is valid for the diagonal VASS. Similarly, we will define a reduction from \(\mathrm{Seq}\mathbb{VASS}^3\) to \(\mathrm{Pump}\mathbb{VASS}^3\) to show that the inequality (1 ) is valid for the sequential VASS, using the fact that it is valid for the pumpable VASS. The two reductions are studied in 6 and in 7 respectively. We should mention that such a reduction is a self-reduction in that it always maps an instance of a class onto an instance of the same class. The latter instance may or may not be in the target class, but it always has fewer components. In other words, the self-reduction on the source class is controlled by the target class.
2 fixes the notations, terminologies, and the necessary lemmas. 3 gives an overview of the proof strategy. 4 studies the efficient representation of reachability sets. 5, 6 and 7 derive the new complexity upper bound of \(\mathrm{Diag}\mathbb{VASS}^3\), \(\mathrm{Pump}\mathbb{VASS}^3\) and \(\mathrm{Seq}\mathbb{VASS}^3\), respectively. 8 concludes with some open problems.
The terminologies and results referred to in the rest of the paper are introduced here.
Let \(\mathbb{Q}\) denote the set of rational numbers. We use subscripts to indicate restrictions to \(\mathbb{N},\mathbb{Z},\mathbb{Q}\). For instance, \(\mathbb{Q}_{\ge 0}\) denotes the set of the non-negative rationals. Vectors are denoted in bold, e.g., \(\boldsymbol{u}, \boldsymbol{v}, \boldsymbol{x}, \boldsymbol{y}\). All vectors are column vectors by default. We write \(\boldsymbol{x}^{\dagger}\) for the transpose of the vector \(\boldsymbol{x}\). The \(i\)-th value of \(\boldsymbol{x}\) is denoted by \(\boldsymbol{x}(i)\) or \(\boldsymbol{x}_i\). We denote by \(\boldsymbol{1}\) and \(\boldsymbol{0}\) the all-ones and all-zeros vectors, respectively. For \(n\in\mathbb{N}\), let \([n]:=\{1,\ldots,n\}\). We write \(\boldsymbol{e}^{(d)}_i\) or \(\boldsymbol{e}_i\) for the unit vector satisfying \(\boldsymbol{e}_i(i) = 1\) and \(\boldsymbol{e}_i(j) = 0\) for all \(j \in[d]\setminus\{i\}\). A vector \(\boldsymbol{x} \in \mathbb{Q}^d\) is positive if \(\boldsymbol{x}(i) > 0\) for all \(i \in [d]\). A vector \(\boldsymbol{x}\) is negative if \(-\boldsymbol{x}\) is positive. Vector comparisons are understood component-wise: \(\boldsymbol{x} \le \boldsymbol{y}\) means \(\boldsymbol{x}(i) \le \boldsymbol{y}(i)\) for all \(i \in [d]\). We write \(\boldsymbol{x} < \boldsymbol{y}\) if \(\boldsymbol{x} \le \boldsymbol{y}\) and \(\boldsymbol{x} \ne \boldsymbol{y}\). The (max-)norm of a vector \(\boldsymbol{x}\) in \(\mathbb{Q}^d\) is \(\left\Vert{\boldsymbol{x}}\right\Vert := \max_{i \in [d]} |\boldsymbol{x}(i)|\). The inner product of \(\boldsymbol{x},\boldsymbol{y} \in \mathbb{Q}^d\) is \(\langle \boldsymbol{x}, \boldsymbol{y} \rangle := \sum_{i \in [d]} \boldsymbol{x}(i) \cdot \boldsymbol{y}(i)\). For a finite set \(X = \{\boldsymbol{x}_1,\ldots,\boldsymbol{x}_n\} \subseteq \mathbb{Q}^d\), the span of \(X\) is \(span(X) := \{\lambda_1 \boldsymbol{x}_1 + \cdots + \lambda_n \boldsymbol{x}_n \mid \lambda_1, \ldots, \lambda_n \in \mathbb{Q}\}\).
Suppose \(V=(Q,T)\) is a \(d\)-VASS. The reverse of \(V\) is the VASS \({V}^{\mathrm{rev}} = (Q, {T}^{\mathrm{rev}})\) obtained by inverting all the transitions, where \({T}^{\mathrm{rev}} := \{ (q, -\boldsymbol{a}, p) \mid (p, \boldsymbol{a}, q) \in T \}\). Let \(\pi:=\tau_1\tau_2\dots \tau_k\) be a sequence of transitions, where \(\tau_i = (p_i,\boldsymbol{a}_i,q_i)\) for each \(i \in [k]\). We say that \(\pi\) is a path if \(q_i=p_{i+1}\) for all \(i \in [k-1]\). If additionally \(q_k=p_1\), then \(\pi\) is called a cycle. A cycle consisting of a single transition is a self-loop. An empty path is denoted by \(\varepsilon\). The length of \(\pi\) is \(|\pi| := k\). The effect of \(\pi\) is defined as \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\pi) := \sum_{i = 1}^k \boldsymbol{a}_i\). A cycle is positive, respectively negative, if its effect is positive, respectively negative. Given two paths \(\pi_1\) and \(\pi_2\), their concatenation \(\pi_1\pi_2\) is defined whenever the last state of \(\pi_1\) coincides with the first state of \(\pi_2\). If \(\pi\) is a cycle and \(m \in \mathbb{N}\), we denote by \(\pi^m\) its \(m\)-fold concatenation of \(\pi\). The norm of a (\(\mathbb{Z}\)-)configuration \(p(\boldsymbol{x})\) is \(\left\Vert{p(\boldsymbol{x})}\right\Vert:=\left\Vert{\boldsymbol{x}}\right\Vert\).
The unary size of a VASS \(V\) is \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V) := |Q|+ d \cdot |T| \cdot (\left\Vert{T}\right\Vert + 1)\), where \(\left\Vert{T}\right\Vert := \max_{(p, \boldsymbol{a}, q) \in T}\|\boldsymbol{a}\|\). The size \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V, s, t)\) of \((V, s, t)\) is defined by \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V) + d\cdot (\left\Vert{s}\right\Vert + \left\Vert{t}\right\Vert + 1)\), and \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V, s)\) is defined by \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V) + d\cdot (\left\Vert{s}\right\Vert + 1)\). The binary size of \((V, s, t)\) is \[\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits_{\mathrm{\small bin}}(V,s,t) := |Q| + d \cdot |T| \cdot \log (\left\Vert{T}\right\Vert + 1) + d \cdot \log (\left\Vert{s}\right\Vert + 1) + d\cdot \log (\left\Vert{t}\right\Vert + 1).\] In the rest of the paper, when we say size, we mean the unary size.
The drop of a path \(\pi = \tau_1\tau_2\dots \tau_k\), denoted by \(\mathop{\operatorname{\mathrm{\mathrm{\small drop}}}}\nolimits(\pi)\), is a vector in \(\mathbb{N}^d\) that captures the maximal decrease incurred along \(\pi\). Formally, for each coordinate \(i \in [d]\), let \[\mathop{\operatorname{\mathrm{\mathrm{\small drop}}}}\nolimits(\pi)(i):= -\min(0,\min_{j\in [k]}\sum_{\ell \in [j]}\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\tau_\ell)(i)).\] Assume that the source and target states of \(\pi\) are \(p\) and \(q\), respectively. It follows immediately that for any \(\boldsymbol{z}\ge \mathop{\operatorname{\mathrm{\mathrm{\small drop}}}}\nolimits(\pi)\), \(p(\boldsymbol{z}) \xrightarrow{\pi} q(\boldsymbol{z}+\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\pi))\), and in this case, we say that \(\pi\) is fireable at \(p(\boldsymbol{z})\).
We write \({\mathop{\operatorname{\mathrm{poly}}}\nolimits({n})}\) and \(\mathcal{O}(n)\) for a polynomial and a linear function on natural numbers respectively without being specific about constants. We also assume, without loss of generality, that every function \(f:\mathbb{N}\to \mathbb{N}\) used as an upper bound in this paper is non-decreasing in the sense that \(f(m) \ge f(n)\) whenever \(m \ge n\) and \(f(n) \ge n + 1\) holds for each \(n \ge 1\).
For a non-empty finite set \(X \subseteq \mathbb{Q}^d\), let \(\left\Vert{X}\right\Vert := \max_{\boldsymbol{x} \in X} \left\Vert{\boldsymbol{x}}\right\Vert\). For \(X, Y \subseteq \mathbb{Q}^d\), let \(X + Y := \{\boldsymbol{x} + \boldsymbol{y} \mid \boldsymbol{x} \in X, \boldsymbol{y} \in Y\}\), and \(X - Y\) is defined similarly. Also, \(-X\) is \(\{\boldsymbol{0}\} - X\). For a finite set \(X = \{\boldsymbol{x}_1,\ldots,\boldsymbol{x}_n\} \subseteq \mathbb{Q}^d\), we denote by \[\mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(X) := \{\lambda_1 \boldsymbol{x}_1 + \cdots + \lambda_n \boldsymbol{x}_n \mid \lambda_1, \ldots, \lambda_n \in \mathbb{Q}_{\ge 0}\}\] the (closed rational) cone generated by \(X\). We also consider sequential cones over a sequence of cones. Let \(C_1, \ldots, C_k \subseteq \mathbb{Q}^d\) be cones, the sequential cone over them is \[\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(C_1, \ldots, C_k) := \left\{ \boldsymbol{v}_1 + \cdots + \boldsymbol{v}_k \mid \text{for all } i \in [k], \boldsymbol{v}_i \in C_i \text{ and } \boldsymbol{v}_1 + \cdots + \boldsymbol{v}_i \ge \boldsymbol{0} \right\}.\] We sometimes consider the cone of \(X\) under natural coefficients, which is denoted by \[X^* := \{\lambda_1 \boldsymbol{x}_1 + \cdots + \lambda_n \boldsymbol{x}_n \mid \lambda_1, \ldots, \lambda_n \in \mathbb{N}\}.\]
Let \(V\) be a \(d\)-VASS. Its cycle space \(\mathop{\operatorname{\mathrm{\mathrm{\small cyc}}}}\nolimits(V)\subseteq \mathbb{Q}^d\) is the vector space spanned by the effects of simple cycles in \(V\), i.e., \(\mathop{\operatorname{\mathrm{\mathrm{\small cyc}}}}\nolimits(V) := \mathop{\operatorname{\mathrm{span}}}\nolimits\{\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta) \mid \theta \text{ is a simple cycle in } V\}\). The cycle-dimension \(\dim_{\mathrm{cyc}}(V) := \dim(\mathop{\operatorname{\mathrm{\mathrm{\small cyc}}}}\nolimits(V))\) is the dimension of the cycle space. This is known as geometric dimension in [10], [17]. The (closed) cone of \(V\) is the cone generated by the effects of simple cycles in \(V\), i.e., \(\mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V) := \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(\{\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta) \mid \theta \text{ is a simple cycle in } V\})\). In particular, if \(V\) is a sequential VASS \(V = (V_1) u_1 (V_2) u_2 \ldots u_{k-1} (V_k)\), we define the (closed) sequential cone of \(V\) by \(\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(V) := \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(\mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V_1), \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V_2), \ldots, \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V_k))\). By definition, if \(V\) has a single component, then \(\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(V) = \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V)\). We remark that both cones and sequential cones considered here are closed, which is different from those defined in [19]. Observe that \(\mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits({V}^{\mathrm{rev}}) = -\mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V)\) and \(\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits({V}^{\mathrm{rev}}) = \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(-\mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V_k), -\mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V_{k-1}), \ldots, -\mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V_1))\).
The set of the configurations reachable from \(s\) is denoted by \(\mathop{\operatorname{\mathrm{Reach}}}\nolimits({V},{s})\). If the target state is \(q\in Q\), the notation \(\mathop{\operatorname{\mathrm{Reach}}}\nolimits_{q}({V},{s})\) denotes the set of the vectors \(\boldsymbol{w}\in\mathbb{N}^d\) satisfying \(q(\boldsymbol{w}) \in \mathop{\operatorname{\mathrm{Reach}}}\nolimits({V},{s})\). Suppose \(C\) is a set of configurations. Let \(\mathop{\operatorname{\mathrm{Reach}}}\nolimits_{q}({V},{C})\) be \(\bigcup_{c \in C} \mathop{\operatorname{\mathrm{Reach}}}\nolimits_{q}({V},{c})\), and \(\mathop{\operatorname{\mathrm{Reach}}}\nolimits({V},{C})\) be \(\bigcup_{c \in C} \mathop{\operatorname{\mathrm{Reach}}}\nolimits({V},{c})\). For \(S \subseteq \mathbb{N}^d\), let \(p(S):=\{p(\boldsymbol{s}) \mid \boldsymbol{s} \in S\}\). The notation \(p(S) \xrightarrow{*} t\) indicates the fact that \(p(\boldsymbol{x}) \xrightarrow{*} t\) for some \(\boldsymbol{x} \in S\).
Given a VASS \((V, s, t)\), the length set \(\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V, s, t)\) is the set of the lengths of runs from \(s\) to \(t\) in \(V\). Notice that every run induces from \(V\) a sequential VASS. We may collect all such sequential VASS to form a finite family \(\mathcal{V}\) of sequential VASS such that \(\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t) = \bigcup_{V'\in\mathcal{V}}\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V',s,t)\) and \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V')\le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)\) for every \(V' \in \mathcal{V}\).
Given a matrix \(A \in \mathbb{Q}^{m\times n}\), let \(\left\Vert{A}\right\Vert\) denote the maximum of the absolute values of all the entries of \(A\). Various bounds on integer solutions to linear inequalities have been studied in the literature [22]–[24]. We shall refer to the results stated below.
Lemma 1 ([24]). Let \(A \in \mathbb{Z}^{m \times n}\) be a matrix and \(\boldsymbol{b} \in \mathbb{Z}^m\) be a vector. Define \(X = \{\boldsymbol{x} \in \mathbb{N}^n \mid A\boldsymbol{x} = \boldsymbol{b}\}\) and \(X_0 = \{\boldsymbol{x} \in \mathbb{N}^n \mid A\boldsymbol{x} = \boldsymbol{0} \}\). Any vector in \(X\) can be decomposed as the sum of a vector \(\boldsymbol{x} \in X\) and a finite sum of vectors \(\boldsymbol{x}_0 \in X_0\) where \[\left\Vert{\boldsymbol{x}}\right\Vert \le ((n + 1)\left\Vert{A}\right\Vert + \left\Vert{\boldsymbol{b}}\right\Vert + 1)^m\;\text{and}\; \left\Vert{\boldsymbol{x}_0}\right\Vert \le (n\left\Vert{A}\right\Vert + 1)^m.\]
Corollary 1. Let \(A \in \mathbb{Z}^{m \times n}\), \(C \in \mathbb{Z}^{k \times n}\) be two matrices and \(\boldsymbol{b} \in \mathbb{Z}^m\), \(\boldsymbol{d} \in \mathbb{Z}^{k}\) be two vectors. Define \(X = \{\boldsymbol{x} \in \mathbb{N}^n \mid A\boldsymbol{x} \le \boldsymbol{b}\text{ and }C\boldsymbol{x} = \boldsymbol{d}\}\) and \(X_0 = \{\boldsymbol{x} \in \mathbb{N}^n \mid A\boldsymbol{x} \le \boldsymbol{0} \text{ and }C\boldsymbol{x}=\boldsymbol{0}\}\). Let \(M:=\max\{\left\Vert{A}\right\Vert,\left\Vert{C}\right\Vert\}\) and \(N:=\max\{\left\Vert{\boldsymbol{b}}\right\Vert,\left\Vert{\boldsymbol{d}}\right\Vert\}\). Then any vector in \(X\) can be decomposed as the sum of a vector \(\boldsymbol{x} \in X\) and a finite sum of vectors \(\boldsymbol{x}_0 \in X_0\) where \[\left\Vert{\boldsymbol{x}}\right\Vert \le ((n + m + k + 1)M + N + 1)^{m+k}\;\text{and}\;\left\Vert{\boldsymbol{x}_0}\right\Vert \le ((n + m + k)M + 1)^{m+k}.\]
Proof. By introducing slack variables \(\boldsymbol{y} \in \mathbb{N}^m\), we can replace the inequality \(A \boldsymbol{x} \le \boldsymbol{b}\) by the equation \(A \boldsymbol{x} + \boldsymbol{y} = \boldsymbol{b}\). Then apply 1. ◻
Corollary 2. Let \(A \in \mathbb{Z}^{m \times n}\) be a matrix and \(\boldsymbol{b} \in \mathbb{Z}^m\) be a vector. If there exists a non-negative vector \(\boldsymbol{x} \in \mathbb{N}^n\) such that \(A\boldsymbol{x} = \boldsymbol{b}\), then there is also one satisfying \(\left\Vert{\boldsymbol{x}}\right\Vert \le \mathcal{O}(nN)^m\).
The goal of the rest of the paper is to prove [prop:3-VASS-lenbound-intro]. We shall describe in this section the key aspects of the proof. We begin by comparing our proof to the proof in [19]. The algorithm in [19] is based on a self-reduction on \(\mathrm{Seq}\mathbb{VASS}^3\), confer [subfig:previous95work] where the black arrows indicate self-reduction and the orange dashed arrows indicate the invocation dependency. In our proof, the class \(\mathrm{Seq}\mathbb{VASS}^3\) is refined to a sequence of subclasses, giving rise to the following problem hierarchy. \[\label{2026-07-01-0732} \rm{Diag}\mathbb{VASS}^3\subsetneq \rm{Semi\text{-}diag}\mathbb{VASS}^3\subsetneq \rm{Pump}\mathbb{VASS}^3\subsetneq \rm{Semi\text{-}pump}\mathbb{VASS}^3\subsetneq \mathrm{Seq}\mathbb{VASS}^3.\tag{2}\] Our idea is to establish the inequality 1 for all the problems in 2 . The self-reductions must respect the hierarchy in the sense that a reachability instance in a class should not be reduced to any super class. For each class, the reduction relies on the length bound already established for the more restrictive subclass. For example, when reducing from \(\rm{Semi\text{-}diag}\mathbb{VASS}^3\), the length bound for \(\rm{Diag}\mathbb{VASS}^3\) is utilized to constrain the size blow-up. This allows us to transfer sharper bounds from smaller subclasses to larger ones, removing the issue of nested occurrence completely. See [subfig:our95reduction]. Now \({\rm Seq}\mathbb{VASS}^d\) has been defined. The other problems are defined below.
Definition 1. Let \((V,s,t)\in{\rm Seq}\mathbb{VASS}^d\).
\((V,s,t)\) is forward diagonal* if there exists a cycle \(\theta\) fireable at \(s\) such that \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta) \geq \boldsymbol{1}\). It is backward diagonal if \(({V}^{\mathrm{rev}},t,s)\) is forward diagonal. \((V,s,t)\) is diagonal if it is both forward and backward diagonal.*
\((V,s,t)\) is forward pumpable* if there exists a cycle \(\theta\) fireable at \(s\) such that \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta) > \boldsymbol{0}\). It is backward pumpable if \(({V}^{\mathrm{rev}},t,s)\) is forward pumpable. \((V,s,t)\) is pumpable if it is both forward and backward pumpable.*
For convenience, we also say that \(s\) is diagonal/pumpable in \(V\) without explicitly referring to \(t\), if \((V,s,t)\) is forward diagonal/pumpable.
\({\rm Diag}\mathbb{VASS}^d\) contains all the diagonal instances in \({\rm Seq}\mathbb{VASS}^d\), and \({\rm Pump}\mathbb{VASS}^d\) contains all the pumpable instances in \({\rm Seq}\mathbb{VASS}^d\). By definition, a diagonal VASS is also pumpable. \({\rm Semi}\)-\({\rm diag}\mathbb{VASS}^d\) contains all the instances in \({\rm Pump}\mathbb{VASS}^d\) that are forward or backward diagonal. \({\rm Semi}\)-\({\rm pump}\mathbb{VASS}^d\) contains all the instances in \({\rm Seq}\mathbb{VASS}^d\) that are forward or backward pumpable. We remark that all these instances are reachable, as they can be viewed as subproblems of \({\rm Seq}\mathbb{VASS}^d\). Therefore, \(\min \mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t)\) is well-defined whenever \((V,s,t)\) belongs to any of these classes.
We must explain why a finer classification of pumpability is needed. While \(\rm{Diag}\mathbb{VASS}^3\) has the properties we are looking for, diagonality is generally too restrictive for our self-reductions. The broader class \(\rm{Pump}\mathbb{VASS}^3\) still retains useful structure through fireable non-negative cycles; see 2. Joint diagonality plays an important role in the present paper. As illustrated in 2, the cycle with effect \((0,1,0)\) in \(V_1\), \((2,-3,0)\) in \(V_i\) and \((-2,-1,1)\) in \(V_j\) can jointly provide the effect of diagonality. Roughly speaking, by treating the prefix up to \(V_j\) as one component, the resulting instance behaves like a diagonal instance. This explains why pumpable subclasses are natural intermediate classes and are crucial for proving the result for \(\mathrm{Seq}\mathbb{VASS}^3\).
We next highlight two key ingredients of the proof.
To prove that the inequality 1 is valid for \(\rm{Diag}\mathbb{VASS}^3\), confer [prop:diagonal-case-lenbound], we proceed with a case analysis like in [19], distinguishing between the wide case and the non-wide case. Our treatment of the wide instances is basically the same as in [19]. Our improvement is for the non-wide instances. The key insight is that every non-wide instance can be viewed as a sequence of geometrically 2-dimensional 3-VASS. For a short explanation, consider a non-wide diagonal instance \((V,s,t)\) with \(V = (V_1) u_1 (V_2) u_2 \dots u_{k-1} (V_k)\). We will argue that the sequential cone of \((V_1)u_1\dots (V_i)\) and the sequential cone of \({((V_i)u_i\cdots (V_k))}^{\mathrm{rev}}\) are separated by a plane, and the reachable configurations should be very close to both sequential cones. It can be shown then that every reachable configuration in \(V_i\), for every \(i\in[k]\), is constrained within a pair of parallel 2-dimensional planes roughly determined by the start and the target configurations. Therefore, every \(V_i\) is transformed simultaneously into a geometrically 2-dimensional VASS of exponential size. We are done by applying the efficient representation technique developed in [19] and additionally in 4. The details are in 5.
The proof that 1 is valid for \(\rm{Pump}\mathbb{VASS}^3\) and \(\mathrm{Seq}\mathbb{VASS}^3\), confer [prop:len-par-pump-3-vass] and [prop:3-VASS-lenbound-intro], makes use of a different technique. The tool is called length-controlled self-reduction.
definitionDefinitionLengthControlledReduction Let \(\mathcal{L} = (L_k)_{k \in \mathbb{N}}\) be a family of functions from \(\mathbb{N}\) to \(\mathbb{N}\). Suppose \(\mathcal{V} \subseteq \mathbb{VASS}^d\). The class \(\mathcal{V}\) is \(\mathcal{L}\)-controlled self-reducible if for every \(k \ge 1\) and every \(k\)-component VASS \((V,s,t) \in \mathcal{V}\), there exists a \(k'\)-component VASS \((V',s',t')\in \mathcal{V}\) for some \(k'\in\{0, \ldots,k - 1\}\) such that the following statements are valid for some \(R(x) = x^{\mathcal{O}(k^2)}\).
\(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V',s',t') \le R\left( L_k(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,t))\right)\), and
\(\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t) \le R(\min \mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V',s',t') + \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,t))\).
In the above definition, \(k'\) could be \(0\). A \(0\)-component VASS \(V=(Q, T)\) is a VASS with a single state and only non-negative transitions, i.e., \(|Q|=1\) and \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(u)\ge \boldsymbol{0}\) for every \(u\in T\). The class of \(0\)-component VASS is meant to be simple.
observationObsZerodVASSReach Let \((V,s,t)\) be a \(0\)-component \(d\)-VASS. If \(s \xrightarrow{*}t\) in \(V\), then \(s \xrightarrow{\rho} t\) for some \(\rho\) with \(|\rho|\le d\cdot \left\Vert{t}\right\Vert\).
By Condition 2 of [def:length-controlled-reduction], if \(\mathcal{V}\) is \(\mathcal{L}\)-controlled self-reducible, we can estimate a bound on the length of the shortest runs of every \(k\)-component VASS in \(\mathcal{V}\). By Condition 1, we anticipate that there is such a bound \(G_k\) that is not very much larger than \(L_k\). It is important to notice that \(\min \mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V',s',t')\) occurs only once in the right-hand side of the inequality of Condition 2, implying that triple-exponential growth is avoided. Let \(\mathcal{G} = (G_k)_{k \in \mathbb{N}}\). We say that \(\mathcal{V}\) admits \(\mathcal{G}\)-short runs if, for every \(k \in \mathbb{N}\) and every \(k\)-component VASS \((V,s,t) \in \mathcal{V}\), it holds that \[\label{2026-07-02-0630} \min \mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t) \le G_k(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,t)).\tag{3}\] Notice that 3 is precisely 1 when \(G_k(x)=x^{2^{g(k)}}\) for some polynomial \(g\). When \(G_k\) is such a doubly-exponential function, we will use the phrase doubly-exponentially self-reducible for \(\mathcal{L}\)-controlled self-reducible, and the phrase doubly-exponentially short run for \(\mathcal{L}\)-short run.
Once a length-controlled self-reducibility property of \(\mathcal{V}\) is proved, the short run property of \(\mathcal{V}\) comes for free. This is formally stated in the next lemma, whose proof (see 10) is carried out by induction on \(k\) and using the basic fact that \(0\)-component VASS admits short runs.
lemmaLemmaTwoEXPPreserveViaReduction If \(\mathcal{V}\) is \((L_k)_{k \in \mathbb{N}}\)-controlled self-reducible, where \(L_k(x) = x^{2^{f(k)}}\) for all \(k \in \mathbb{N}\), then \(\mathcal{V}\) admits \((G_k)_{k \in \mathbb{N}}\)-short runs, where \(G_k(x) = x^{2^{\mathcal{O}(f(k)\cdot k)}}\) for all \(k \in \mathbb{N}\).
In the light of [lem:2-exp-preserve-via-reduction], we are left to show that each subclass in 2 enjoys the doubly-exponential self-reducibility property. This is done for \(\rm{Diag}\mathbb{VASS}^3\) in 5, for \(\rm{Semi\text{-}diag}\mathbb{VASS}^3\) and \(\rm{Pump}\mathbb{VASS}^3\) in 6, and for \(\rm{Semi\text{-}pump}\mathbb{VASS}^3\) and \(\mathrm{Seq}\mathbb{VASS}^3\) in 7. See [prop:2-exp-lcr-for-par-pump-3-vass] and [seqdoubleexpoential].
Given a 2-VASS \(V = (Q, T)\), it is well known [1] that the reachability set \(\mathop{\operatorname{\mathrm{Reach}}}\nolimits_q(V, s)\) of any source configuration \(s\) and target state \(q\) can be expressed as a finite union of linear sets \(\boldsymbol{b} + P^*\) for some \(\boldsymbol{b} \in \mathbb{N}^2\) and \(P \subseteq \mathbb{N}^2\). Moreover, [14] shows that the linear sets are constructed from the solution sets of a finite family of integer linear programs with norm \({\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}\), each with \(O(|Q|^2)\) variables and constraints. By 1, every linear-set representation \(\boldsymbol{b} + P^*\) satisfies \(\left\Vert{\boldsymbol{b}}\right\Vert, \left\Vert{P}\right\Vert \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}^{|Q|^2}\). This bound is exponential and therefore too coarse for our purposes. Recently, [19] observed that some finite parts of such representations can be treated as approximately linear sets while still admitting polynomial-size descriptions. These sets are defined in terms of restricted periodic sets.
A restricted periodic set is a triple \(\langle P, \boldsymbol{c}, K \rangle\) where \(P = \{\boldsymbol{p}_1, \dots, \boldsymbol{p}_k\} \subseteq \mathbb{N}^d \setminus \{\boldsymbol{0}\}\) is a finite set of periods, \(\boldsymbol{c} \in \mathbb{N}^{k}\) is a vector, and \(K \in \mathbb{N}\) is a number. We abbreviate such a triple as \({P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\) and identify it with the following set of vectors: \[{P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}} := \left\{ \sum_{i = 1}^{k} \boldsymbol{x}(i) \cdot \boldsymbol{p}_i \left|\, \boldsymbol{x} \in \mathbb{N}^k, \langle {\boldsymbol{c}, \boldsymbol{x}} \rangle \le K \right.\right\}.\] In particular, the set \({\{\boldsymbol{p}\}}^{\langle {{\boldsymbol{1}}, \cdot} \rangle \le {K}}\) is abbreviated as \(\{\boldsymbol{p}\}^{\le K}\). We define the norm of this representation by \(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits({P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}) := \max\{\left\Vert{P}\right\Vert, \left\Vert{\boldsymbol{c}}\right\Vert\}\). Notice that the parameter \(K\) does not contribute to the norm. Notice also that we do not require \(\boldsymbol{c} \in \mathbb{N}_{>0}^d\) and hence periodic sets \(P^*\) are a special kind of restricted periodic set with \(\boldsymbol{c} = \boldsymbol{0}\). A hybrid set is a set of the form \(S = \boldsymbol{b} + {P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\), where \(\boldsymbol{b} \in \mathbb{N}^d\) is the base, \({P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\) is a restricted periodic set. Its norm is defined to be \(\max\{\left\Vert{\boldsymbol{b}}\right\Vert, \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits({P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}})\}\). We write \(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S)\) for the norm of the representation of a hybrid set \(S\). The following characterization is from [19].
Theorem 1 ([19]). Let \(V\) be a 2-VASS. For any configuration \(s\) and state \(q\), the reachability set \(\mathop{\operatorname{\mathrm{Reach}}}\nolimits_q(V, s)\) is equal to a finite union of hybrid sets \(S = \boldsymbol{b} + {P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\), where \(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S) \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V, s)})}\).
We need to generalize the result of 1 in two accounts. Firstly, the single point source \(s\) is generalized to a hybrid set \(S\), and secondly, similar to [19], the \(2\)-VASS \(V\) is generalized to a geometrically 2-dimensional 3-VASS. [thm:hybrid-2vass-hybrid] formalizes the generalization.
theoremThmHybridTwoVASSHybrid Let \(V\) be a geometrically 2-dimensional 3-VASS, \(S = \boldsymbol{s} + {P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\) be a hybrid set satisfying \(P\subseteq \mathop{\operatorname{\mathrm{\mathrm{\small cyc}}}}\nolimits(V)\). For all states \(p,q\), the set \(\mathop{\operatorname{\mathrm{Reach}}}\nolimits_{q}({V},{p(S)})\) is a finite union of hybrid sets \(S' = \boldsymbol{b} + {P'}^{\langle {{\boldsymbol{c}'}, \cdot} \rangle \le {K'}}\) with \(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S') \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S)})}\). Moreover, \(P' \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(P) + \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V)\).
The proof of [thm:hybrid-2vass-hybrid] is placed in 11. Most of the arguments in the proof follow the related arguments in [19] closely.
Now we have represented reachability sets in geometrically 2-dimensional 3-VASS when the source belongs to a hybrid set. For our purpose, we need to know more about runs starting from a hybrid set. The following lemma establishes a bound on the length and the norm of the source of such runs in a geometrically 2-dimensional 3-VASS.
Lemma 2. Let \(V\) be a geometrically 2-dimensional 3-VASS, \(t\) be a configuration and \(S\) be a hybrid set. Then for every state \(p\), if \(p(\boldsymbol{x}) \xrightarrow{*} t\) in \(V\) for some \(\boldsymbol{x} \in S\), then there is also a run \(p(\boldsymbol{x}') \xrightarrow{\rho} t\) in \(V\) for some \(\boldsymbol{x}' \in S\) with \[\left\Vert{\boldsymbol{x}'}\right\Vert, |\rho| \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,t),\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S)})}.\]
To derive the length bound, we rely on a recent result about geometrically \(2\)-dimensional VASS from Chen et al. [18].
Theorem 2 ([18]). There exists a polynomial \(H\) such that, for every geometrically 2-dimensional VASS \((V,s,t)\), if \(s\xrightarrow{*}t\), then \(s \xrightarrow{\pi} t\) for some run \(\pi\) with \(|\pi| \le H(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,t))\).
Proof of 2. Equivalently, we have \(t \xrightarrow{*} p(\boldsymbol{x})\) in \({V}^{\mathrm{rev}}\). By [thm:hybrid-2vass-hybrid], there exists a hybrid set \(S'\) such that \(\boldsymbol{x} \in S' \subseteq \mathop{\operatorname{\mathrm{Reach}}}\nolimits_{p}({{V}^{\mathrm{rev}}},{t})\) and \(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S') \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,t)})}\). Therefore, one has that \(\boldsymbol{x} \in S \cap S' \neq \emptyset\). Assume that \[S = \boldsymbol{b} + {P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\text{ and }S' = \boldsymbol{b}' + {P'}^{\langle {{\boldsymbol{c}'}, \cdot} \rangle \le {K'}}.\] We may interpret each periodic set as a matrix whose columns are the vectors contained in the set, e.g., \(P' \in \mathbb{N}^{d \times |P'|}\). Then the intersection of these two sets can be described as the following linear system: \[\label{eq:intersect-of-hybrid-set} \begin{align} \begin{pmatrix} P &-P' \end{pmatrix} \boldsymbol{\lambda} &= \boldsymbol{b}' - \boldsymbol{b}\\ \begin{pmatrix} \boldsymbol{c}^{\dagger} & \boldsymbol{0}\\ \boldsymbol{0} & (\boldsymbol{c}')^{\dagger} \end{pmatrix}\boldsymbol{\lambda} &\le \begin{pmatrix} K\\ K' \end{pmatrix}, \end{align}\tag{4}\] where \(\boldsymbol{\lambda} \in \mathbb{N}^{|P|+|P'|}\), and the dimension \(|P|+|P'|\) is bounded by \[(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S)+1)^3+(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S')+1)^3 \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,t), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S)})}.\] Note that \(\boldsymbol{x}\) induces a solution \(\boldsymbol{\lambda}_{\boldsymbol{x}}\) to this system. We omit the inequalities in 4 and apply 2 to obtain a solution \(\boldsymbol{\lambda}_0 \le \boldsymbol{\lambda}_{\boldsymbol{x}}\) with \[\begin{pmatrix} P &-P' \end{pmatrix} \boldsymbol{\lambda}_0 = \boldsymbol{b}' - \boldsymbol{b},\] and \(\left\Vert{\boldsymbol{\lambda}_0}\right\Vert \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,t), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S)})}\). However, since \(\boldsymbol{c},\boldsymbol{c}' \ge \boldsymbol{0}\) and \(\boldsymbol{\lambda}_0 \le \boldsymbol{\lambda}_{\boldsymbol{x}}\), one has that \[\begin{pmatrix} \boldsymbol{c}^{\dagger} & \boldsymbol{0} \\ \boldsymbol{0} & (\boldsymbol{c}')^{\dagger} \end{pmatrix}\boldsymbol{\lambda}_0 \le \begin{pmatrix} \boldsymbol{c}^{\dagger} & \boldsymbol{0}\\ \boldsymbol{0} & (\boldsymbol{c}')^{\dagger} \end{pmatrix}\boldsymbol{\lambda}_{\boldsymbol{x}} \le \begin{pmatrix} K\\ K' \end{pmatrix},\] which implies that \(\boldsymbol{\lambda}_0\) is also a solution to 4 . Let \[\boldsymbol{x}':=\boldsymbol{b} + \begin{pmatrix} P &\boldsymbol{0} \end{pmatrix} \boldsymbol{\lambda}_0.\] It holds that \(\boldsymbol{x}' \in S \cap S'\) and \(\left\Vert{\boldsymbol{x}'}\right\Vert \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,t),\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S)})}\). Since \(\boldsymbol{x}' \in S'\), we obtain that \(t\xrightarrow{*}p(\boldsymbol{x}')\) in \({V}^{\mathrm{rev}}\), which implies that \(p(\boldsymbol{x}')\xrightarrow{*}t\) in \(V\). By applying 2, there exists a short run \(\rho\) with \[|\rho| \le H(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,t) + 3\cdot\left\Vert{\boldsymbol{x}'}\right\Vert)\le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,t), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S)})}.\] We are done. ◻
In this section, we focus on bounding the length of the shortest runs for diagonal 3-VASS instances, i.e., \((V, s, t)\in\rm{Diag}\mathbb{VASS}^3\). One may expect that the reachability from \(s\) to \(t\) is equivalent to the \(\mathbb{Z}\)-reachability, as every \(\mathbb{Z}\)-run from \(s\) to \(t\) may be lifted to a valid run using the pumping cycles. However, the effect of the pumping cycle on \(s\) may differ from that of the dual pumping cycle on \(t\), and it might not be the case that one can compensate for their difference by adjusting the \(\mathbb{Z}\)-run. Previous work [19] introduced the notion of wideness to identify whether such a compensation can be achieved. Roughly speaking, \(V\) is wide if every positive vector is contained in \(\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(V)\). They showed that a wide instance in \(\rm{Diag}\mathbb{VASS}^3\) allows the lifting of \(\mathbb{Z}\)-runs. The drawback lies in the handling of non-wide instances. In [19], a non-wide sequential VASS is reduced to a sequential VASS of fewer components. Then, a length bound of the shortest runs in the original VASS is obtained by induction, which yields merely a triply-exponential bound.
For diagonal 3-VASS, we improve the induction by introducing a structured preprocessing step that, in the non-wide case, transforms all components into geometrically 2-dimensional ones. A doubly-exponential bound on the length of the shortest runs is then derived using the linear Diophantine system of geometrically 2-dimensional VASS [10]. As a result, we prove the following proposition for \(\rm{Diag}\mathbb{VASS}^3\).
propositionpropDiagonalCaseLenbound If \((V, s, t)\in \rm{Diag}\mathbb{VASS}^3\) has \(k\) components, \(\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t) \leq \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V, s, t)^{2^{\mathop{\operatorname{\mathrm{poly}}}\nolimits({k})}}\).
We distinguish between the wide and the non-wide cases. Recall that \(V\) is wide if \(\mathbb{Q}_{\ge 0}^{3}\subseteq{}\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(V)\) or \(\mathbb{Q}_{\ge 0}^{3}\subseteq{}\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits({V}^{\mathrm{rev}})\); otherwise, it is non-wide. The length bound of the shortest runs for the wide case is provided by [prop:diagonal-wide-case-lenbound], whereas that for the non-wide case is established in [prop:diagonal-nonwide-case-lenbound]. All omitted proofs are given in 12.
The wide case is relatively easy, as it can be reduced to an already established result. Note that here we use a more relaxed definition than the one adopted in [19].
Suppose \((V, s, t)\in \rm{Diag}\mathbb{VASS}^3\), \(V\) has \(k\) components and \(V\) is wide. Then \(\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t) \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V, s, t)})}^{k}\).
A result analogous to [prop:diagonal-wide-case-lenbound] is presented in [19]. The difference is to do with the definition of wideness. Our definition is slightly more permissive than that of [19]. Nevertheless, the two formulations are in fact equivalent in the presence of diagonality. We recall the definition of wideness in [19]. Let \(X = \{\boldsymbol{v}_1, \boldsymbol{v}_2, \ldots, \boldsymbol{v}_k\} \subseteq \mathbb{Q}^d\) be a finite set of vectors. The open cone generated by \(X\) is \[\mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits_{>0}(X) := \left\{ \sum_{i \in [k]} \lambda_i \boldsymbol{v}_i \mid \lambda_i \in \mathbb{Q}_{>0} \text{ for all } i \in [k] \right\}.\] Let \(C_1, \ldots, C_k \subseteq \mathbb{Q}^3\) be a sequence of (finitely generated) open cones, then their open sequential cone is \[\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits_{>0}(C_1, \ldots, C_k) := \left\{ \sum_{i \in [k]} \boldsymbol{v}_i \mid \boldsymbol{v}_i \in C_i, \sum_{j = 1}^i \boldsymbol{v}_i \in \mathbb{Q}_{>0}^d \text{ for all } i \in [k] \right\}.\] Accordingly, we define the open cone and the open sequential cone of a sequential VASS. A sequential \(3\)-VASS \(V = (V_1)u_1(V_2)\ldots u_{k-1}(V_k)\) is said to be openly wide if either \(\mathbb{Q}_{>0}^3 \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits_{>0}(V)\) or \(\mathbb{Q}_{>0}^3 \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits_{>0}({V}^{\mathrm{rev}})\). We are now able to invoke the following result.
Lemma 3 ([19]). Suppose \((V, s, t)\in \rm{Diag}\mathbb{VASS}^3\), \(V\) has \(k\) components and \(V\) is openly wide. Then \(\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t) \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V, s, t)})}^{k}\).
We are done by the following observation.
lemmaLemWideIFFOpenWide Suppose \((V, s, t)\in\rm{Diag}\mathbb{VASS}^3\). Then \(V\) is wide if and only if \(V\) is openly wide.
In this subsection, we consider the diagonal but non-wide case, which is more intricate. The main result is the following proposition.
Suppose \((V, s, t)\in \rm{Diag}\mathbb{VASS}^3\), \(V\) is non-wide and has \(k\) components. Then \(\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t)\le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V, s, t)^{2^{{\mathop{\operatorname{\mathrm{poly}}}\nolimits({k})}}}\).
We fix \(V = (V_1)u_1\ldots u_{k-1}(V_k)\). We first lay down the necessary technical groundwork, and then establish the doubly-exponential bound.
Here we generalize the following properties to \(\mathrm{Diag}\mathbb{VASS}^d\). First, we show the existence of separating hyperplanes of the sequential cones of \(V\) and \({V}^{\mathrm{rev}}\). For that purpose we split the sequential VASS \(V= (V_1)u_1\ldots u_{k-1}(V_k)\) at a component \(V_i\), and denote the head by \(\mathcal{H}_i\) and the tail by \(\mathcal{T}_i\). Formally, \[\begin{align} \mathcal{H}_i := &(V_1)u_1\ldots u_{i-1}(V_i),\\ \mathcal{T}_i := &(V_i)u_i\ldots u_{k-1}(V_k). \end{align}\] Let \(C \subseteq \mathbb{Q}^d\) be a set of vectors, and \(\boldsymbol{n} \in \mathbb{Q}^d\) be a vector. We write for example \(\langle {\boldsymbol{n}, C} \rangle \ge 0\) to denote that \(\langle {\boldsymbol{n}, \boldsymbol{c}} \rangle \ge 0\) for all \(\boldsymbol{c} \in C\). The following lemma shows that in the non-wide case, \(\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(\mathcal{H}_i)\) and \(\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits({\mathcal{T}_i}^{\mathrm{rev}})\) can be separated by some vector in \(\mathbb{Z}^d\).
lemmaLemSepratingPlaneNonWide Suppose \((V,s,t)\in \mathrm{Diag}\mathbb{VASS}^d\) is non-wide and has \(k\) components. For each \(i\in[k]\), there exists a non-zero vector \(\boldsymbol{n} \in \mathbb{Z}^d\) such that \(\langle {\boldsymbol{n}, \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(\mathcal{H}_i)} \rangle \ge 0\) and \(\langle {\boldsymbol{n}, \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits({\mathcal{T}_i}^{\mathrm{rev}})} \rangle \le 0\). Moreover, \(\left\Vert{\boldsymbol{n}}\right\Vert \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}^{k^3d^{5}}\).
Next, we show that any configuration reachable from \(s\) has bounded distance from the sequential cone of \(V\).
lemmaLemmaReachEqSeqConePlusBoundedOfDiag Suppose \((V,s,t)\in \mathrm{Diag}\mathbb{VASS}^d\) is non-wide and has \(k\) components. Let \(s = p(\boldsymbol{u})\). For any configuration \(t = q(\boldsymbol{v})\) in \(V_k\) that is reachable from \(s\), we have \(\boldsymbol{v} \in \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(V) + \boldsymbol{h}\) and \(\left\Vert{\boldsymbol{h}}\right\Vert \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}^{d+1}\cdot\left\Vert{\boldsymbol{u}}\right\Vert\) for some \(\boldsymbol{h} \in \mathbb{Z}^d\).
It should be pointed out that a similar result already appears in [19]. Their proof is built on a slightly different definition of sequential cones based on open cones, and the closeness is measured by Euclidean distance.
Consider a run \(s \xrightarrow{\pi} t\) in \(V\). Let \(c_i\) be a configuration along \(\pi\) whose state belongs to \(V_i\). By [lem:reach-eq-seq-cone-plus-bounded-of-diag] we know that the counter value of \(c_i\) cannot be too far from both \(\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(\mathcal{H}_i)\) and \(\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits({\mathcal{T}_i}^{\mathrm{rev}})\). Moreover, these two sequential cones are separated by a plane by [lem:separating-plane-non-wide]. We deduce that \(c_i\) must be close to this plane. We now formally justify this intuition. Let \(\boldsymbol{n}_i \in \mathbb{Z}^3\) be a normal vector given by [lem:separating-plane-non-wide] satisfying \(\left\Vert{\boldsymbol{n}_i}\right\Vert \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}^{k^3}\).
lemmaLemmaNonWideBoundedInnerProd Suppose \((V,s,t)\in\rm{Diag}\mathbb{VASS}^3\) is non-wide and has \(k\) components. Let \(c = p(\boldsymbol{z})\) be a configuration in \(V_i\) such that \(s \xrightarrow{*} c \xrightarrow{*}t\). Then \(|\langle {\boldsymbol{n}_i, \boldsymbol{z}} \rangle| \le B:= {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}^{k^3} \cdot (\left\Vert{s}\right\Vert + \left\Vert{t}\right\Vert)\).
Now we can encode the inner product with \(\boldsymbol{n}_i\) into states in each component \(V_i\). The reachability set of each component can be expressed as a union of hybrid sets, one by one, thanks to [thm:hybrid-2vass-hybrid]. To be explicit, recall that we are working with \(V = (V_1)u_1\ldots u_{k-1}(V_k)\). For consistency, we assume that there is a dummy bridge \(u_k\) after the last component \(V_k\) before the state of \(t\) whose effect is zero. We have for each component \(V_i\) a vector \(\boldsymbol{n}_i\) given by [lem:separating-plane-non-wide]. Let \(B_n\) be the bound for all \(\left\Vert{\boldsymbol{n}_i}\right\Vert\). Then \(B_n \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}^{k^3}\). Also, let \(B_h\) be the bound given by [lem:non-wide-bounded-inner-prod]. We have \(B_h \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}^{k^3}\cdot (\left\Vert{s}\right\Vert + \left\Vert{t}\right\Vert)\). For each component \(V_i = (Q_i, T_i)\) and the bridge \(u_i = r \xrightarrow{\boldsymbol{a}_i} r'\), we shall define a geometrically 2-dimensional \(3\)-VASS \(V_i' = (Q_i', T_i')\) where \(Q_i' = \{q_v \mid q\in Q_i, v \in [-B_h, B_h]\} \cup \{r'\}\), and \(T_i\) contains all the transitions of the form \(p_u \xrightarrow{\boldsymbol{a}} q_v\) satisfying \(p\xrightarrow{\boldsymbol{a}}q \in T_i\) and \(\langle {\boldsymbol{n}_i, \boldsymbol{a}} \rangle = v - u\); moreover, we add transitions \(r_v \xrightarrow{\boldsymbol{a}_i} r'\) for all \(v \in [-B_h, B_h]\). By [lem:non-wide-bounded-inner-prod], every configuration \(p(\boldsymbol{x})\) in \(V_i\) on some run from \(s\) to \(t\) is mapped to a configuration \(p_u(\boldsymbol{x})\) where \(u = \langle {\boldsymbol{n}_i, \boldsymbol{x}} \rangle \in [-B_h, B_h]\). Notice that \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V_i') \le \mathcal{O}(B_h) \cdot \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V_i) \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}^{k^3}\cdot (\left\Vert{s}\right\Vert + \left\Vert{t}\right\Vert)\). We remark that each \(V_i'\) is constructed independently and should not be treated as a component of a new VASS.
In the following, we will refer to the polynomials named below.
\(L(x, y)\) from 2 for bounding the length of a run in a geometrically 2-dimensional 3-VASS whose source is a hybrid set and whose target is a fixed configuration;
\(H(x,y)\) from [thm:hybrid-2vass-hybrid] for bounding the size of the representation of a hybrid set of a reachability set of geometrically 2-dimensional 3-VASS.
For example, the conclusion of 2 is now written as “\(\left\Vert{\boldsymbol{x}'}\right\Vert, |\rho| \le L({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,t),\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S)})\)”. We then define a length function by induction (from \(k\) to \(1\)). \[\begin{align} f_{k}(x) &:=& L\left(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V_{k}', t), x\right), \\ f_{j}(x) &:=& 2 L\left(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V_j') + f_{j+1}\left(C \cdot H(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V_j'), x)^2\right), x\right), \text{ for } 0< j < k, \end{align}\] where \(C := B_h +3B_n+ 1\). Intuitively, for each \(j\in[k]\), \(f_j\) represents an upper bound on the minimal distance to the target \(t\) when starting from some hybrid set in component \(j\). The variable \(x\) represents the norm of the set. We show that these functions \(f_j\) are doubly-exponentially bounded. The bounding function \(f_1(x)\) is what we are looking for. The following lemma provides an upper bound for \(f_1(x)\).
lemmaLemmaBoundFone \(f_1(x) \le (\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V, s, t) + x)^{2^{{\mathop{\operatorname{\mathrm{poly}}}\nolimits({k})}}}\).
We now have all the tools to prove [prop:diagonal-nonwide-case-lenbound]. The strategy of bounding \(\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V, s, t)\) is to perform an induction over the components of \(V\). Starting from \(s\), we may split a run to \(t\) into a prefix \(\sigma\) in the first component and the first bridge \((V_1)u_1\), followed by a suffix \(\rho\) in \(\mathcal{T}_2 = (V_2)u_2\ldots u_{k-1}(V_k)\). The target of \(\sigma\), which is also the source of \(\rho\), falls in some reachability set in the geometrically 2-dimensional 3-VASS \(V_1'\), which we can efficiently represent as a hybrid set \(S\) of norm \(H(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V_1'), \left\Vert{s}\right\Vert)\). We then handle the suffix \(\rho\) inductively with is source \(S\) in mind, deriving both a bound on its length and a bound on the norm of its source, i.e.the target of \(\sigma\). After this, the length of \(\sigma\) can be bounded in terms of the polynomial \(L(x, y)\) using 2. To realize this inductive argument, we prove the following lemma that strengthens [prop:diagonal-nonwide-case-lenbound] in a way that is favorable for induction. [prop:diagonal-nonwide-case-lenbound] then follows immediately by applying [lem:bound-f1] with \(x = \left\Vert{{s}}\right\Vert\).
Lemma 4. Suppose \(V\in\rm{Diag}\mathbb{VASS}^3\) is non-wide and has \(k\) components. Let \(j \in [k]\), \(p\) be a state in \(V_j\), \(S = \boldsymbol{b} + {P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\) be a hybrid set such that \(\langle {\boldsymbol{n}_j, P} \rangle = 0\), \(P \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(\mathcal{H}_j)\) and \(S \subseteq \mathop{\operatorname{\mathrm{Reach}}}\nolimits_{p}({\mathcal{H}_j},{s})\). If \(p(S) \xrightarrow{*} t\) in \(\mathcal{T}_j\), then there exists \(\boldsymbol{s} \in S\) and a run \(\pi\) with \(p(\boldsymbol{s}) \xrightarrow{\pi} t\) and \(\left\Vert{\boldsymbol{s}}\right\Vert, |\pi| \le f_j(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S))\).
Proof. Notice that any run from \(p(S)\) to \(t\) must use the bridge \(u_j\). Let \(u_j\) be the transition \(r\xrightarrow{\boldsymbol{a}}r'\) where \(r\) is a state in \(V_j\) and \(r'\) is a state in \(V_{j+1}\) (or \(r'\) is the state of \(t\) when \(j = k\)). As configurations in \(p(S)\) is reachable from \(s\), and \(t\) is reachable from \(p(S)\), by [lem:non-wide-bounded-inner-prod] our construction of \(V_j'\) guarantees that \(t\) is also reachable (in the original VASS) from \(r'(\mathop{\operatorname{\mathrm{Reach}}}\nolimits_{r'}({V_j'},{p_u(S)}))\) where \(u = \langle {\boldsymbol{n}_j, \boldsymbol{b}} \rangle\). To justify this, consider any run \(p(\boldsymbol{s}) \xrightarrow{\pi_j} r'(\boldsymbol{s}') \xrightarrow{*} t\) where \(\boldsymbol{s} \in S\). By [lem:non-wide-bounded-inner-prod] every configuration \(q(\boldsymbol{z})\) on \(\pi_j\) satisfies \(|\langle {\boldsymbol{n}_j, \boldsymbol{z}} \rangle| \le B_h\). Hence \(\pi_j\) can be easily projected into a run in \(V_j'\) from \(p_u(\boldsymbol{s})\) to \(r'(\boldsymbol{s}')\). Hence, the set \(r'(\mathop{\operatorname{\mathrm{Reach}}}\nolimits_{r'}({V_j'},{p_u(S)}))\) must contain all configurations that occurs on some run from \(p(S)\) to \(t\) after the bridge \(u_j\). Notice that \(\mathop{\operatorname{\mathrm{\mathrm{\small cyc}}}}\nolimits(V_j')\) is orthogonal to \(\boldsymbol{n}_j\). We may further assume that \(\mathop{\operatorname{\mathrm{\mathrm{\small cyc}}}}\nolimits(V_j')\) is the whole plane orthogonal to \(\boldsymbol{n}_j\) by adding isolated cycles to \(V_j'\) if necessary, hence the condition \(\langle {\boldsymbol{n}_j, P} \rangle = 0\) guarantees \(P\subseteq \mathop{\operatorname{\mathrm{\mathrm{\small cyc}}}}\nolimits(V_j')\).
We prove the lemma by backward induction on \(j\). The base case \(j = k\) is exactly 2 applied to \(V_k'\). Now we proceed with \(j < k\). By [thm:hybrid-2vass-hybrid], \(\mathop{\operatorname{\mathrm{Reach}}}\nolimits_{r'}({V_j'},{p_u(S)})\) is a finite union of hybrid sets \(S' = \boldsymbol{b}' + {P'}^{\langle {{\boldsymbol{c}'}, \cdot} \rangle \le {K'}}\) with \(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S') \le H(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V_j'), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S))\). In the following, we let \(\overline{V_j}\) be the VASS obtained from \(V_j\) by adding the bridge transition \(u_j\) from \(r\) to \(r'\), as we need to consider the sub-runs before \(\mathcal{T}_{j+1}\). By the above argument, for one of such set \(S'\) we have \(p(S) \xrightarrow{*} r'(S')\) in \(\overline{V_j}\) and \(r'(S') \xrightarrow{*} t\) in \(\mathcal{T}_{j+1}\). We would like to apply the induction hypothesis to \(r'(S')\) in \(\mathcal{T}_{j+1}\). We are however not guaranteed that \(\langle {\boldsymbol{n}_{j+1}, P'} \rangle = 0\), and it is not straightforward to see \(P' \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(\mathcal{H}_{j+1})\). To meet these properties, recall that by [thm:hybrid-2vass-hybrid] we have \(P' \subseteq\mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V_j') + \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(P) \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V_j) + \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(P)\). Together with the condition \(P \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(\mathcal{H}_j)\), we have \[P' \subseteq(\mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(P) + \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V_j) ) \cap \mathbb{N}^3 \subseteq (\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(\mathcal{H}_j) + \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V_{j+1})) \cap \mathbb{N}^3 = \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(\mathcal{H}_{j+1}).\] Then by [lem:separating-plane-non-wide] we have \(\langle {\boldsymbol{n}_{j+1}, P'} \rangle \ge 0\). Extract from \(P'\) the set of vectors \(P_+'\) with positive inner products with \(\boldsymbol{n}_{j+1}\), we claim that it is enough to add these vectors for a bounded number of times to produce a vector \(\boldsymbol{s}'\) with \(p(S) \xrightarrow{*} r'(\boldsymbol{s}') \xrightarrow{*} t\), since vectors reachable at state \(r'\) have bounded inner products with \(\boldsymbol{n}_{j+1}\) by [lem:non-wide-bounded-inner-prod]. To be specific, let \(\boldsymbol{s} \in S\) and \(\boldsymbol{s}' \in S'\) render true \(p(\boldsymbol{s}) \xrightarrow{*} r'(\boldsymbol{s}') \xrightarrow{*} t\). Then \(\boldsymbol{s}' = \boldsymbol{b}' + P'_+ \boldsymbol{c}_+ + P'_0\boldsymbol{c}_0\) for some coefficients \(\boldsymbol{c}_+\) and \(\boldsymbol{c}_0\), where \(P'_0 = P' \setminus P_+'\) contains the vectors in \(P'\) orthogonal to \(\boldsymbol{n}_{j+1}\). By [lem:non-wide-bounded-inner-prod], we have \(|\langle {\boldsymbol{n}_{j+1}, \boldsymbol{s}'} \rangle| = |\langle {\boldsymbol{n}_{j+1}, \boldsymbol{b}' + P'_+\boldsymbol{c}_+} \rangle| \le B_h\). Hence \(|\langle {\boldsymbol{n}_{j+1}, P_+'\boldsymbol{c}_+} \rangle| \le B_h + |\langle {\boldsymbol{n}_{j+1}, \boldsymbol{b}'} \rangle| \le B_h + 3B_n\cdot \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S')\). Clearly the norm of \(\boldsymbol{c}_+\) is bounded by \(\left\Vert{\boldsymbol{c}_+}\right\Vert_1 \le B_h + 3B_n\cdot \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S')\). In other words, \(\boldsymbol{p}' := P_+'\boldsymbol{c}_+\) is a sum of at most \(B_h + 3B_n\cdot\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S')\) vectors from \(P_+'\). We have \(\left\Vert{\boldsymbol{p}'}\right\Vert \le (B_h + 3B_n)\cdot\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S')^2\).
We then replace \(S'\) by \(S'' = \boldsymbol{b}' + \boldsymbol{p}' + {P_0'}^{\langle {{\boldsymbol{c}''}, \cdot} \rangle \le {K''}}\), where \(\boldsymbol{c}''\) is obtained by projecting \(\boldsymbol{c}'\) onto indices corresponding to \(P_0'\), and \(K''\) is obtained by subtracting from \(K'\) the inner product induced by \(\boldsymbol{p}'\). It still holds that \(r'(S'') \xrightarrow{*} t\) in \(\mathcal{T}_{j+1}\). Moreover, \(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S'') \le (B_h+3B_n + 1)\cdot \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S')^2\). Now we apply the induction hypothesis, and deduce that there exists \(\boldsymbol{s}'' \in S''\) and a run \(r'(\boldsymbol{s}'') \xrightarrow{\pi''} t\) in \(\mathcal{T}_{k+1}\) such that \[\begin{align} \left\Vert{\boldsymbol{s}''}\right\Vert, |\pi''| &\le f_{j+1}(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S''))\\ &\le f_{j+1}((B_h + 3B_n + 1)\cdot H(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V_j'), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S))^2)\\ &= f_{j+1}(C\cdot H(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V_j'), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S))^2). \end{align}\] Moreover, as \(\boldsymbol{s}'' \in S'' \subseteq S' \subseteq \mathop{\operatorname{\mathrm{Reach}}}\nolimits_{r'}({V_j'},{p_u(S)}) \subseteq \mathop{\operatorname{\mathrm{Reach}}}\nolimits_{r'}({\overline{V_j}},{p(S)})\), there exists \(\boldsymbol{s} \in S\) and a run \(\pi: p(\boldsymbol{s}) \xrightarrow{\pi_1} r'(\boldsymbol{s}'') \xrightarrow{\pi''} t\) in \(\mathcal{T}_j\). By applying 2 to \(S\) and \(p(\boldsymbol{s}) \xrightarrow{*} r'(\boldsymbol{s}'')\), we may assume that \(\left\Vert{\boldsymbol{s}}\right\Vert\) and \(|\pi_1|\) are bounded by \[\begin{align} \left\Vert{\boldsymbol{s}}\right\Vert,|\pi_1| &\leq L(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V_j',\boldsymbol{s}''), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S))\\ &\leq L(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V_j')+f_{j+1}(C\cdot H(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V_j'), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S))^2). \end{align}\] Therefore, \(|\pi| = |\pi_1| + |\pi''| \le 2L(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V_j')+f_{j+1}(C\cdot H(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V_j'), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S))^2) = f_j(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S))\). ◻
Now we are done with [prop:diagonal-case-lenbound] by [prop:diagonal-wide-case-lenbound] and [prop:diagonal-nonwide-case-lenbound].
5 is about diagonal 3-VASS. In this section, we investigate upper bounds on the length of the shortest runs admitted by a pumpable 3‑VASS \((V, s, t)\), as shown in the following proposition.
propositionlenParPumpThreeVASS If \((V, s, t) \in \rm{Pump}\mathbb{VASS}^3\) has \(k\)-components, \(\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t) \le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V, s, t)^{2^{\mathop{\operatorname{\mathrm{poly}}}\nolimits({k})}}\).
We first briefly recall and elaborate on the proof strategy outlined in 3 for this section. By definition, in a pumpable VASS \((V,s,t)\), at least one coordinate along a given run can be increased to an arbitrarily large value. One may therefore expect that, once this “free” coordinate is available, the behavior of \((V,s,t)\) closely resembles that of a 2-VASS. Consequently, specialized pumping techniques for 2-VASS [25] (see 5) can be applied to identify additional pumping cycles, thereby extracting a jointly diagonal prefix from the original pumpable run. By then efficiently representing the reachability set of this jointly diagonal prefix as a hybrid set, we obtain a semi-diagonal VASS instance. This yields a self-reduction for \(\rm{Pump}\mathbb{VASS}^3\), controlled by the length function of \(\rm{Semi\text{-}diag}\mathbb{VASS}^3\). A similar argument also applies to the class \(\rm{Semi\text{-}diag}\mathbb{VASS}^3\). These two self-reductions are formalized in [prop:2-exp-lcr-for-par-pump-3-vass].
(i) \(\rm{Semi\text{-}diag}\mathbb{VASS}^3\) is doubly-exponentially self-reducible, and admits doubly-exponentially short runs. (ii) \(\rm{Pump}\mathbb{VASS}^3\) is doubly-exponentially self-reducible, and admits doubly-exponentially short runs.
Combined with [lem:2-exp-preserve-via-reduction], we get the length bound for \(\rm{Pump}\mathbb{VASS}^3\).
Proof of [prop:len-par-pump-3-vass]. Let \((V, s, t) \in \rm{Pump}\mathbb{VASS}^3\) be a \(k\)-component 3-VASS. By [prop:2-exp-lcr-for-par-pump-3-vass] and [lem:2-exp-preserve-via-reduction], it holds that \(\min \mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t) \le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V, s, t)^{2^{\mathop{\operatorname{\mathrm{poly}}}\nolimits({k})}}\). ◻
To establish [prop:2-exp-lcr-for-par-pump-3-vass], we begin by formally introducing the notion of joint diagonality.
Let \(V = (Q, T)\) be a \(d\)-VASS. Alternatively, a sequence of \(d\) cycles \(\theta_1, \theta_2, \dots, \theta_d\) is jointly diagonal if the sequential cone generated by their effects contains a positive vector, i.e., \[\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(\theta_1, \dots, \theta_{d}) \cap \mathbb{N}_{>0}^d \neq \emptyset,\] where \(\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(\theta_1, \dots, \theta_{d})\) is a short-hand for \(\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(\mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(\{\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_1)\}), \dots, \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(\{\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_d\})))\). The \(d\) cycles need not be distinct.
We shall impose the non-redundancy condition that, if \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_i)(\iota) < 0\) for some \(i, \iota \in [d]\), there must exist some \(j < i\) such that \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_j)(\iota) > 0\). Otherwise, the cycle \(\theta_i\) could be removed and replaced by a repetition of a preceding cycle without changing the sequential cone, while maintaining a total of \(d\) cycles. In what follows, we assume this condition by default. We say that a sequence of cycles \(\theta_1, \dots, \theta_d\) is enabled along \(p_1(\boldsymbol{x}_1), \dots, p_d(\boldsymbol{x}_d)\) if for each \(i \in [d]\), \(\theta_i\) is fireable at \(p_i(\boldsymbol{x}_i+\boldsymbol{a}_i)\) for some \(\boldsymbol{a}_i \in \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(\theta_1, \dots, \theta_{i-1})\). If a run \(\pi\) visits these configurations in that order, we also say that \(\theta_1, \dots, \theta_d\) are enabled along \(\pi\) and \(\pi\) is jointly diagonal.
The proof below is divided into three parts, corresponding to the following steps. In 6.1, we present the core technique for extracting joint diagonality from pumpability. In 6.2, we use the efficient representation established in 4 to transform joint diagonality into diagonality. Finally, in 6.3, we establish the two doubly-exponential self-reductions.
In this subsection, we show that, given a run \(s \xrightarrow{\pi} t\) in a pumpable 3-VASS \((V,s,t)\), one can either identify a jointly diagonal prefix of \(\pi\), or conclude that at least one coordinate along \(\pi\) remains bounded. Let \(\pi\) be a run in a \(d\)-VASS \(V\) and let \(B \in \mathbb{N}\). We define \(\mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi, B)\) as the set of indices \(i \in [d]\) such that every configuration \(q(\boldsymbol{x})\) on \(\pi\) satisfies \(\boldsymbol{x}(i) < B\). In other words, \(\mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi, B)\) consists of those coordinates remaining less than \(B\) along \(\pi\). With this notion, the above observation can be formally stated as follows.
lemmalemProgPumpOrBoundedInParThreeVASS Let \((V, s, t) \in \mathrm{Seq}\mathbb{VASS}^3\) be a \(k\)-component 3-VASS, \(s\) is pumpable and \(s \stackrel{\pi}{\longrightarrow}t\). There exists some \(B={\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s)})}^{k}\) such that \(\pi\) can be partitioned into \[s = c_1 \xrightarrow{\pi_1} c_2 \xrightarrow{\pi_2} c_3 \xrightarrow{\pi_3} t,\] where \(|\mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi_1, B)| \ge 2\) and \(|\mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi_1\pi_2, B)| \ge 1\). If \(\pi_3 \neq \varepsilon\), there is a sequence of non-redundant jointly diagonal cycles \(\theta_1, \theta_2, \theta_3\), enabled along \(c_1\), \(c_2\), \(c_3\), such that \(|\theta_i| \le B\) for all \(i \in [3]\) and the followings are valid.
For each \(\iota \in [3]\) with \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_1)(\iota) = 0\), it holds that \(\iota \in \mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi_1, B)\).
For each \(\iota \in [3]\) with \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_1)(\iota) = \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_2)(\iota) = 0\), it holds that \(\iota \in \mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi_2, B)\).
We remark that these segments can be empty. In fact, the construction further guarantees that \(\theta_2=\theta_1\) whenever \(\pi_1=\varepsilon\), and \(\theta_3=\theta_2\) whenever \(\pi_2=\varepsilon\). If \(\pi_3 = \varepsilon\), then at least one coordinate remains bounded along \(\pi\). To establish [lem:prog-pump-or-bounded-in-par-3-vass], we need to identify along \(\pi\) three short cycles, possibly with repetition, whose effects generate a sequential cone containing a strictly positive vector. The pumpability of \(s\) guarantees the existence of the initial non-negative cycle \(\theta_1\). If \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_1)\) contains at least one zero entry, a second, distinct cycle is required. Since \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_1)\) is guaranteed to have at least one positive entry, we may ignore the corresponding coordinate and apply the following pumping technique for 2-VASS, known as the Non-Negative Cycle Lemma in [25], to obtain the second short cycle.
Lemma 5 ([25]). There exists a polynomial \(P\) such that, for any \(k\)-component 2-VASS \((V, s, t)\), if there is a run \(s \xrightarrow{\pi} t\) such that \(\left\Vert{t}\right\Vert \ge P(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V))^k \cdot (\left\Vert{s}\right\Vert + 1)\), then \(\pi\) contains a pumpable configuration enabling a cycle \(\theta\) with \(|\theta| \le P(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V))\).
The bound in the original statement is in the form of \(P(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V))^{|Q|}\). But if one looks into the proof in [25], the exponent is bounded by the number of SCCs, which subsumes \(|Q|\).
In the general scenario, applying 5 yields a cycle \(\theta_2\) that, together with \(\theta_1\), allows one to pump up only two coordinates. In this case, we ignore both the coordinates and view \(V\) as a 1-VASS. 5 remains applicable and enables us to obtain a third cycle. It is not difficult to see that, by an appropriate combination, these three cycles can be fired in sequence to increase all three coordinates. We also emphasize that if any application of 5 fails, then \(\pi_3=\varepsilon\) follows immediately; this is precisely where the dichotomy arises.
Recall that a \(d\)-dimensional hybrid set \(S\) is a set of the form of \(\boldsymbol{b}+{P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\), where \(\boldsymbol{b}\in \mathbb{N}^d\), \(K \in \mathbb{N}\), \(P = \{\boldsymbol{p}_1,\cdots, \boldsymbol{p}_k\} \subseteq \mathbb{N}^d\setminus \{\boldsymbol{0}\}\) is a finite set, and \(\boldsymbol{c} \in \mathbb{N}^{k}\). The description size of this set is given by \(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S)=\max\{\left\Vert{\boldsymbol{b}}\right\Vert, \left\Vert{P}\right\Vert, \left\Vert{\boldsymbol{c}}\right\Vert\}\). Notice that for each \(i \in [k]\), if \(\boldsymbol{c}(i) = 0\), then \(S + \{\boldsymbol{p}_i\}^*\subseteq S\), meaning that there is no restriction on the number of times \(\boldsymbol{p}_i\) is repeated. We may write \(\boldsymbol{b}+{P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\) as \(\boldsymbol{b} + {P_1}^{\langle {{\boldsymbol{c}'}, \cdot} \rangle \le {K}} + P_0^*\), where \(P = P_1 \cup P_0\), to emphasize that the periods in \(P_0\) may be used arbitrarily many times.
The main result of this part is the following proposition, which provides a characterization of the approximation properties of jointly diagonal configurations.
propositionpropProgPumpToDiagPump Let \((V, s, t) \in \mathrm{Seq}\mathbb{VASS}^3\) be a \(k\)-component 3-VASS and \(s \stackrel{\pi}{\longrightarrow}t\) be a run in \(V\). If \(s\) is pumpable, then there exist a configuration \(c = q(\boldsymbol{y})\) in \(\pi\) and a hybrid set \(S = \boldsymbol{b} + {P_1}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}} + P_0^*\) such that \(\boldsymbol{y} \in S \subseteq \mathop{\operatorname{\mathrm{Reach}}}\nolimits_{q}({V},{s})\) and the following statements are valid.
\(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S) \le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V, s)^{\mathcal{O}(k^2)}\),
\(\min \mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V, s, q(\boldsymbol{z})) \le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,q(\boldsymbol{z}))^{\mathcal{O}(k^2)}\) for all \(\boldsymbol{z} \in S\), and
\(P_0 \cap \mathbb{N}_{>0}^3 \neq \emptyset\), unless \(c = t\).
[prop:prog-pump-to-diag-pump-1] ensures that the reachability set of a pumpable sequential 3-VASS at some given state \(q\) can be approximated by a hybrid set \(\boldsymbol{b} + {P_1}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}} + P_0^*\) of polynomial size. [prop:prog-pump-to-diag-pump-2] ensures that every configuration \(q(\boldsymbol{y})\) in this hybrid set admits a run from \(s\) that is short in terms of \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,q(\boldsymbol{z}))\). Concerning \(P_0\), there are two cases. (i) If \(P_0 \cap \mathbb{Q}_{>0}^3 \neq \emptyset\), we can add the periods in \(P_1 \cup P_0\) as self-loops at the state \(q\), and let \(q(\boldsymbol{b})\) be the new source configuration. [prop:prog-pump-to-diag-pump-3] guarantees that the new source \(q(\boldsymbol{b})\) is diagonal in the new VASS. (ii) Otherwise, \(P_0 \cap \mathbb{Q}_{>0}^3 = \emptyset\), then \(t=q(\boldsymbol{y})\), where [prop:prog-pump-to-diag-pump-2] implies that there is a run from \(s\) to \(t\) whose length is bounded by \({\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,t)})}^{k^2}\).
We provide a high-level proof sketch of [prop:prog-pump-to-diag-pump]. Firstly, [lem:prog-pump-or-bounded-in-par-3-vass] guarantees that prior to the identification of a sequence of jointly diagonal cycles \(\theta_1, \theta_2, \theta_3\), there exist some coordinates bounded throughout the prefix. Consequently, this bounded coordinate can be encoded into the states, reducing the system to a 2-VASS and permitting the application of the approximation technique. The primary technical challenge is to ensure that the resulting period set \(P_0\) contains a strictly positive vector. To address this, we partition the run into two segments at the configuration where \(\theta_2\) becomes enabled. After applying the approximation technique to the first segment, we obtain a hybrid set whose period set can, without loss of generality, be assumed to contain \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_1)\), by the following lemma.
lemmalemReachClosedUnderPumpingCycle Let \((V,s, q(\boldsymbol{y}))\) be a d-VASS such that \(s = p(\boldsymbol{x}) \xrightarrow{*} q(\boldsymbol{y})\) in \(V\). Suppose \(s \xrightarrow{\theta_1} p(\boldsymbol{x}+\boldsymbol{a})\) in \(V\) for some cycle \(\theta_1\) with \(\boldsymbol{a}:=\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_1) \ge \boldsymbol{0}\) and \(q(\boldsymbol{y}+\lambda \cdot\boldsymbol{a})\xrightarrow{\theta_2} q(\boldsymbol{y}+\boldsymbol{b})\) in \(V\) for some \(\lambda \in \mathbb{N}\) and some cycle \(\theta_2\) with \(\boldsymbol{b}:=\lambda\cdot\boldsymbol{a}+\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_2) \ge \boldsymbol{0}\). Then for each \(\ell \in \mathbb{N}\), it holds that \(\boldsymbol{y} + \ell\cdot \boldsymbol{b} \in \mathop{\operatorname{\mathrm{Reach}}}\nolimits_{q}({V},{s})\) and \[\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,q(\boldsymbol{y}+ \ell \cdot \boldsymbol{b})) \le \min \mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,q(\boldsymbol{y})) + \ell \cdot \lambda \cdot |\theta_1| + \ell\cdot |\theta_2|.\]
[lem:reach-closed-under-pumping-cycle] allows one to enrich the period set with an appropriate linear combination of \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_1)\) and \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_2)\), denoted as \(\boldsymbol{c}\), which possesses at least two positive entries in the general case. Subsequently, we perform a second round of approximation and incorporate a suitable combination of \(\boldsymbol{c}\) and \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_3)\) to obtain a strictly positive vector. It should be noted that the source of the second round of approximation is a hybrid set rather than a single point. This distinction makes it necessary to invoke [thm:hybrid-2vass-hybrid] and 2. Since the two constructions in the proof of [thm:hybrid-2vass-hybrid] and 2 are fundamentally similar, we provide a uniform statement in the following lemma.
lemmalemOneTurnApprox Suppose \(B \in \mathbb{N}\), \((V, p(\boldsymbol{x}), q(\boldsymbol{y}))\) is a 3-VASS, and \(p(\boldsymbol{x}) \stackrel{\pi}{\longrightarrow}q(\boldsymbol{y})\) for some \(\pi\) such that \(\mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi, B)\neq \emptyset\). For every nonempty set \(I\subseteq \mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi,B)\) and every hybrid set \(S_p\) satisfying (i) \(\boldsymbol{x} \in S_p\) and (ii) \(\boldsymbol{z}(\iota) = \boldsymbol{x}(\iota)\) for all \(\boldsymbol{z} \in S_p\) and all \(\iota \in I\), there exists a hybrid set \(S_q\) satisfying (i) \(\boldsymbol{y} \in S_q\) and (ii) \(\boldsymbol{z}(\iota) = \boldsymbol{y}(\iota)\) for all \(\boldsymbol{z} \in S_q\) and all \(\iota \in I\), and moreover the following statements are valid.
\(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S_q) \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({B + \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V) +\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S_p)})}\).
For each \(\boldsymbol{y}' \in S_q\), there exists some \(\boldsymbol{x}' \in S_p\) with a run \(p(\boldsymbol{x}')\stackrel{\rho}{\longrightarrow}q(\boldsymbol{y}')\) in \(V\) such that \[\left\Vert{\boldsymbol{x}'}\right\Vert, |\rho| \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({B + \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V) + \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S_p) + \left\Vert{\boldsymbol{y}'}\right\Vert})}.\]
To understand the lemma, one may think of it as an application of [thm:hybrid-2vass-hybrid] 2 to the geometrically \(2\)-VASS obtained by encoding the values in the \(\iota\)-counter, for all \(\iota\in I\), into states. We remark that the case where the source is a single point \(\boldsymbol{x}\) is also covered by [lem:one-turn-approx].
We are now ready to prove [prop:prog-pump-to-diag-pump]. Since \(B={\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s)})}^{k}\) and [lem:one-turn-approx] needs to be applied twice in the worst case, the \(\mathcal{O}(k^2)\) exponent arises naturally in [prop:prog-pump-to-diag-pump].
Proof of [prop:prog-pump-to-diag-pump]. Assume that \(V=(Q,T)\) and let \(M:=\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s)\). Note that \(M > 1\). By [lem:prog-pump-or-bounded-in-par-3-vass], we obtain a partition of \(\pi\) in the form of \[s = c_1 \xrightarrow{\pi_1} c_2 \xrightarrow{\pi_2} c_3 \xrightarrow{\pi_3} t\] with \(|\mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi_1, B)| \ge 2\) and \(|\mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi_1\pi_2, B)| \ge 1\) for some \(B = {\mathop{\operatorname{\mathrm{poly}}}\nolimits({M})}^k\). We assume that \(B \le M^{m\cdot k}\) for some \(m \ge 1\) and let the polynomials given in [lem:one-turn-approx] be bounded by \(F(x):=x^{m}\). There are two cases.
Then \(\mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi, B) \neq \emptyset\). Suppose \(s=p(\boldsymbol{x})\) and let \(c = q(\boldsymbol{y}) :=t\). Applying [lem:one-turn-approx] to the trivial hybrid set \(\{\boldsymbol{x}\}\), one obtains a hybrid set \(S\) such that \(\boldsymbol{y} \in S \subseteq \mathop{\operatorname{\mathrm{Reach}}}\nolimits_{q}({V},{s})\) and \[\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S) \le F(B + M) \le \left(M^{mk} + M\right)^m \le M ^{2m^2k}.\] Moreover, for each \(\boldsymbol{z} \in S\), one has that \(s \xrightarrow{\rho} q(\boldsymbol{z})\) in \(V\) with \(|\rho| \le F(B+M+\left\Vert{\boldsymbol{z}}\right\Vert)\), which implies that \(\boldsymbol{z} \in \mathop{\operatorname{\mathrm{Reach}}}\nolimits_{q}({V},{s})\) and \[\min \mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,q(\boldsymbol{z})) \le F(B+ \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,q(\boldsymbol{z}))) \le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,q(\boldsymbol{z})) ^{2m^2k}.\] This justifies the first case.
Then by [lem:prog-pump-or-bounded-in-par-3-vass], there exist jointly diagonal cycles \(\theta_1\), \(\theta_2\), \(\theta_3\) of length bounded by \(B\), enabled along \(\pi\), witnessed by configurations \(c_1\), \(c_2\), and \(c_3\). Assume that \(c_2=r(\boldsymbol{w})\) and \(c_3=p(\boldsymbol{v})\). For the first segment, we assume, w.l.o.g., that \(\Delta(\theta_1)(1) > 0\) and \(\{2,3\} \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi_1, B)\). Using again [lem:one-turn-approx], we get some hybrid set \(S_r = \boldsymbol{b}_r + {P_r}^{\langle {{\boldsymbol{c}_r}, \cdot} \rangle \le {K_r}}\) with \(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S_r) \le M ^{2m^2k}\) such that
\(\boldsymbol{w} \in S_r\) and \(\boldsymbol{z}(\iota) = \boldsymbol{w}(\iota)\) for all \(\boldsymbol{z} \in S_r\) and all \(\iota \in \{2,3\}\), and
for each \(\boldsymbol{z} \in S_r\), there is a run \(s\xrightarrow{\rho} r(\boldsymbol{z})\) in \(V\) such that \(|\rho| \le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,q(\boldsymbol{z}))^{2m^2k}.\)
Now consider the second cycle \(\theta_2\). Let \(\lambda := BM + 1\) and \[\boldsymbol{a} := \lambda \cdot \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_1) + \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_2).\] Since \(|\theta_2| \le B\), we have \(\boldsymbol{a} \ge \boldsymbol{0}\) and \(\boldsymbol{a}(\iota) > 0\) holds for every \(\iota \in [3]\) such that \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_1)(\iota) > 0\) or \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_2)(\iota) > 0\). Let \(S_r' := S_r+\{\boldsymbol{a}\}^* = \boldsymbol{b}_r + {P_r}^{\langle {{\boldsymbol{c}_r}, \cdot} \rangle \le {K_r}} + \{\boldsymbol{a}\}^*\). Notice that \(\left\Vert{\boldsymbol{a}}\right\Vert \le (\lambda+1)\cdot BM \le M^{2mk+3}\). Consequently \[\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S_r') \le M^{2m^2k} + \left\Vert{\boldsymbol{a}}\right\Vert \le M^{6m^2k}.\]
claimclaimLenFirstRoundApprox \(\boldsymbol{w}\in S_r'\subseteq \mathop{\operatorname{\mathrm{Reach}}}\nolimits_{r}({V},{s})\) and \(\min \mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,r(\boldsymbol{z})) \le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,r(\boldsymbol{z}))^{6m^2k}\) holds for each \(\boldsymbol{z}\in S_r'\).
If \(\boldsymbol{a} \ge \boldsymbol{1}\), we can finish the proof by taking \(c:=r(\boldsymbol{w})\). Otherwise, we continue with the second segment \(r(\boldsymbol{w})\xrightarrow{\pi_2} p(\boldsymbol{v})\), which satisfies \(|\mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi_2, B)| \ge 1\). Since \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_1)(1) > 0\), we assume w.l.o.g. that \(\boldsymbol{a}(3) = 0\), which implies that \(3 \in \mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi_1\pi_2, B)\) by [lem:prog-pump-or-bounded-in-par-3-vass]. For the hybrid set \(S_r'\), all elements in \(S_r'\) have \(\boldsymbol{w}(3)\) on their third entries. Applying [lem:one-turn-approx], there exists a hybrid set \(S_p = \boldsymbol{b}_p + {P_p}^{\langle {{\boldsymbol{c}_p}, \cdot} \rangle \le {K_p}}\) with \[\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S_p) \le F(B+M+\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S_r')) \le \left(3 \cdot M^{6m^2k}\right)^m \le M^{8m^3k}.\] Moreover, it renders true that
\(\boldsymbol{v} \in S_p\) and \(\boldsymbol{z}(3) = \boldsymbol{v}(3)\) holds for all \(\boldsymbol{z} \in S_p\), and
for each \(\boldsymbol{v}' \in S_p\), there exists some \(\boldsymbol{w}' \in S'_r\) with a run \(r(\boldsymbol{w}')\xrightarrow{\rho} p(\boldsymbol{v}')\) in \(V\) such that \[\label{eq:norm-w39-len-rho} \left\Vert{\boldsymbol{w}'}\right\Vert, |\rho| \le F(B+M+\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S_r') + \left\Vert{\boldsymbol{v}'}\right\Vert) \le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,p(\boldsymbol{v}'))^{8m^3k}.\tag{5}\]
Consider the last cycle \(\theta_3\). Recall that \(\lambda = BM + 1\). Let \(\boldsymbol{p} := \lambda \cdot \boldsymbol{a} + \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_3)\). Clearly \(\boldsymbol{p} \ge \boldsymbol{1}\). Let \(S_p' := \boldsymbol{b}_p + {P_p}^{\langle {{\boldsymbol{c}_p}, \cdot} \rangle \le {K_p}} + \{\boldsymbol{p}\}^*\). Then \(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S_p') \le \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S_p) + \left\Vert{\boldsymbol{p}}\right\Vert \le 2\cdot M^{8m^3k} \le M^{9m^3k}\). Let \(c := p(\boldsymbol{v})\) and \(S := S_p'\). The following claim justifies the second case.
claimclaimSecondRoundApprox \(\boldsymbol{v} \in S_p' \subseteq \mathop{\operatorname{\mathrm{Reach}}}\nolimits_{p}({V},{s})\) and \(\min \mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V, s, p(\boldsymbol{z})) \le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,p(\boldsymbol{z}))^{68m^5k^2}\) for all \(\boldsymbol{z} \in S_p'\).
The polynomial \(x^{68m^5}\) subsumes all the upper-bound polynomials mentioned in the proof. ◻
In this part, we establish the doubly-exponential self-reductions for \(\rm{Pump}\mathbb{VASS}^3\) and \(\rm{Semi\text{-}diag}\mathbb{VASS}^3\), namely [prop:2-exp-lcr-for-par-pump-3-vass]. Recall from [lem:prog-pump-or-bounded-in-par-3-vass] that a jointly diagonal prefix can be extracted from a pumpable run. The key step of the proof is to apply [prop:prog-pump-to-diag-pump] to characterize the target configurations of this prefix by a hybrid set \(S=\boldsymbol{b} + {P_1}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}} + P_0^*\), where \(P_0\) contains a positive vector. Adding these periods in \(P_1 \cup P_0\) to the original VASS as self-loops yields a semi-diagonal or diagonal VASS \((V',p(\boldsymbol{b}),t')\). It remains to take the linear constraint \(\langle {\boldsymbol{c},\cdot} \rangle\le K\) into account, which only requires comparing the size of \(K\) with \(\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V',p(\boldsymbol{b}),t')\). If \(K\) is sufficiently large, the restriction in \({P_1}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\) can be omitted in the sense that a short run in the new VASS \((V',s',t')\) also induces a run in \(V\). Otherwise, we know that \(K\) is bounded and so is every vector in \(\boldsymbol{b} + {P_1}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\). In the latter case, we add the periods in \(P_0\) to the original VASS and investigate the runs from different sources in the form of \(p(\boldsymbol{w})\) to \(t\), where \(\boldsymbol{w} \in \boldsymbol{b} + {P_1}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\). The size amplification during this reduction is thus controlled by the length function of a VASS class with a stronger pumpability property. The formal proof is given next.
Proof of [prop:2-exp-lcr-for-par-pump-3-vass]. We define a family of functions \((L_k)_{k \in \mathbb{N}}\) by letting \(L_k(x) := x^{2^{f(k)}}\) for all \(k \in \mathbb{N}\), where \(f\) is the polynomial given in [prop:diagonal-case-lenbound]. We then show that \(\rm{Semi\text{-}diag}\mathbb{VASS}^3\) is \((L_k)_{k \in \mathbb{N}}\)-controlled self-reducible. Let \(g\) be the maximum of the two polynomials appearing in [prop:prog-pump-to-diag-pump]. Assume that \(m \ge 1\) is such that \(g(x) \le x^m\) for all \(x >1\). Let \(R(x) := x^{21mk^2}\).
For every \(k \ge 1\) and every \(k\)-component VASS \((V,s,t)\in \rm{Semi\text{-}diag}\mathbb{VASS}^3\) with size \(M:=\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,t)\), we assume that \(s \xrightarrow{\pi} t\) in \(V\) for some run \(\pi\). In the case where \((V,s,t)\) is diagonal, \(\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t) \le L_k(M)\) by [prop:diagonal-case-lenbound]. Then \((V,s,t)\) is reduced to a \(0\)-component 3-VASS \((V',s',t')\) where \(V'\) contains a single state \(q\) and a single self-loop \((q,\boldsymbol{1}, q)\), \(s'=q(\boldsymbol{0})\) and \(t'=q(L_k(M)\cdot\boldsymbol{1})\).
claimClaimSemiDiagFirst The VASS \((V',s',t')\) has \(0\)-component. It holds that \(s'\xrightarrow{*}t'\) in \(V'\), \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V',s',t') \le R(L_k(M))\), and \(\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t) \le R(\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V',s',t')+M)\).
Suppose \(s\) is not diagonal in \(V\). By [prop:prog-pump-to-diag-pump], there exist a configuration \(c = q(\boldsymbol{y})\) on \(\pi\) and a hybrid set \(S = \boldsymbol{b} + {P_1}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}} + P_0^*\) such that \(\boldsymbol{y} \in S \subseteq \mathop{\operatorname{\mathrm{Reach}}}\nolimits_{q}({V},{s})\) and the following is valid. \[\label{eq:2-exp-lcr-for-par-pump-3-vass-1} \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S) \le g(M)^{k^2} \text{ and } \min \mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V, s, q(\boldsymbol{z})) \le g(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,q(\boldsymbol{z})))^{k^2} \text{ for all } \boldsymbol{z} \in S.\tag{6}\] Moreover \(q(\boldsymbol{y}) = t\) whenever \(P_0 \cap \mathbb{Q}_{>0}^3 = \emptyset\). There are two cases.
Then \(c = t\), and \(\min \mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V, s, t) \le g(M)^{k^2}\le R(M)\). We are done.
There exists some \(\boldsymbol{\delta} \in P_0\) with \(\boldsymbol{\delta}\ge \boldsymbol{1}\). Assume that \(P_1\) can be enumerated as \(\boldsymbol{p}_1,\dots, \boldsymbol{p}_n\), \(V = (V_1)u_1\dots u_{k-1}(V_k)\) and \(q\) belongs to \(V_\iota\). We claim that \(\iota>1\). Otherwise, there would be a simple path from \(q\) to \(p\). Note that \(\boldsymbol{b} + \{\boldsymbol{\delta}\}^* \subseteq \mathop{\operatorname{\mathrm{Reach}}}\nolimits_{q}({V},{s})\). We have \(s\xrightarrow{*} q(\boldsymbol{z})\), where \(\boldsymbol{z}:=\boldsymbol{b} + (|\sigma| \cdot \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V) + 1) \cdot \boldsymbol{\delta} \ge \mathop{\operatorname{\mathrm{\mathrm{\small drop}}}}\nolimits(\sigma)\). Hence, \(s \xrightarrow{*} q(\boldsymbol{z}) \xrightarrow{\sigma}p(\boldsymbol{z} + \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\sigma))\) and \(\boldsymbol{z} + \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\sigma) \ge \boldsymbol{\delta}\ge \boldsymbol{1}\). This implies that \(s\) is diagonal, which is a contradiction. Now construct a VASS \(V_{S}\) from \((V_\iota)u_{\iota}\dots u_{k-1}(V_k)\) by adding a transition set \(T_S\), where \[T_S := \{(q,\boldsymbol{a},q)\mid \boldsymbol{a} \in P_1 \cup P_0\}.\] Notice that \(V_S\) has at most \(k - 1\) components, and \(q(\boldsymbol{b}) \xrightarrow{*} q(\boldsymbol{y}) \xrightarrow{*} t\) in \(V_S\). The size bound can be derived as follows. \[\label{eq:2-exp-lcr-for-par-pump-3-vass-2} \begin{align} \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V_S, q(\boldsymbol{b}),t) &\le M + 3\cdot\left\Vert{\boldsymbol{b}}\right\Vert + 3 \cdot(|T| + |T_S|) \cdot (\left\Vert{T}\right\Vert + \left\Vert{T_S}\right\Vert + 1)\\ &\le M + 3\cdot M^{mk^2} + 3 \cdot(M + (M^{mk^2} + 1)^3) \cdot(M+M^{mk^2} + 1)\\ &\le M + 3\cdot M^{mk^2} + 81 \cdot M^{4mk^2}\\ &\le 85\cdot M^{4mk^2}. \end{align}\tag{7}\] Moreover, \((V_S, q(\boldsymbol{b}),t)\) is diagonal as \((V,s,t)\) is backward diagonal and \(q(\boldsymbol{b}) \xrightarrow{*} q(\boldsymbol{b} + \boldsymbol{\delta})\). Let \(\ell := \min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V_S, q(\boldsymbol{b}), t)\). We now invoke a result about the diagonal \(3\)-VASS. By [prop:diagonal-case-lenbound], \[\ell \le L_k(85\cdot M^{4mk^2}) \le M^{(4mk^2+7)\cdot 2^{f(k)}} = L_k(M)^{11mk^2}.\]
The following claim implies that the construction from \((V,s,t)\) to the diagonal VASS \((V',s',t') := (V_S, q(\boldsymbol{b}), t)\) is doubly-exponentially self-reducible.
claimClaimSemiDiagSecond The diagonal \((V',s',t')\) has at most \(k-1\) components, \(s'\xrightarrow{*}t'\) in \(V'\), \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V',s',t') \le R(L_k(M))\), and \(\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t) \le R(\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V',s',t')+M)\).
We have \(K < \left\Vert{\boldsymbol{c}}\right\Vert \cdot \ell \le g(M)^{k^2}\cdot L_k(M)^{11mk^2} \le L_k(M)^{12mk^2}\). Since \(\boldsymbol{y} \in S\), we can write it as \(\boldsymbol{y} = \boldsymbol{w} + \boldsymbol{q}\), where \(\boldsymbol{q} \in P_0^*\) and \(\boldsymbol{w} = \boldsymbol{b} + \sum_{i=1}^n \boldsymbol{\lambda}(i)\cdot \boldsymbol{p}_i\) for some \(\boldsymbol{\lambda} \in \mathbb{N}^n\) satisfying \(\langle {\boldsymbol{c}, \boldsymbol{\lambda}} \rangle \le K\). We may assume that \(\boldsymbol{c} \ge \boldsymbol{1}\), since each \(\boldsymbol{p}_i\) correspond to \(\boldsymbol{c}(i) = 0\) can be removed and inserted into \(P_0\). Then \[\left\Vert{\boldsymbol{w}}\right\Vert \le \left\Vert{\boldsymbol{b}}\right\Vert + \langle {\boldsymbol{1}, \boldsymbol{\lambda}} \rangle\cdot \left\Vert{P}\right\Vert \le 2g(M)^{k^2} \cdot \langle {\boldsymbol{c}, \boldsymbol{\lambda}} \rangle \le 2M^{mk^2} \cdot K \le L_k(M)^{14mk^2}.\] We define a diagonal \((k{-}1)\)-component VASS \((V',s',t')\) from \((V_\iota)u_{\iota}\dots u_{k-1}(V_k)\) by setting \(s' := q(\boldsymbol{w})\text{ and }t' := t\text{ and }T':=T\cup T_{\boldsymbol{w}}\), where \(T_{\boldsymbol{w}} := \{(q,\boldsymbol{a},q)\mid \boldsymbol{a} \in P_0\}\). By the following claim, \((V',s',t')\) satisfies all the required properties.
claimClaimSemiDiagThrid The diagonal \((k{-}1)\)-component \((V',s',t')\) renders true that \(s'\xrightarrow{*}t'\) in \(V'\), \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V',s',t') \le R(L_k(M))\) and \(\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t) \le R(\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V',s',t')+M)\).
We conclude that \(\rm{Semi\text{-}diag}\mathbb{VASS}^3\) is \((L_k)_{k \in \mathbb{N}}\)-controlled self-reducible. By [lem:2-exp-preserve-via-reduction], it admits \((G_k)_{k \in \mathbb{N}}\)-short runs, where \(G_k(x) = x^{2^{\mathcal{O}({f(k)})k}}\). By the same token, we can show that \(\rm{Pump}\mathbb{VASS}^3\) is doubly-exponentially self-reducible and admits doubly-exponentially short runs. ◻
In this section, we establish the short run property for the sequential VASS.
We have established a similar bound for the pumpable VASS in [prop:len-par-pump-3-vass]. Similarly, the reduction from sequential VASS to pumpable VASS is indirect. We need to deal with semi-pumpability. The proof strategy of [prop:3-VASS-lenbound-intro] closely follows the one in 6.3. By [lem:2-exp-preserve-via-reduction], it suffices to establish the following length-bounded reductions.
(i) \(\rm{Semi\text{-}pump}\mathbb{VASS}^3\) is doubly-exponentially self-reducible, and admits doubly-exponentially short runs. (ii) \(\mathrm{Seq}\mathbb{VASS}^3\) is doubly-exponentially self-reducible, and admits doubly-exponentially short runs.
Proof of [prop:3-VASS-lenbound-intro]. Let \((V, s, t)\) be a \(k\)-component 3-VASS with \(s \xrightarrow{*} t\) in \(V\). By [prop:2-exp-lcr-for-gen-3-vass] and [lem:2-exp-preserve-via-reduction], it holds that \(\min \mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t) \le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V, s, t)^{2^{\mathop{\operatorname{\mathrm{poly}}}\nolimits({k})}}\). ◻
Now we proceed to prove [prop:2-exp-lcr-for-gen-3-vass]. We first outline the proof idea. Consider \((V,s,t)\in\mathrm{Seq}\mathbb{VASS}^3\). The most challenging situation we need to handle is when \((V,s,t)\) is neither forward pumpable nor backward pumpable. In this case, we can apply an important technique called Rackoff’s extraction [6] to extract at least one bounded coordinate within the first SCC. Recall that \(\mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi, B)\) denotes the set of coordinates whose values do not exceed \(B - 1\) along \(\pi\), where \(\pi\) is a run and \(B \in \mathbb{N}\) is a constant. This technique is formally stated as follows.
Lemma 6 ([6]). There exists a polynomial \(R\) such that, for every 3-VASS \(V\) and number \(U \in \mathbb{N}\), and for any run \(\pi\) in \(V\) with \(\mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi, B)=\emptyset\), where \(B=R(U,\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V))\), there is a run \(\rho\) starting from the same source as \(\pi\) with \(|\rho| \le B\) and ending at \(q(\boldsymbol{x})\) satisfying \(\boldsymbol{x} \ge U \cdot \boldsymbol{1}\).
An immediate consequence of 6 is the following.
corollarycorDiagPumpOfUnbounded Let \((V,s)\) be a strongly connected 3-VASS. If there exists a run \(\pi\) starting from \(s\) with \(\mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi, U) = \emptyset\) for some \(U := {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s)})}\), then \(s\) is diagonal in \(V\).
If \(\mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi, U) \not= \emptyset\), the approximation technique for bounded runs developed in [lem:one-turn-approx] can be used to characterize the reachability set of the first SCC by a hybrid set. The remainder of the proof follows closely the argument in the proof of [prop:2-exp-lcr-for-par-pump-3-vass].
Proof of [prop:2-exp-lcr-for-gen-3-vass]. Define a family of functions \((L_k)_{k \in \mathbb{N}}\) by letting \(L_k(x) := x^{2^{f(k)}}\) for each \(k \in \mathbb{N}\), where \(f\) is the polynomial given in [prop:len-par-pump-3-vass]. We show that \(\rm{Semi\text{-}pump}\mathbb{VASS}^3\) is \((L_k)_{k \in \mathbb{N}}\)-controlled self-reducible. Let \(g\) be the maximum of the two polynomials appearing in [lem:one-turn-approx]. Assume that \(g(x) \le x^m\) holds for some \(m \ge 1\) and all \(x >1\). Let \(R(x) := x^{30\cdot m^2}\).
Suppose \((V,s,t)\in \rm{Semi\text{-}pump}\mathbb{VASS}^3\), where \(V=(V_1)u_1\dots u_{k-1}(V_k)\) and \(t = q(\boldsymbol{y})\). Let \(M:=\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,t)\). Suppose \(s\) is not pumpable in \(V\), and \[s \xrightarrow{\pi_1} q_1(\boldsymbol{y}_1) \xrightarrow{u_1} p_2(\boldsymbol{x}_2) \xrightarrow{\pi'} t,\] where \(\pi'\) is a run in \((V_2)u_2\dots u_{k-1}(V_k)\). By [cor:diag-pump-of-unbounded], the index set of bounded coordinates along \(\pi_1\) is non-empty, i.e., \(\mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi_1, B) \neq \emptyset\), where \(B = {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s)})}\). We may as well assume that \(B \le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s)^m \le M^m\) for the \(m\) introduced in the above. Thus \(I:=\mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi_1u_1, B') \supseteq \mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi_1, B) \neq \emptyset\), where \(B' := B+M\). By applying [lem:one-turn-approx] to \((V,s,p_2(\boldsymbol{x}_2))\) and \(I\), one can obtain a hybrid set \(S = \boldsymbol{b} + {P_1}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}+P_0^*\) rendering true \(\boldsymbol{x}_2 \in S \subseteq \mathop{\operatorname{\mathrm{Reach}}}\nolimits_{p_2}({V},{s})\) and the following inequalities. \[\label{eq:2-exp-lcr-for-gen-3-vass-1} \begin{align} \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S) &\le g(B'+M) \le M^{3m^2},\\ \min \mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V, s, p_2(\boldsymbol{z})) &\le g(B'+\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,p_2(\boldsymbol{z}))) \le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,p_2(\boldsymbol{z}))^{3m^2}\;\text{for all}\;\boldsymbol{z} \in S. \end{align}\tag{8}\] We may assume that \(\boldsymbol{c}\ge \boldsymbol{1}\) if \(P_1 \neq \emptyset\). We now construct a \((k-1)\)-component VASS \((V_{S}, s_S,t)\) by removing the first SCC and turning the periods in \(P_1\cup P_0\) into self-loops at the first state \(p_2\) of \((V_2)u_2\dots u_{k-1}(V_k)\). Let \(T_{tail}\) be the transition set of \((V_2)u_2\dots u_{k-1}(V_k)\) and \(Q_{tail}\) be the state set of \((V_2)u_2\dots u_{k-1}(V_k)\). The new 3-VASS instance \((V_{S}, s_S,t)=((Q_S,T_S),s_S,t)\) is given by \[s_S := p_2(\boldsymbol{b}) \text{ and } Q_S=Q_{tail} \text{ and } T_S := T_{tail}\cup \{(p_2,\boldsymbol{a},p_2)\mid \boldsymbol{a} \in P_1 \cup P_0\}.\] Observe that \(s_S \xrightarrow{*}p_2(\boldsymbol{x}_2) \xrightarrow{\pi'} t\) in \(V_S\) and \[\label{eq:2-exp-lcr-for-gen-3-vass-2} \begin{align} \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V_S, s_S, t) &\le M + 3 \cdot \left\Vert{\boldsymbol{b}}\right\Vert + 3\cdot (M + |T_S|) \cdot (M + \left\Vert{T_S}\right\Vert + 1)\\ &\le M + 3\cdot M^{3m^2} + 3 \cdot (M + (M^{3m^2} + 1)^3) \cdot (M + M^{3m^2} + 1)\\ &\le 85\cdot M^{12m^2}. \end{align}\tag{9}\] Suppose \(P_1=\{\boldsymbol{p}_1,\cdots,\boldsymbol{p}_n\}\), where the order of \(\boldsymbol{p}_1,\cdots,\boldsymbol{p}_n\) is consistent with the order of \(\boldsymbol{c}(1),\ldots,\boldsymbol{c}(n)\). Let \(\ell := \min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V_S,s_S,t)\). There are two cases depending on whether \(\left\Vert{\boldsymbol{c}}\right\Vert\cdot \ell\le K\).
We let \((V',s',t'):=(V_S,s_S,t)\). It suffices to establish the following claim.
claimClaimSemiParFirst The \((k{-}1)\)-component 3-VASS \((V',s',t') \in \rm{Semi\text{-}pump}\mathbb{VASS}^3\) and renders true the inequlities: \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V',s',t') \le R(L_k(M))\) and \(\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t) \le R(\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V',s',t')+M)\).
In this case, \(P_1 \ne \emptyset\). By construction, \((V_S,s_S,t)\) is forward pumpable since \(p_2(\boldsymbol{x}_2)\xrightarrow{*}p_2(\boldsymbol{x}_2+\boldsymbol{\delta})\) for some \(\boldsymbol{\delta} \in P_1\) and \(\boldsymbol{\delta}>\boldsymbol{0}\). So \((V_S,s_S,t)\) is pumpable. By [prop:len-par-pump-3-vass], \[\begin{align} \ell &\le L_k(85\cdot M^{12m^2}) \le L_k(M^{19m^2}) = M^{19m^2\cdot 2^{f(k)}} \le L_k(M)^{19m^2}, \text{\;and}\\ K &\le \left\Vert{\boldsymbol{c}}\right\Vert \cdot \ell \le M^{3m^2}\cdot L_k(M)^{19m^2} \le L_k(M)^{22m^2}. \end{align}\] Since \(\boldsymbol{x}_2 \in S\), we can write it as \(\boldsymbol{x}_2 = \boldsymbol{w} + \boldsymbol{q}\), where \(\boldsymbol{q} \in P_0^*\) and \(\boldsymbol{w} = \boldsymbol{b} + \sum_{i=1}^n \boldsymbol{\lambda}(i)\cdot \boldsymbol{p}_i\) for some \(\boldsymbol{\lambda} \in \mathbb{N}^n\) satisfying \(\langle {\boldsymbol{c}, \boldsymbol{\lambda}} \rangle \le K\). Hence, \[\left\Vert{\boldsymbol{w}}\right\Vert \le \left\Vert{\boldsymbol{b}}\right\Vert + \langle {\boldsymbol{1}, \boldsymbol{\lambda}} \rangle\cdot \left\Vert{P_1}\right\Vert \le 2M^{3m^2} \cdot \langle {\boldsymbol{c}, \boldsymbol{\lambda}} \rangle \le 2M^{3m^2} \cdot K \le 2L_k(M)^{25m^2}.\] We construct a VASS \(V'\) from \((V_2)u_2\dots u_{k-1}(V_k)\) by adding some self-loops to represent \(P_0\): \[T' := T_{tail}\cup\{(p_2,\boldsymbol{a},p_2)\mid \boldsymbol{a} \in P_0\}.\] Let \(s' := p_2(\boldsymbol{w})\) and \(t' := t\). We can prove the following claim for \((V',s',t')\).
claimClaimSemiParSecond The \((k{-}1)\)-component 3-VASS \((V',s',t')\in\rm{Semi\text{-}pump}\mathbb{VASS}^3\) and renders true the inequlities: \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V',s',t') \le R( L_k(M))\) and \(\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t) \le R(\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V',s',t')+M)\).
We conclude from [claim:semi-par-1], [claim:semi-par-2] and [lem:2-exp-preserve-via-reduction] that \(\rm{Semi\text{-}pump}\mathbb{VASS}^3\) is \((L_k)_{k \in \mathbb{N}}\)-controlled self-reducible and admits doubly-exponentially short runs. Similarly, \(\mathrm{Seq}\mathbb{VASS}^3\) is doubly-exponentially self-reducible and admits doubly-exponentially short runs. ◻
There are some obvious open problems for future studies. We mention three of them.
It has been proved that the reachability problem of the diagonal and wide \(3\)-VASS is in \({\normalfont\textsf{PSPACE}}\), matching the lower bound for the \(2\)-VASS reachability problem. Since every \(2\)-VASS can be seen as a pumpable \(3\)-VASS, \(\rm{Pump}\mathbb{VASS}^3\) is \({\normalfont\textsf{PSPACE}}\)-hard. Therefore, it would be interesting to see if \(\rm{Pump}\mathbb{VASS}^3\) is \({\normalfont\textsf{PSPACE}}\)-complete. More generally, we may ask whether \(\mathrm{Pump}\mathbb{VASS}^d\), where \(d\ge3\), is strictly simpler than \(\mathbb{VASS}^d\) in complexity-theoretical terms? A positive answer would be significant to our understanding of the VASS reachability problem.
Determining the exact complexity of \(\mathbb{VASS}^3\) is the most natural thing to do next. The current lower bound is \({\normalfont\textsf{PSPACE}}\), while this paper shows that \({\normalfont\textsf{EXPSPACE}}\) is an upper bound. The precise picture is yet to be unveiled. We tend to think that the reduction from a general \(3\)-VASS to a pumpable \(3\)-VASS cannot be done in polynomial space, which might suggest that \(\mathbb{VASS}^3\) is \({\normalfont\textsf{EXPSPACE}}\)-hard. However, as pointed out in [19], we still do not know whether there exists a \(3\)-VASS that admits doubly exponential shortest runs. In the absence of such an example, it appears unlikely that we can come up with an \({\normalfont\textsf{EXPSPACE}}\)-hardness proof.
So far, all known upper bounds for \(\mathbb{VASS}^d\) in dimension \(d\geq 4\) are obtained within the KLM framework, where the bound cannot be smaller than the size of the finite reachable set. Consequently, the best known upper bound for \(\mathbb{VASS}^4\) remains far from elementary. On the other hand, \(\mathsf{TOWER}\)-hardness is currently known only for \(\mathbb{VASS}^8\). This leaves a substantial gap in our understanding of the complexity of \(\mathbb{VASS}^4\). The work of [19], and this work as well, looks for an upper bound for shortest runs. It ought to be fruitful to take a look at the \(\mathbb{VASS}^4\) from this new perspective.
Proof. It suffices to consider the sequential 3-VASS. For each \(k \ge 1\) and every \(k\)-component 3-VASS \((V,s,t)\), if \(s\xrightarrow{*}t\) in \(V\), by [prop:3-VASS-lenbound-intro], there exists a short path \(s\xrightarrow{\pi} t\) in \(V\) with \(|\pi| \le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,t)^{2^{{\mathop{\operatorname{\mathrm{poly}}}\nolimits({k})}}}\). The reachability \(s\xrightarrow{*}t\) is decided by inspecting all runs of length at most \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,t)^{2^{{\mathop{\operatorname{\mathrm{poly}}}\nolimits({k})}}}\). Now \[\log|\pi| = 2^{{\mathop{\operatorname{\mathrm{poly}}}\nolimits({k})}} \cdot \log\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,t) \leq 2^{{\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits_{\mathrm{\small bin}}(V,s,t)})}} \leq 2^{{\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,t)})}}\] where \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits_{\mathrm{\small bin}}(V,s,t)\) denotes the input size under binary encoding. That is, \[\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits_{\mathrm{\small bin}}(V,s,t) = |Q| + d \cdot |T| \cdot \log (\left\Vert{T}\right\Vert + 1) + d \cdot \log (\left\Vert{s}\right\Vert + 1) + d\cdot \log (\left\Vert{t}\right\Vert + 1).\] The nondeterministic traversal algorithm can be carried out in exponential space under both binary and unary encoding schemes. Hence, \(\mathbb{VASS}^3\) is in EXPSPACE. ◻
Proof. Suppose that \(V=(Q,T)\) and \(s \xrightarrow{\rho}t\) in \(V\). We can assume that \(\rho\) contains no zero transitions. Since each transition increases at least one coordinate by at least \(1\), it is immediate that \(|\rho| \le d\cdot \left\Vert{t}\right\Vert\). ◻
Proof. Let \(L_k(x) = x^{2^{f(k)}}\). By definition of length-controlled self-reduction, there exists a polynomial \(f(x)\) satisfying the required conditions. We choose a sufficiently large \(c \ge 2\) such that \(f(x) \le x^c\) for every \(x > 1\). Then \(R(x) \le x^{ck^2}\) for each \(x > 1\). Define \[g(k) := \left(c^3\cdot (k+1)^4\cdot 2^{f(k)}\right)^{k} \le \left(c\cdot 2^{f(k)}\right)^{5k} \le 2^{\mathcal{O}(f(k))\cdot k}\] and \(G_k(x):= x^{g(k)}\) for each \(k \in \mathbb{N}\). Note that \(G_0(x)=x\). Let \((V,s,t) \in \mathcal{V}\) be a \(k\)-component VASS with \(s \xrightarrow{*} t\) for some \(\pi\) with \(M := \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V, s, t) > 1\). We prove by induction on \(k \ge 0\). In the base case, we have \(k = 0\). By [obs:0-com-vass-len], we immediately obtain that \[\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t) \le d\cdot \left\Vert{t}\right\Vert \le M \le G_0(M).\] Then we consider the case where \(k \ge 1\). By definition, there exists a sequential VASS \((V',s',t')\) such that \(s'\xrightarrow{*}t'\) in \(V'\), \(\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t) \le R(\ell + M) \le (\ell + M)^{ck^2}\), and \[\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V',s',t')\le R(L_k(M)) \le M^{ck^2 \cdot 2^{f(k)}},\] where \(\ell := \min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V',s',t')\). Since \((V',s',t') \in \mathcal{V}\) has at most \(k-1\) components, then by the induction hypothesis, we have \(\ell \le M^{ck^2 \cdot 2^{f(k)} \cdot g(k-1)}\), \(g(k-1)=\left(c^3\cdot k^4 \cdot 2^{f(k-1)}\right)^{k-1}\), and \[\min \mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t) \le \left(M^{ck^2\cdot 2^{f(k)} \cdot g(k-1)} + M\right) ^ {ck^2} \le M^{c^3\cdot (k+1)^4 \cdot 2^{f(k)}\cdot g(k-1)}\le M^{g(k)}.\] We conclude that \(\mathcal{V}\) admits \((G_k)_{k \in \mathbb{N}}\)-short runs. ◻
We first recall the relevant notions and results of [19] in 11.1. We then generalize the results from the case of a singleton source to that of a hybrid set in 11.2. Finally, in 11.3, we provide the proofs of [thm:hybrid-2vass-hybrid], establishing the corresponding results for geometrically 2-dimensional 3-VASS with source hybrid sets.
A (2-dimensional) simple linear path scheme (SLPS) is a regular expression of the form \[\Lambda = \alpha_0 \beta_1^* \alpha_1\cdots \beta_k^* \alpha_k \label{eq:slps}\tag{10}\] where each \(\alpha_i \in (\mathbb{Z}^2)^*\) is a sequence of vectors called a bridge, and each \(\beta_i \in \mathbb{Z}^2\) is called a loop. Naturally, an SLPS \(\Lambda\) of the form in 10 defines a 2-VASS \(V_\Lambda\) with states \(q_0, \ldots, q_{k+1}\) such that there are paths from \(q_i\) to \(q_{i+1}\) whose transitions have effects specified by \(\alpha_i\) for \(i = 0, \ldots, k\), and there are self-loops \(q_i\xrightarrow{\beta_i}q_i\) for \(i = 1, \ldots, k\). For a bridge \(\alpha_i = \boldsymbol{a}_1\ldots\boldsymbol{a}_m\), its effect is \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\alpha_i) = \sum_{j\in[m]}\boldsymbol{a}_j\). We write \(\mathop{\operatorname{\mathrm{\mathrm{\small drop}}}}\nolimits(\alpha_i) \in \mathbb{N}^2\) for the drop of the corresponding path in \(V_\Lambda\). ence, \(\mathop{\operatorname{\mathrm{\mathrm{\small drop}}}}\nolimits(\alpha_i)(c) = -\min\{0, \min_{j\in[m]}\{\boldsymbol{a}_1(c) + \cdots + \boldsymbol{a}_j(c)\}\}\) for every \(c\in[d]\). For two vectors \(\boldsymbol{x}, \boldsymbol{y} \in \mathbb{N}^2\), we write \(\boldsymbol{x} \xrightarrow{\Lambda} \boldsymbol{y}\) if \(q_0(\boldsymbol{x}) \xrightarrow{*} q_{k+1}(\boldsymbol{y})\) holds in \(V_\Lambda\). We also define \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda) := \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V_\Lambda)\) and similarly \(\mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(\Lambda) = \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V_{\Lambda}) = \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits\{\beta_1, \ldots, \beta_k\}\). The norm of \(\Lambda\) is defined to be the maximum norm of bridges and loops: \(\left\Vert{\Lambda}\right\Vert = \max\{\left\Vert{\alpha_0}\right\Vert, \left\Vert{\beta_1}\right\Vert, \ldots, \left\Vert{\beta_k}\right\Vert, \left\Vert{\alpha_k}\right\Vert\}\).
Lemma 7 ([14]). For every 2-VASS \(V\) and two states \(p, q\), there is a finite set \(\mathcal{S}\) of SLPSs such that \(p(\boldsymbol{x}) \xrightarrow{*} q(\boldsymbol{y})\) in \(V\) if and only if \(\boldsymbol{x} \xrightarrow[]{\Lambda} \boldsymbol{y}\) for some \(\Lambda \in \mathcal{S}\). Moreover, for every \(\Lambda \in \mathcal{S}\) we have \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda) \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}\).
Simple linear path schemes admit further normalizations. We first introduce three special forms:
an SLPS consisting of at most three loops is called a short SLPS;
an SLPS of the form \(\alpha_0 \beta_1^* \alpha_1 \beta_2^*\) such that \(\beta_1 \in \mathbb{N}_{>0} \times \mathbb{N}_{<0}\) and \(\beta_2 \in \mathbb{N}_{<0} \times \mathbb{N}_{>0}\) is called a one-turn SLPS;
a concatenation of one-turn SLPSs is called a zigzagging SLPS.
Consider a run in a one-turn SLPS \(\Lambda = \alpha_0 \beta_1^* \alpha_1 \beta_2^*\) given by \[\pi: \boldsymbol{x} \xrightarrow{\alpha_0} \boldsymbol{x}_1 \xrightarrow{\beta_1^{n_1}} \boldsymbol{y}_1 \xrightarrow[]{\alpha_1} \boldsymbol{x}_2 \xrightarrow[]{\beta_2^{n_2}} \boldsymbol{y}.\] We say that \(\pi\) is \(B\)-vertical-returning or simply \(B\)-returning, if \(\boldsymbol{x}, \boldsymbol{y} \in [0, B] \times \mathbb{N}\). Likewise, a run \(\rho\) in a zigzagging SLPS is \(B\)-returning if \(\rho\) is a sequence of \(B\)-returning one-turns. We write \(\boldsymbol{x} {\mathop{\;\raisebox{-0.17em}{\searrow}\kern-0.88em\raisebox{0.17em}{\nwarrow}}}_{B}^{\Lambda}\; \boldsymbol{y}\) to indicate that there exists a \(B\)-returning run in \(\Lambda\) from \(\boldsymbol{x}\) to \(\boldsymbol{y}\). Moreover, for an SLPS \(\Lambda = \alpha_0 \beta_1^* \alpha_1\cdots \beta_k^* \alpha_k\), we say that an SLPS \(\Lambda'\) is a detailing of \(\Lambda\) if \(\Lambda'\) is obtained from \(\Lambda\) by replacing some \(\beta_i^*\) by \(\beta_i^{n_i}\) for some \(n_i \in \mathbb{N}\). Clearly the reachability relation of \(\Lambda'\) is contained in that of \(\Lambda\).
Theorem 3 ([19]). Let \(\Lambda\) be a 2-dimensional SLPS. There exists \(B \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda)})}\) such that for every run \(\boldsymbol{x} \xrightarrow[]{\Lambda} \boldsymbol{y}\) there exists a detailing \(\Lambda' = \Lambda_1 \Lambda_2 \Lambda_3\) of \(\Lambda\) with \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda') \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda)})}\), such that \(\Lambda_1\) and \(\Lambda_3\) are short, and
either \(\Lambda_2\) is empty, and \(\boldsymbol{x} \xrightarrow{\Lambda_1 \Lambda_3} \boldsymbol{y}\);
or \(\Lambda_2\) is zigzagging, and \(\boldsymbol{x} \xrightarrow{\Lambda_1} \boldsymbol{u} {\mathop{\;\raisebox{-0.17em}{\searrow}\kern-0.88em\raisebox{0.17em}{\nwarrow}}}_B^{\Lambda_2} \boldsymbol{v} \xrightarrow{\Lambda_3} \boldsymbol{y}\) for some \(\boldsymbol{u}, \boldsymbol{v} \in [0, B]\times \mathbb{N}\).
Notice that for each SLPS \(\Lambda\) there are only finitely many detailings \(\Lambda_1 \Lambda_2 \Lambda_3\) satisfying the size bound in 3. Hence, in the remainder of this section, we focus on the representation of reachability sets of such normalized SLPSs.
For convenience, we denote by \(\mathop{\operatorname{\mathrm{Reach}}}\nolimits({\Lambda},{\boldsymbol{x}})\) the set of vectors \(\boldsymbol{y}\in \mathbb{N}^2\) such that \(\boldsymbol{x} \xrightarrow{\Lambda} \boldsymbol{y}\). Moreover, we sometimes investigate the reachability set \(\mathop{\operatorname{\mathrm{Reach}}}\nolimits({\Lambda},{X})\) for some set \(X\subseteq \mathbb{N}^2\), i.e., \(\mathop{\operatorname{\mathrm{Reach}}}\nolimits({\Lambda},{X}) := \bigcup_{\boldsymbol{x}\in X} \mathop{\operatorname{\mathrm{Reach}}}\nolimits({\Lambda},{\boldsymbol{x}})\). Several useful tools for representing reachability sets in a 2-SLPS have been established in [19]; we recall them below. We define the \((a, p, K)\)-arithmetic set, where \(a, p \in \mathbb{N}\) and \(K \in \mathbb{N}_\infty\), to be the set \(a + p^{\le K} := \{a + n \cdot p \mid n \le K\}\).
Lemma 8 ([19]). For all short SLPS \(\Lambda\), configuration \(\boldsymbol{s}\) and \(x \in [0, B]\), the set \(\{\boldsymbol{t}(2) \mid \boldsymbol{s} \xrightarrow{\Lambda} \boldsymbol{t}, \boldsymbol{t}(1) = x\}\) is a finite union of \((a, p, K)\)-arithmetic sets where \(a \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({B, M})}, p \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({M})}\) and \(M = \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda, \boldsymbol{s})\).
Lemma 9 ([19]). Let \(\Lambda\) be a one-turn SLPS, \(S = a + p^{\le K}\) be an arithmetic set, and \(x, x' \in [0,B]\). The set \[\left\{ y' \mid (x, y) {\mathop{\;\raisebox{-0.17em}{\searrow}\kern-0.88em\raisebox{0.17em}{\nwarrow}}}_B^\Lambda (x', y')\text{ and } y \in S \right\}\] is a finite union of \((a', p', K')\)-arithmetic sets with \(a' \le a + {\mathop{\operatorname{\mathrm{poly}}}\nolimits({B, M, p})}\), \(p' \le \max\{p, {\mathop{\operatorname{\mathrm{poly}}}\nolimits({M})}\}\) and \(M = \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda)\).
Lemma 10 ([19]). Let \(\Lambda\) be a short SLPS. The set \(\mathop{\operatorname{\mathrm{Reach}}}\nolimits({\Lambda},{\boldsymbol{s} + \{\boldsymbol{p}\}^{\le K}})\) is a finite union of hybrid sets \(S = \boldsymbol{b} + {P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K'}}\) such that \(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S)\) is bounded by \({\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda), \left\Vert{\boldsymbol{s}}\right\Vert, \left\Vert{\boldsymbol{p}}\right\Vert})}\).
We intend to generalize 1 from singleton sources to hybrid set sources. It is not difficult to see that the key is to generalize 8. This is the next lemma.
Lemma 11. Let \(S:=\boldsymbol{b} + {P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\). For every short SLPS \(\Lambda\) and \(x \in [0, B]\), the set \(\{\boldsymbol{t}(2) \mid \boldsymbol{s} \xrightarrow{\Lambda} \boldsymbol{t}, \boldsymbol{s} \in S, \boldsymbol{t}(1) = x\}\) is a finite union of \((a, p, K')\)-arithmetic sets such that \[a, p \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S), B})}.\]
To prove 11, we prove a stronger lemma that handles the case where the source is a hybrid set and the target is any linear set.
Lemma 12. Let \(\Lambda = \alpha_0\beta_1^*\alpha_1 \ldots \beta_k^*\alpha_k\). Let \(S = \boldsymbol{b} + {P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\) be a hybrid set, and let \(T = \boldsymbol{d} + Q^*\) be a linear set. Then \(\mathop{\operatorname{\mathrm{Reach}}}\nolimits({\Lambda},{S}) \cap T\) is a finite union of hybrid sets \(S' = \boldsymbol{b}' + {P'}^{\langle {{\boldsymbol{c'}}, \cdot} \rangle \le {K'}}\) where \(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S') \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(T)})}^k\).
Proof. It is well known that every run in \(\Lambda\) starting from a vector in \(S\) is captured by a system of linear inequalities [26]. We introduce variables \(n_1, \ldots, n_k \in \mathbb{N}\) for the number of repetitions of each loop, and \(\boldsymbol{a}_i, \boldsymbol{b}_i\) where \(i = 0, 1, \ldots, k\) for the intermediate configurations before and after the bridge \(\alpha_i\). Also, we introduce a variable \(\boldsymbol{\ell} \in \mathbb{N}^{|P|}\) to determine the source, and a variable \(\boldsymbol{r} \in \mathbb{N}^{|Q|}\) to determine the target in \(T\). The constraints are as follows, where \(P\) and \(Q\) are the matrices whose columns are vectors in \(P\) and \(Q\) respectively: \[\begin{align} \begin{cases} \boldsymbol{b} + P \cdot \boldsymbol{\ell} & = \boldsymbol{a}_0 \\ \boldsymbol{d} + Q \cdot \boldsymbol{r} &= \boldsymbol{b}_k \\ \boldsymbol{a}_i & \ge \mathop{\operatorname{\mathrm{\mathrm{\small drop}}}}\nolimits(\alpha_i) \qquad i = 0, 1, 2, \ldots, k\\ \boldsymbol{a}_i + \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\alpha_i) & = \boldsymbol{b}_i \qquad i = 0, 1, 2, \ldots, k\\ \boldsymbol{b}_{i-1} + \beta_i \cdot n_i & = \boldsymbol{a}_{i} \qquad i = 1, 2, \ldots, k \end{cases} \end{align}\] Observe that the non-negative solutions of this system are in one-to-one correspondence with runs from \(\boldsymbol{a}_0 = \boldsymbol{b} + P \boldsymbol{\ell}\) to \(\boldsymbol{b}_k = \boldsymbol{d} + Q\boldsymbol{r}\): the variables \(\boldsymbol{a}_i\) and \(\boldsymbol{b}_i\) record the configurations immediately before and after the bridge \(\alpha_i\), respectively. Let \(\mathcal{E}\) be the above system, and \(\mathcal{E}_0\) be its homogeneous version. For a solution \(\boldsymbol{h}\) of \(\mathcal{E}\), we write for example \(\boldsymbol{\ell}^{\boldsymbol{h}}\) for the value assigned to \(\boldsymbol{\ell}\) by \(\boldsymbol{h}\). In the following, we also refer to the variable \(\boldsymbol{b}_k\) by the name \(\boldsymbol{t}\) as it is the target of the whole run. Now we have \[\{\boldsymbol{t}^{\boldsymbol{h}} \mid \boldsymbol{h} \text{ is a solution to } \mathcal{E}\} = \mathop{\operatorname{\mathrm{Reach}}}\nolimits({\Lambda},{\boldsymbol{b} + P^*}) \cap T.\] The number of constraints of \(\mathcal{E}\) is \(m = 4 + (3k + 2) \times 2 = \mathcal{O}(k)\), and the number of variables is \(n = |P| + |Q| + k + 2 \times (k+1) \times 2 = |P| + |Q| + \mathcal{O}(k)\). Notice that \(|P| \le (\left\Vert{P}\right\Vert + 1)^2\) and \(|Q| \le (\left\Vert{P}\right\Vert + 1)^2\), so we have \(n \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\left\Vert{P}\right\Vert, \left\Vert{Q}\right\Vert, \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda)})}\). Also, the norm of coefficients of \(\mathcal{E}\) is bounded by \(A := \left\Vert{\Lambda}\right\Vert + \left\Vert{P}\right\Vert + \left\Vert{Q}\right\Vert\) and the norm of constant terms of \(\mathcal{E}\) is bounded by \(C := \left\Vert{\boldsymbol{b}}\right\Vert + \left\Vert{\boldsymbol{d}}\right\Vert + \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda)\). Towards applying 1, define \[\begin{align} M & := ((m + n + 1) A + C + 1)^m = {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(T)})}^k;\\ M_0 & := ((m + n) A + 1)^m \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits{\Lambda}, \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(T)})}^k. \end{align}\] Denote by \(X\) the solutions to \(\mathcal{E}\) and by \(X_0\) the solutions to \(\mathcal{E}_0\). Also let \(\overline{X} = \{\boldsymbol{h} \in X \mid \left\Vert{\boldsymbol{h}}\right\Vert \le M\}\) and \(\overline{X}_0 = \{\boldsymbol{h}_0 \in X_0 \mid \left\Vert{\boldsymbol{h}_0}\right\Vert \le M_0\}\). We have \(X = \overline{X} + (\overline{X}_0)^*\) by 1.
Next, let \[\begin{align} \overline{Y} := \{ \boldsymbol{h} \in \overline{X} \mid \langle {\boldsymbol{c}, \boldsymbol{\ell}^{\boldsymbol{h}}} \rangle \le K \}. \end{align}\] Also, enumerate \(\overline{X}_0\) as \(\{\boldsymbol{g}_1, \ldots, \boldsymbol{g}_h\}\). We define \[\begin{align} P' := \{ \boldsymbol{t}^{\boldsymbol{g}_i} \mid i = 1, \ldots, h \}, \quad \boldsymbol{c}' := (\langle {\boldsymbol{c}, \boldsymbol{\ell}^{\boldsymbol{g}_1}} \rangle, \dots, \langle {\boldsymbol{c}, \boldsymbol{\ell}^{\boldsymbol{g}_h}} \rangle). \end{align}\] It is routine to check that \[\begin{align} \label{eq:reach-const-short} \bigcup_{\boldsymbol{h} \in \overline{Y}} \boldsymbol{t}^{\boldsymbol{h}} + {P'}^{\langle {{\boldsymbol{c}'}, \cdot} \rangle \le {K - \langle {\boldsymbol{c}, \boldsymbol{\ell}^{\boldsymbol{h}}} \rangle}} = \mathop{\operatorname{\mathrm{Reach}}}\nolimits({\Lambda},{S}) \cap T. \end{align}\tag{11}\] We are left to bound the norm of the left-hand side. Notice that \[\begin{align} \left\Vert{\boldsymbol{t}^{\boldsymbol{h}}}\right\Vert &\le \left\Vert{\overline{Y}}\right\Vert \le \left\Vert{\overline{X}}\right\Vert \le M \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(T)})}^k;\\ \left\Vert{P'}\right\Vert & \le \left\Vert{\overline{X_0}}\right\Vert \le M_0 \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(T)})}^k;\\ \left\Vert{\boldsymbol{c}'}\right\Vert &\le \max_{i \in [h]}|\langle {\boldsymbol{c}, \boldsymbol{\ell}^{\boldsymbol{g}_i}} \rangle| \le 3 \left\Vert{\boldsymbol{c}}\right\Vert M_0 \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(T)})}^k. \end{align}\] Hence, we deduce that the norm of each resulting hybrid set in 11 is also bounded by \({\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(T)})}^k\). ◻
Now we come back to the proof of 11.
Proof of 11. Let \(T := (x, 0) + \{(0, 1)\}^*\) be the target set we are considering. Applying 12 to \(\Lambda\) where the number of loops is \(k \le 3\), we represent \(\mathop{\operatorname{\mathrm{Reach}}}\nolimits({\Lambda},{S}) \cap T\) as a finite union of hybrid sets \(S' = \boldsymbol{b}' + {P'}^{\langle {{\boldsymbol{c'}}, \cdot} \rangle \le {K'}}\), where \(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S') \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S), B})}\). Since \(S' \subseteq T\), we must have \(\boldsymbol{b}' = (x, a_0)\) for some \(a_0 \in \mathbb{N}\), and \(P' \subseteq \{(0, 1)\}^*\). Let \(P'' = \{y \mid (0, y) \in P'\}\), the set \[\{\boldsymbol{t}(2) \mid \boldsymbol{s} \xrightarrow{\Lambda} \boldsymbol{t}, \boldsymbol{s} \in \boldsymbol{b} + {P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}} , \boldsymbol{t}(1) = x\}\] is a finite union of hybrid sets \(a_0 + {P''}^{\langle {{\boldsymbol{c'}}, \cdot} \rangle \le {K'}}\). It remains to represent these hybrid sets as a finite union of arithmetic sets.
Let \(a \in \mathbb{N}\), \(P \subseteq \mathbb{N}_{>0}\), \(\boldsymbol{c} \in \mathbb{N}^{|P|}\), and \(K \in \mathbb{N}\). If \(|P| \ge 2\) then the set \(a + {P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\) is a finite union of sets \(a' + {P'}^{\langle {{\boldsymbol{c}'}, \cdot} \rangle \le {K'}}\) where \(a' \le a + \left\Vert{P}\right\Vert^2\), \(P' \subsetneq P\), and \(\left\Vert{\boldsymbol{c}'}\right\Vert \le \left\Vert{\boldsymbol{c}}\right\Vert\).
Proof of Claim. Suppose \(P = \{p_1, \ldots, p_m\}\) with \(m \ge 2\). Then any \(v \in a + {P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\) can be written as \[v = a + n_1 p_1 + n_2 p_2 + \cdots + n_m p_m\] satisfying \(t := n_1 \boldsymbol{c}(1) + n_2 \boldsymbol{c}(2) + \cdots + n_m \boldsymbol{c}(m) \le K\). We claim that there is always such a representation with either \(n_1 < p_2\) or \(n_2 < p_1\). Which bound holds depends on the sign of \(-\boldsymbol{c}(1) p_2 + \boldsymbol{c}(2) p_1\).
Assume \(-\boldsymbol{c}(1) p_2 + \boldsymbol{c}(2) p_1 \le 0\) (the other case is symmetric). We claim that \(n_1 < p_2\) can be achieved. Indeed, if \(n_1 \ge p_2\) then observe that \[v = a + (n_1 - p_2) p_1 + (n_2 + p_1) p_2 + n_3 p_3 + \cdots + n_m p_m\] is another representation of \(v\) with non-negative coefficients. Moreover, \[(n_1 - p_2) \boldsymbol{c}(1) + (n_2 + p_1) \boldsymbol{c}(2) + \cdots + n_m \boldsymbol{c}(m) = t -\boldsymbol{c}(1) p_2 + \boldsymbol{c}(2) p_1 \le t \le K.\] As the choice of \(v\) is arbitrary, it is justified that \[a + {P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}} = \bigcup_{n_1 < p_2} a + n_1 p_1 + {P'}^{\langle {{\boldsymbol{c}'}, \cdot} \rangle \le {K - n_1 \boldsymbol{c}(1)}},\] where \(P' = \{p_2, \ldots, p_m\}\) and \(\boldsymbol{c}' = (\boldsymbol{c}(2), \ldots, \boldsymbol{c}(m))\). Finally, notice that \(a + n_1p_1 \le a + p_2p_1 \le a + \left\Vert{P}\right\Vert^2\). ◻
Let \(a \in \mathbb{N}\), \(P \subseteq \mathbb{N}_{>0}\), \(\boldsymbol{c} \in \mathbb{N}^{|P|}\), and \(K \in \mathbb{N}\). The set \(a + {P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\) is a finite union of \((a', p', K')\)-arithmetic sets with \(a' \le a + |P| \cdot \left\Vert{P}\right\Vert^2\) and \(p' \le \left\Vert{P}\right\Vert\).
Proof of Claim. Apply [clm:one-dim-res-per-set-reduction] inductively to \(a + {P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\), we obtain a finite union of hybrid sets \(S = \boldsymbol{a}' + {\{p'\}}^{\langle {{c'}, \cdot} \rangle \le {K'}}\) with \(a' \le a + |P| \cdot \left\Vert{P}\right\Vert^2\) and \(p' \le \left\Vert{P}\right\Vert\). Notice that \(S\) can be represented as an \((a', p', \lfloor K'/c \rfloor)\)-arithmetic set, where \(K'/c\) is understood as \(\infty\) when \(c = 0\). ◻
Now the one-dimensional hybrid set \(a_0 + {P''}^{\langle {{\boldsymbol{c}'}, \cdot} \rangle \le {K'}}\) can be represented as a finite union of \((a, p, K)\)-arithmetic sets with \[\begin{align} a &\le a_0 + |P''| \left\Vert{P''}\right\Vert^2 \le \left\Vert{\boldsymbol{b}'}\right\Vert + |P'| \left\Vert{P'}\right\Vert^2 \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S), B})},\\ p & \le \left\Vert{P'}\right\Vert \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S), B})}. \end{align}\] The proof of 11 is completed. ◻
Now we have 11 together with 9 10, which is enough to handle an SLPS that has a non-empty zigzagging infix (the second case of 3). For the other case, notice that the SLPS comprises a constant number of loops, so the bound in 12 works fine.
Lemma 13. Let \(\Lambda\) be a 2-dimensional SLPS. Let \(S = \boldsymbol{s} + {P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\) be a hybrid set. Then \(\mathop{\operatorname{\mathrm{Reach}}}\nolimits(\Lambda, S)\) is a finite union of hybrid sets \(S' = \boldsymbol{b} + {P'}^{\langle {{\boldsymbol{c}'}, \cdot} \rangle \le {K'}}\) where \(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S') \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S)})}\). Moreover, \(P' \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(P) + \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(\Lambda)\).
Proof of 13. By 3, every run in \(\Lambda\) can be represented by a detailing \(\Lambda' = \Lambda_1\Lambda_2\Lambda_3\) where \(\Lambda_1\) and \(\Lambda_3\) are short, \(\Lambda_2\) is zigzagging, and \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda') \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda)})}\). If \(\Lambda_2\) is empty, then we are done by applying 12 to \(\Lambda_1\Lambda_3\) with target set \(T := \mathbb{N}^2\). Otherwise, assume \(\Lambda_2\) is nonempty. Any run starting from \(\boldsymbol{x}\) is then captured by a run in the form of \[\begin{align} \boldsymbol{x} \xrightarrow{\Lambda_1} \boldsymbol{u} {\mathop{\;\raisebox{-0.17em}{\searrow}\kern-0.88em\raisebox{0.17em}{\nwarrow}}}^{\Lambda_2}_{B} \boldsymbol{v} \xrightarrow{\Lambda_3} \boldsymbol{y} \end{align}\] where \(B \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda)})}\) and \(\boldsymbol{u}, \boldsymbol{v} \in [0, B] \times \mathbb{N}\).
Let \(S = \boldsymbol{s} + {P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\). For the detailing \(\Lambda' = \Lambda_1\Lambda_2\Lambda_3\), we first apply 11 and obtain that \(\mathop{\operatorname{\mathrm{Reach}}}\nolimits(\Lambda_1, S) \cap ([0, B] \times \mathbb{N})\) is a finite union of sets \(\boldsymbol{a}_1 + \{\boldsymbol{p}_1\}^{\le K_1}\), where \(\boldsymbol{a}_1 = (x, a)\) and \(\boldsymbol{p}_1 = (0, p)\) satisfy: (i) \(x \in [0, B]\), (ii) \(a, p \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S)})}\).
For each such hybrid set, we apply 9 to each one-turn segment of \(\Lambda_2\). Since the number of one-turn segments in \(\Lambda_2\) is bounded by \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda_2) \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda)})}\), we conclude that \(\mathop{\operatorname{\mathrm{Reach}}}\nolimits(\Lambda_1\Lambda_2, S) \cap ([0, B] \times \mathbb{N})\) is a finite union of hybrid sets \(\boldsymbol{a}_2 + \{\boldsymbol{p}_2\}^{\le K_2}\), where \(\boldsymbol{a}_2 = (x, a')\) and \(\boldsymbol{p}_2 = (0, p')\) satisfy: (i) \(x \in [0, B]\), (ii) \(a' \le a + \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda_2) \cdot {\mathop{\operatorname{\mathrm{poly}}}\nolimits({B, \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda_2), p})} \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S)})}\), and (iii) \(p' \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S)})}\).
Finally, we apply 10 to \(\Lambda_3\) with each of the hybrid sets \(\boldsymbol{a}_2 + \{\boldsymbol{p}_2\}^{\le K_2}\) as a source. This shows that \(\mathop{\operatorname{\mathrm{Reach}}}\nolimits\{\Lambda_1\Lambda_2\Lambda_3, S\}\) is a finite union of hybrid sets \(S' = \boldsymbol{b} + {P'}^{\langle {{\boldsymbol{c}'}, \cdot} \rangle \le {K'}}\), where \(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S') \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda), \left\Vert{\boldsymbol{a}_2}\right\Vert, \left\Vert{\boldsymbol{p}_2}\right\Vert})} \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S)})}\).
To see that the periods belong to \(\mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(P) + \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(\Lambda)\), one needs to go through in detail the proof of 11 9 10 12. It can be verified that periods constructed there correspond to some non-negative homogeneous solutions of the characterization system of \(\Lambda\). Hence, they are non-negative combinations of vectors from \(P\) and loops in \(\Lambda\). ◻
Lemma 14. Let \(V\) be a 2-VASS and \(p, q\) be two states. Let \(S = \boldsymbol{s} + {P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\) be a hybrid set. Then \(\mathop{\operatorname{\mathrm{Reach}}}\nolimits_{q}({V},{p(S)})\) is a finite union of hybrid sets \(S' = \boldsymbol{b} + {P'}^{\langle {{\boldsymbol{c}'}, \cdot} \rangle \le {K'}}\) where \(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S') \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V), \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S)})}\). Moreover, \(P' \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(P) + \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V)\).
Proof. By 7, reachability in \(V\) from \(p\) to \(q\) is characterized by finitely many SLPSs \(\Lambda\) of size \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(\Lambda) \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}\). Hence, the polynomial-sized representation of \(\mathop{\operatorname{\mathrm{Reach}}}\nolimits_{q}({V},{p(S)})\) can be derived from 13. In order to justify that \(P' \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(P) + \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V)\), we need to show that every loop in \(\Lambda\) belongs to \(\mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V)\). This could be verified by looking carefully into the proof of 7. Here, we also provide a black-box proof of this fact.
Let \(\Lambda = \alpha_0 \beta_1 \alpha_1 \ldots \beta_k \alpha_k\) be an SLPS satisfying that \(\boldsymbol{x} \xrightarrow{\Lambda} \boldsymbol{y}\) implies \(p(\boldsymbol{x}) \xrightarrow{*} q(\boldsymbol{y})\) in \(V\). We show that \(\beta_j \in \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V)\) for any \(j \in [k]\). Indeed, one can easily see that for all \(\ell \in \mathbb{N}\), there exists a vector \(\boldsymbol{s}_\ell \in \mathbb{N}^2\) sufficiently large, so that \[\boldsymbol{s}_\ell \xrightarrow{\alpha_0\alpha_1\ldots\alpha_{j-1}\beta_j^{\ell}\alpha_j\ldots\alpha_k} \boldsymbol{t}_\ell = \boldsymbol{s}_{\ell} + \ell \cdot {\beta_j} + \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\alpha_0\alpha_1\ldots\alpha_k).\] Hence, there also exists a path \(\pi_\ell\) in \(V\) such that \(p(\boldsymbol{s}_\ell) \xrightarrow{\pi_\ell} q(\boldsymbol{t}_\ell)\) for \(\ell \in \mathbb{N}\), where \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\pi_\ell) = \ell \cdot {\beta_j} + \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\alpha_0\alpha_1\ldots\alpha_k)\). Denote \(\mathcal{I}_{\pi_\ell}\) the Parikh image of \(\pi_\ell\), which is the function mapping each transition in \(V\) to its number of occurrences along \(\pi_\ell\). We may view \(\mathcal{I}_{\pi_\ell}\) as a vector comparable by the well-quasi-order \(\le\). So there exist \(m < n \in \mathbb{N}\) such that \(\mathcal{I}_{\pi_m} \le \mathcal{I}_{\pi_n}\). Their difference \(\mathcal{I} = \mathcal{I}_{\pi_n} - \mathcal{I}_{\pi_m}\) maps each transition to a non-negative number. Observe that for each state \(s\) in \(V\), \(\mathcal{I}\) specifies the same number of transitions flowing in \(s\) as those flowing out of \(s\). Hence, \(\mathcal{I}\) is the sum of Parikh images of finitely many cycles in \(V\). Moreover, the “effect” of \(\mathcal{I}\) is \[\begin{align} \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\mathcal{I}) := \sum_{\text{transition }u} \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(u) \cdot \mathcal{I}(u) & = \sum_{\text{transition }u} \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(u) \cdot \mathcal{I}_{\pi_n}(u) - \sum_{\text{transition }u} \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(u) \cdot \mathcal{I}_{\pi_m}(u)\\ &= \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\pi_n) - \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\pi_m) = (n-m) \cdot {\beta_j}. \end{align}\] This justifies that \(\beta_j\) belongs to \(\mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V)\). ◻
Proof. Let \(Q, T\) be the states and transitions of \(V\). Let \(U := \mathop{\operatorname{\mathrm{\mathrm{\small cyc}}}}\nolimits(V)\). A normal vector of \(U\) is a vector \(\boldsymbol{n} \in \mathbb{Z}^3\) such that \(\langle {\boldsymbol{n}, \boldsymbol{u}} \rangle = 0\) for all \(\boldsymbol{u} \in U\). We consider two cases.
Consider a run \(p(\boldsymbol{s} + \boldsymbol{p}) \xrightarrow{\pi} q(\boldsymbol{t})\) where \(\boldsymbol{p} \in {P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\). By extracting cycles from \(\pi\) exhaustively, it can be justified that \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\pi)\) is decomposed into \(\boldsymbol{z} + \boldsymbol{u}\) where \(\boldsymbol{u} \in U\) and \(\boldsymbol{z}\) is the effect of some simple path. Hence, \[\begin{align} \langle {\boldsymbol{n}, \boldsymbol{t}} \rangle & = \langle {\boldsymbol{n}, \boldsymbol{s} + \boldsymbol{p}} \rangle + \langle {\boldsymbol{n}, \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\pi)} \rangle = \langle {\boldsymbol{n}, \boldsymbol{s}} \rangle + \langle {\boldsymbol{n}, \boldsymbol{z}} \rangle \end{align}\] where we use the fact that \(\boldsymbol{p} \in P^* \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small cyc}}}}\nolimits(V)\). By 2, we may assume a polynomial bound on the norm of the normal vector \(\left\Vert{\boldsymbol{n}}\right\Vert \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}\). Thus, \[\begin{align} \langle {\boldsymbol{n}, \boldsymbol{t}} \rangle \le 3\left\Vert{\boldsymbol{n}}\right\Vert \cdot (\left\Vert{\boldsymbol{s}}\right\Vert + \left\Vert{\boldsymbol{z}}\right\Vert) \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V), \left\Vert{\boldsymbol{s}}\right\Vert})}. \end{align}\] As \(\boldsymbol{n} \in \mathbb{Z}_{\ge0}^3\), let \(K = \mathop{\operatorname{\mathrm{supp}}}\nolimits(\boldsymbol{n})\), we deduce that \(\left\Vert{\boldsymbol{t}|_K}\right\Vert \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V), \left\Vert{\boldsymbol{s}}\right\Vert})} =: B\) as well. This shows that any configuration reachable from \(p(S)\) has bounded counter values for counters in \(K\). We may encode counters in \(K\) into the states of a VASS. To be explicit, choose \(i \in K\) and construct a 2-VASS \(V_S = (Q_S, T_S)\) defined by
\(Q_S = \{q_v \mid q \in Q, v \in [0, B]\}\);
\(T_S = \{p_u \xrightarrow{\boldsymbol{a}|_{-i}} q_v \mid p \xrightarrow{\boldsymbol{a}} q \in T, \boldsymbol{a}(i) = v - u \}\).
Clearly \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V_S) \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({B,\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})} \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V), \left\Vert{\boldsymbol{s}}\right\Vert})}\). Let \(p' := p_u\) where \(u = \boldsymbol{s}(i)\). Notice that for any \(\boldsymbol{p} \in P^*\) we must have \(\boldsymbol{p}(i) = 0\) as \(\langle {\boldsymbol{n}, \boldsymbol{p}} \rangle = 0\), and \(P \subseteq \mathbb{N}^3\), \(\boldsymbol{n} \ge \boldsymbol{0}\). We deduce that \[\mathop{\operatorname{\mathrm{Reach}}}\nolimits_{q}({V},{p(S)}) = \bigcup_{v \in [0, B]} \{\boldsymbol{t} \in \mathbb{N}^3 \mid \boldsymbol{t}(i) = v, \boldsymbol{t}|_{-i} \in \mathop{\operatorname{\mathrm{Reach}}}\nolimits_{q_v}({V_S},{p_u(S|_{-i})})\}\] By 14, each \(\mathop{\operatorname{\mathrm{Reach}}}\nolimits_{q_v}({V_S},{p_u(S|_{-i})})\) is a finite union of hybrid sets \(S' = \boldsymbol{b'} + {P'}^{\langle {{\boldsymbol{c}'}, \cdot} \rangle \le {K'}}\). We may lift \(S'\) to three dimensions by adding the \(i\)-th coordinate back to \(\boldsymbol{b}'\) with value \(v\) and to \(P'\) with value \(0\). As \(P' \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(P|_{-i}) + \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V_S)\), we deduce that the lifted version is also contained in \(\mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(P) + \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V)\).
Take a non-zero normal vector \(\boldsymbol{n} \in \mathbb{Z}^3\) with \(\left\Vert{\boldsymbol{n}}\right\Vert \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}\). We may assume \(\boldsymbol{n} = (a, b, -c)\) for some \(a, b, c \in \mathbb{N}\) and \(c\ne 0\). For a vector \(\boldsymbol{x} \in \mathbb{N}^3\) we define its shift as \[\delta(\boldsymbol{x}) = \langle {\boldsymbol{n}, \boldsymbol{x}} \rangle - \langle {\boldsymbol{n}, \boldsymbol{s}} \rangle\] Similar to case 1, for any configuration \(q(\boldsymbol{t})\) reachable from \(p(S)\), we have \(|\delta(\boldsymbol{t})| \le B\) for some \(B \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}\). Thus, we encode shifts into states and ignore the third counter. To be explicit, we construct a 2-VASS \(V_S = (Q_S, T_S)\) where
\(Q_S\) contains \(q_v, q_v'\) for each \(q \in Q\) and \(v \in [-B, B]\);
\(T_S\) contains \(p_u \xrightarrow{\boldsymbol{a}|_{-3}} q_v'\) if there is a transition \(p \xrightarrow{\boldsymbol{a}} q\) in \(T\) such that \(\delta(\boldsymbol{a}) = v - u\).
A configuration \(q_v(x, y)\) is supposed to represent the configuration \(q(x, y, z)\) in \(V\) such that \(\delta(x, y, z) = v\). Let \(z(x, y, v) = (ax + by - v - \langle {\boldsymbol{n}, \boldsymbol{s}} \rangle) / c\), which is supposedly the missing counter value in \(q_v(x, y)\). One can verify that if \(z(x, y, v)\) is an integer, then every configuration \(p_u(x', y')\) reachable from \(q_v(x, y)\) renders \(z(x', y', u)\) an integer. To check non-negativity of \(z\), we add a gadget from each \(q_v'\) to \(q_v\) that tests the inequality \(ax + by -v \ge \langle {\boldsymbol{n}, \boldsymbol{s}} \rangle\). The minimal solutions to this inequality are finite and bounded by \({\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V), \left\Vert{\boldsymbol{s}}\right\Vert})}\), which creates a polynomial amplification in \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V_S)\). Verify that \[\mathop{\operatorname{\mathrm{Reach}}}\nolimits_{q}({V},{p(S)}) = \bigcup_{v \in [-B, B]} \{(x, y, z(x, y, v)) \mid (x, y) \in \mathop{\operatorname{\mathrm{Reach}}}\nolimits_{q_v}({V_S},{p_0(S|_{-3})})\}.\] Again by 14, each \(\mathop{\operatorname{\mathrm{Reach}}}\nolimits_{q_v}({V_S},{p_0(S|_{-3})})\) is a finite union of hybrid sets \(\boldsymbol{b}' + {P'}^{\langle {{\boldsymbol{c}'}, \cdot} \rangle \le {K'}}\). We lift it to three dimensions by mapping \(\boldsymbol{b}' = (x, y)\) to \(\boldsymbol{b}'' = (x, y, z(x, y, v))\), and mapping each \(\boldsymbol{p}' = (x, y) \in P'\) to \(\boldsymbol{p}'' = (x, y, (ax + by) / c)\). We need to justify that the lifted vectors are integral. Notice that for each \((x_s, y_s) \in S|_{-3}\) there exists \(z_s \in \mathbb{N}\) such that \((x_s, y_s, z_s) \in S\). We must have \(z(x_s, y_s, 0) = z_s \in \mathbb{N}\). As \(q_v(\boldsymbol{b}')\) is reachable from \(p_0(x_s, y_s)\) for some \((x_s, y_s) \in S|_{-3}\), we deduce that \(z(\boldsymbol{b}'(1), \boldsymbol{b}'(2), v) = \boldsymbol{b}''(3)\) is integral as well. Similarly, for each \(\boldsymbol{p}' \in P'\), \(q_v(\boldsymbol{b}'+\boldsymbol{p}')\) is reachable from \(p_0(x_s, y_s)\) for some \((x_s, y_s) \in S|_{-3}\) (we may assume each period in \(P'\) can be used at least once), so \(\boldsymbol{b}'' + \boldsymbol{p}''\) is integral. Hence, so is \(\boldsymbol{p}''\) itself.
This completes the proof of [thm:hybrid-2vass-hybrid]. ◻
Proof. Let \(V = (V_1)u_1(V_2)\ldots u_{k-1}(V_k)\), with \(C_i := \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits_{>0}(V_i)\) and \(\overline{C_i} := \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V_i)\). As \((V,s)\) is fowrard diagonal, there exists a cycle \(\pi_+\) in \(V_1\) such that \(\boldsymbol{p} := \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\pi_+) \in \mathbb{Q}_{>0}^3\). Also, as \((V,t)\) is backward diagonal, there exists a cycle \(\pi_-\) in \(V_k\) such that \(\boldsymbol{q} := \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\pi_-) \in \mathbb{Q}_{<0}^3\)
Assume w.l.o.g.that \(\mathbb{Q}_{\ge0}^3 \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(V)\). We prove that \(\mathbb{Q}_{>0}^3 \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits_{>0}(V)\). Let \(\boldsymbol{x} \in \mathbb{Q}_{>0}^3\). For each \(C_i\), take a vector \(\boldsymbol{c}_i\) whose norm is small enough such that \(\boldsymbol{p} + \boldsymbol{c}_1 + \cdots + \boldsymbol{c}_j \in \mathbb{Q}_{>0}^3\) for all \(j \in [k]\). Let \(\epsilon > 0\) be a rational number small enough so that \[\boldsymbol{x}' := \boldsymbol{x} - \epsilon(\boldsymbol{p} + \boldsymbol{c}_1 + \boldsymbol{c}_2 + \cdots + \boldsymbol{c}_k) \in \mathbb{Q}_{>0}^3 \subseteq \mathbb{Q}_{\ge 0}^3.\] Then \(\boldsymbol{x}' \in \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(V)\) and there exists \(\boldsymbol{v}_1 \in \overline{C_1}, \ldots, \boldsymbol{v}_k \in \overline{C_k}\) such that \(\boldsymbol{x}' = \boldsymbol{v}_1 + \cdots + \boldsymbol{v}_k\) and \(\boldsymbol{v}_1 + \cdots + \boldsymbol{v}_j \ge \boldsymbol{0}\) for all \(j \in [k]\). We have \[\boldsymbol{x} = (\boldsymbol{v}_1 + \epsilon(\boldsymbol{p} + \boldsymbol{c}_1)) + (\boldsymbol{v}_2 + \epsilon\boldsymbol{c}_2) + \cdots + (\boldsymbol{v}_k + \epsilon\boldsymbol{c}_k),\] which witnesses that \(\boldsymbol{x} \in \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits_{>0}(V)\). As the choice of \(\boldsymbol{x}\) is arbitrary, we conclude that \(\mathbb{Q}_{>0}^3 \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits_{>0}(V)\).
Assume w.l.o.g.that \(\mathbb{Q}_{>0}^3 \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits_{>0}(V)\). We prove that \(\mathbb{Q}_{\ge0}^3 \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(V)\). As \(\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(V)\) is a convex set, it suffices to show that each unit vector \(\boldsymbol{e}_i\) lies in \(\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(V)\). Observe that \(\boldsymbol{x}_i := \boldsymbol{e}_i - \boldsymbol{q} \in \mathbb{Q}_{>0}^3 \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits_{>0}(V) \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(V)\). As \(\boldsymbol{q} \in \overline{C_k}\), it is straightforward to check that \(\boldsymbol{e}_i = \boldsymbol{x}_i + \boldsymbol{q} \in \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(V)\).
◻
We need a few technical auxiliary lemmas.
Lemma 15. Let \(\boldsymbol{a} \in \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(C_1, \ldots, C_j)\) and \(\boldsymbol{a}' \in \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(D_1, \ldots, D_\ell)\). If \(\boldsymbol{a} - \boldsymbol{a}' \ge \boldsymbol{0}\) then \(\boldsymbol{a} - \boldsymbol{a}' \in \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(C_1, \ldots, C_j, -D_\ell, \ldots, -D_1)\). In other words, \[\begin{align} (\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(C_1, \ldots, C_j) &- \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(D_1, \ldots, D_\ell)) \cap \mathbb{Q}_{\ge 0}^d \\ &\subseteq \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(C_1, \ldots, C_j, -D_\ell, \ldots, -D_1) \end{align}\]
Proof. We express \(\boldsymbol{a} = \boldsymbol{c}_1 + \cdots + \boldsymbol{c}_j\) and \(\boldsymbol{a}' = \boldsymbol{d}_1 + \cdots + \boldsymbol{d}_\ell\) that are summations witnessing the membership \(\boldsymbol{a} \in \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(C_1, \ldots, C_j)\) and \(\boldsymbol{a}' \in \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(D_1, \ldots, D_\ell)\). Then \[\boldsymbol{a} - \boldsymbol{a}' = \boldsymbol{c}_1 + \cdots + \boldsymbol{c}_j + (-\boldsymbol{d}_\ell) + \cdots + (-\boldsymbol{d}_1).\] We need to verify for every \(x \in [0, \ell - 1]\), that \(\boldsymbol{c}_1 + \cdots + \boldsymbol{c}_j + (-\boldsymbol{d}_{\ell - 0}) + \cdots + (-\boldsymbol{d}_{\ell - x}) \ge \boldsymbol{0}\). This can be justified as \[\begin{align} \boldsymbol{c}_1 + \cdots + \boldsymbol{c}_j + (-\boldsymbol{d}_{\ell - 0}) + \cdots + (-\boldsymbol{d}_{\ell - x}) &= \boldsymbol{a} - (\boldsymbol{a}' - (\boldsymbol{d}_1 + \ldots + \boldsymbol{d}_{\ell - x - 1}))\\ &= (\boldsymbol{a} - \boldsymbol{a}') + (\boldsymbol{d}_1 + \ldots + \boldsymbol{d}_{\ell - x - 1}) \ge \boldsymbol{0}, \end{align}\] where the last inequality is valid because every prefix sum of \(\boldsymbol{d}_1 + \cdots + \boldsymbol{d}_\ell\) is non-negative. We conclude that \(\boldsymbol{a} - \boldsymbol{a}' \in \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(C_1, \ldots, C_j, -D_\ell, \ldots, -D_1)\). ◻
Corollary 3. Let \(C_1, \ldots, C_k \subseteq \mathbb{Q}^d\) be cones. Then \(\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(C_1, \ldots, C_k) = \mathbb{Q}_{\ge 0}^d\) if and only if there exist \(i \le j\) with \(\mathbb{Q}_{\ge 0}^d \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(C_1, \ldots, C_i) - \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(-C_k, \ldots, -C_j)\).
Proof. The “only if” direction can be easily justified by taking \(i = j = k\). For the “if” direction, by 15 we have \[\begin{align} \mathbb{Q}_{\ge0}^d &= \mathbb{Q}_{\ge0}^d \cap (\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(C_1, \ldots, C_i) - \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(-C_k, \ldots, -C_j))\\ &\subseteq \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(C_1, \ldots, C_i, C_j, \ldots, C_k)\\ &\subseteq \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(C_1, \ldots, C_k). \end{align}\] As any sequential cone is contained in \(\mathbb{Q}_{\ge0}^d\) we conclude \(\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(C_1, \ldots, C_k) = \mathbb{Q}_{\ge 0}^d\). ◻
As \(V\) is not wide, by 3 the difference \(\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(V_h) - \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits({V_t}^{\mathrm{rev}})\) cannot contain the whole \(\mathbb{Q}_{\ge0}^3\). Consequently, the two sequential cones should be separated by a plane. Before we prove this property, we justify that sequential cones are cones of exponential norm.
Lemma 16. Let \(C_1, \ldots, C_k \subseteq \mathbb{Q}^d\) be finitely generated cones whose generators have norm bounded by \(M\). Then \(\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(C_1, \ldots, C_k)\) is a finitely generated cone whose generators have norm bounded by \({\mathop{\operatorname{\mathrm{poly}}}\nolimits({M})}^{(kd)^3}\).
Proof. Let \(P_i\) be the \((d \times n_i)\)-matrix whose columns are the generators of \(C_i\), for \(i \in [k]\). Notice that we have \(n_i \le (M+1)^d\) as \(\left\Vert{P_i}\right\Vert \le M\). Let \(n := \sum_{i} n_i\), then \(n \le k(M+1)^d\). Consider the following linear system \[\begin{align} \label{eq:seq-cone-ge-0} \begin{pmatrix} P_1 & 0 & 0 & \cdots & 0\\ P_1 & P_2 & 0 & \cdots & 0\\ & & \vdots & &\\ P_1 & P_2 & P_3 & \cdots & P_k\\ \end{pmatrix} \cdot \begin{pmatrix} \boldsymbol{x}_1 \\ \boldsymbol{x}_2 \\ \vdots \\ \boldsymbol{x}_k \end{pmatrix} \ge \boldsymbol{0} \end{align}\tag{12}\] Each non-negative integer solution induces a vector \(P_1\boldsymbol{x}_1 + \cdots + P_k\boldsymbol{x}_k\) in \(\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(C_1, \ldots, C_k)\) and vice versa. Let \(X\) be the set of the non-negative integer solutions to 12 . By 1, \(X\) is a cone generated by some finite set \(X_0\) where \[\begin{align} \left\Vert{X_0}\right\Vert &\le ((n+kd+1)M+1)^{kd} \le ((k(M+1)^d + kd + 1)M+1)^{kd} \\&\le ((M+1)^{(2d+1)k})^{kd} \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({M})}^{k^2d^2} \end{align}\] Each solution \((\boldsymbol{x}_1, \ldots, \boldsymbol{x}_k) \in X_0\) yields a generator of \(\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(P_1, \ldots, P_k)\), namely \(\boldsymbol{g} := P_1\boldsymbol{x}_1 + \cdots + P_k\boldsymbol{x}_k\). It holds that \(\left\Vert{\boldsymbol{g}}\right\Vert\le n \cdot M \cdot \left\Vert{X_0}\right\Vert \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({M})}^{(kd)^3}\). ◻
Proof of [lem:separating-plane-non-wide]. Denote \(C_h = \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(V_h)\) and \(C_t = \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits({V_t}^{\mathrm{rev}})\). Let \(P_h = \{\boldsymbol{u}_1, \ldots, \boldsymbol{u}_\ell\}\) be the set of generators of \(C_h\), and let \(P_t = \{\boldsymbol{v}_1, \ldots, \boldsymbol{v}_m\}\) be the set of generators of \(C_t\). By 16, we assume \(\left\Vert{P_h}\right\Vert, \left\Vert{P_t}\right\Vert \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}^{(kd)^3}\). Let \(W = P_h \cup P_t\), we identify two cases:
In this case, both \(C_h\) and \(C_t\) are already contained in a hyperplane. Let \(X = \{\boldsymbol{x}_1, \ldots, \boldsymbol{x}_r\}\) be a basis of \(\mathop{\operatorname{\mathrm{span}}}\nolimits(W)\) comprising vectors from \(W\). Then any non-zero vector \(\boldsymbol{n} \in \mathbb{Z}^d\) orthogonal to \(X\) “separates” \(C_h\) and \(C_t\), in the sense that \(\langle {\boldsymbol{n}, C_h} \rangle \ge 0\) and \(\langle {\boldsymbol{n}, C_t} \rangle \le 0\) (because they are both equal to zero). We may take \(\boldsymbol{n}\) as any non-zero integer solution of the equation \(X^T\boldsymbol{n} = \boldsymbol{0}\). By 2, such an \(\boldsymbol{n}\) exists with \(\left\Vert{\boldsymbol{n}}\right\Vert \le \mathcal{O}(d\left\Vert{W}\right\Vert)^d \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}^{k^3d^5}\). Here we remark that 2 is stated for non-negative solutions. We may negate some columns of \(X\) to assume that \(\boldsymbol{n} \ge \boldsymbol{0}\), which does not affect the norm of \(\boldsymbol{n}\).
As \(V\) is not wide, by 3, there exists a non-zero vector \(\boldsymbol{p} \in \mathbb{Z}_{\ge0}^d\) such that \(\boldsymbol{p} \notin C_h - C_t\). Viewing \(P_h\) and \(P_t\) as matrices whose columns are their elements, the following equation has no non-negative solution: \[\begin{pmatrix} P_h & -P_t \end{pmatrix} \cdot \boldsymbol{x} = \boldsymbol{p}.\] By the fundamental theorem of linear inequalities [27], there exists a non-zero vector \(\boldsymbol{n}_0 \in \mathbb{Q}^d\) such that \(\langle {\boldsymbol{n}_0, \boldsymbol{p}} \rangle < 0\) and
\(\langle {\boldsymbol{n}_0, \boldsymbol{u}} \rangle \ge 0\) for \(\boldsymbol{u} \in P_h\), and \(\langle {\boldsymbol{n}_0, -\boldsymbol{v}} \rangle \ge 0\) for \(\boldsymbol{v} \in P_t\); hence \(\langle {\boldsymbol{n}_0, \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(V_h)} \rangle \ge 0\), and \(\langle {\boldsymbol{n}_0, \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits({V_t}^{\mathrm{rev}})} \rangle \le 0\);
the hyperplane \(\{\boldsymbol{x} \in \mathbb{Q}^d \mid \langle {\boldsymbol{n}_0, \boldsymbol{x}} \rangle = 0\}\) contains \(d - 1\) linear independent vectors from \(W\); here we let \(X\) denote the set of these \(d-1\) vectors.
The solutions to the equation \(X^T \boldsymbol{n} = 0\) is exactly \(\mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits\{\boldsymbol{n}_0, -\boldsymbol{n}_0\}\), as the rank of \(X\) is \(d - 1\). Let \(j \in [d]\) be such that \(\boldsymbol{n}_0(j) \ne 0\), we further assume \(\boldsymbol{n}_0(j) > 0\). The desired vector \(\boldsymbol{n}\) may be taken as any non-zero integer solution to the system \(X^T \boldsymbol{n} = 0, \boldsymbol{n}(j) > 0\). By 1, such an \(\boldsymbol{n}\) exists with \(\left\Vert{\boldsymbol{n}}\right\Vert \le \mathcal{O}(d\left\Vert{W}\right\Vert)^{d+1} \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}^{k^3d^5}\).
◻
We need the following lemma to show [lem:reach-eq-seq-cone-plus-bounded-of-diag].
Lemma 17. If \(\mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V) \cap \mathbb{Q}_{>0}^d \neq \emptyset\), then there exists a cycle \(\theta\) with \(|\theta| \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}^d\) and \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta) \ge \boldsymbol{1}\).
Proof. Assume that \(V=(Q, T)\), \(s=p(\boldsymbol{x})\), and \(M:=\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)\). For the first statement, let \(\boldsymbol{a} \in \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V) \cap \mathbb{Q}_{>0}^d\) be a positive vector. By Carathéodory’s Theorem [27], there exists \(d\) simple cycles \((\theta_i)_{i \in [d]}\) in \(V\) such that \[\sum_{i \in [d]}\lambda_i\cdot\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_i) = \boldsymbol{a},\] where \(\lambda_i \in \mathbb{N}\) for each \(i \in [d]\). By scaling, we may assume that each \(\lambda_i\) is an integer and \(\boldsymbol{a}\) an integer vector. It holds \(\boldsymbol{a}\geq \boldsymbol{1}\). Consider the underlying Diophantine system \(A\boldsymbol{\lambda} \ge \boldsymbol{1}\), where \(\boldsymbol{\lambda} \in \mathbb{N}^d\) are variables and \(A \in \mathbb{Z}^{d \times d}\) is the matrix whose columns are exactly \((\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_i))_{i \in [d]}\). Note that \(\left\Vert{A}\right\Vert \le |Q| \cdot \left\Vert{T}\right\Vert\). Applying 1, we obtain that there exists some minimal solution \(\boldsymbol{\lambda}_0\) with \(\left\Vert{\boldsymbol{\lambda}_0}\right\Vert \le \mathcal{O}(M)^{2d}\). One can construct a cycle accordingly: select the shortest cycle \(\theta_0\) visiting all states, and then concatenate each of the \(d\) simple cycles; we repeat the cycle \(\theta_i\) exactly \((|\theta_0|\cdot \left\Vert{T}\right\Vert + 1)\cdot \boldsymbol{\lambda}_0(i)\) times for each \(i \in [d]\), to obtain a single cycle \(\theta\), whose size is \[|\theta| \le |\theta_0|+(|\theta_0|\cdot \left\Vert{T}\right\Vert + 1)\cdot d \cdot \left\Vert{\boldsymbol{\lambda}_0}\right\Vert \le \mathcal{O}(M)^{2d+3} \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({M})}^d.\] and its effect is \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta) = \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_0) + (|\theta_0|\cdot \left\Vert{T}\right\Vert + 1) \cdot A \boldsymbol{\lambda}_0 \ge -|\theta_0|\cdot \left\Vert{T}\right\Vert\cdot \boldsymbol{1} + (|\theta_0|\cdot \left\Vert{T}\right\Vert + 1) \cdot \boldsymbol{1} \ge \boldsymbol{1}\). ◻
Proof. A run \(\pi\) from \(s\) to \(t\) can be factored to \(k\) segments, one for each component. The effect of each segment \(\pi_i\) can be further decomposed into a sum of the effect \(\boldsymbol{z}_i\) of some simple path, and a vector \(\boldsymbol{c}_i \in \mathop{\operatorname{\mathrm{\mathrm{\small cone}}}}\nolimits(V_i)\). We have \[\label{2026-07-07-0828} \boldsymbol{t}_i := \boldsymbol{u} + (\boldsymbol{z}_1 + \boldsymbol{c}_1) + \cdots + (\boldsymbol{z}_i + \boldsymbol{c}_i) \ge \boldsymbol{0}\tag{13}\] for all \(i \in [k]\), as it is the vector of some configuration on \(\pi\). Now let \(\boldsymbol{p}\) be the effect of a diagonal cycle in \(V_1\) whose existence is guaranteed. We may assume \(\left\Vert{\boldsymbol{p}}\right\Vert \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}^{d}\) by 17. Let \(m := \left\Vert{\boldsymbol{u}}\right\Vert + \sum_{i=1}^k \left\Vert{\boldsymbol{z}_i}\right\Vert \le \left\Vert{s}\right\Vert + {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}\). We claim that \(m\boldsymbol{p} + \boldsymbol{c}_1 + \cdots + \boldsymbol{c}_k \in \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(V)\). Indeed, for \(i \in [k]\), \[\begin{align} m\boldsymbol{p} + \boldsymbol{c}_1 + \cdots + \boldsymbol{c_i} &= \boldsymbol{t}_i + m\boldsymbol{p} - (\boldsymbol{u} + \boldsymbol{z}_1 + \cdots + \boldsymbol{z}_i) \ge \boldsymbol{t}_i \ge \boldsymbol{0}. \end{align}\] Now \(\boldsymbol{v}=\boldsymbol{t}_k\) by 13 . It follows that the difference between \(\boldsymbol{v}\) and \(\mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(V)\) is bounded by \(\boldsymbol{h} = (m\boldsymbol{p} + \boldsymbol{c}_1 + \cdots + \boldsymbol{c_k})-\boldsymbol{v} = m\boldsymbol{p} - (\boldsymbol{u} + \boldsymbol{z}_1 + \cdots + \boldsymbol{z}_k)\). Clearly \(\left\Vert{\boldsymbol{h}}\right\Vert \le 2m\left\Vert{\boldsymbol{p}}\right\Vert \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}^{d+1}\cdot\left\Vert{s}\right\Vert\). ◻
Proof. By [lem:reach-eq-seq-cone-plus-bounded-of-diag], there exist vectors \(\boldsymbol{h}_h, \boldsymbol{h}_t \in \mathbb{Z}^3\) such that \(\boldsymbol{z} = \boldsymbol{s}_h + \boldsymbol{h}_h = \boldsymbol{s}_t + \boldsymbol{h}_t\), where \(\boldsymbol{s}_h \in \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(\mathcal{H}_i)\) and \(\boldsymbol{s}_t \in \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits({\mathcal{T}_i}^{\mathrm{rev}})\). Moreover, \(\left\Vert{\boldsymbol{h}_h}\right\Vert \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})} \cdot \left\Vert{s}\right\Vert\) and \(\left\Vert{\boldsymbol{h}_t}\right\Vert \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})} \cdot \left\Vert{t}\right\Vert\). By [lem:separating-plane-non-wide], the vector \(\boldsymbol{n}_i\) satisfies \(\langle {\boldsymbol{n}_i, \boldsymbol{s}_h} \rangle \ge 0\) and \(\langle {\boldsymbol{n}_i, \boldsymbol{s}_t} \rangle \le 0\). Hence, \[\begin{align} \langle {\boldsymbol{n}_i, \boldsymbol{z}} \rangle & = \langle {\boldsymbol{n}_i, \boldsymbol{s}_h} \rangle + \langle {\boldsymbol{n}_i, \boldsymbol{h}_h} \rangle \ge - 3\left\Vert{\boldsymbol{n}_i}\right\Vert\left\Vert{\boldsymbol{h}_h}\right\Vert \ge - {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}^{k^3}\left\Vert{s}\right\Vert,\\ \langle {\boldsymbol{n}_i, \boldsymbol{z}} \rangle & = \langle {\boldsymbol{n}_i, \boldsymbol{s}_t} \rangle + \langle {\boldsymbol{n}_i, \boldsymbol{h}_t} \rangle \le 3\left\Vert{\boldsymbol{n}_i}\right\Vert\left\Vert{\boldsymbol{h}_t}\right\Vert \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}^{k^3}\left\Vert{t}\right\Vert. \end{align}\] We conclude that \(|\langle {\boldsymbol{n}_i, \boldsymbol{z}} \rangle| \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)})}^{k^3} \cdot (\left\Vert{s}\right\Vert + \left\Vert{t}\right\Vert)\). ◻
Proof. Let \(M\) denote \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,t)\), and let \(c\) be a constant satisfying \(L(x, y) \le (x+y)^c\), \(H(x, y)^2 \le (x+y)^c\), and \(B_h, B_n, \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V_j') \le M^{ck^3}\). We prove by induction that \(f_j(x) \le (M + x)^{(4c^3k^3)^{k-j+1}}\). Firstly, for \(j = k\) we have \[f_k(x) \le (\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V_k', t) + x)^c \le (M^{ck^3} + x)^c \le (M + x)^{c^2k^3}.\] Secondly, for \(j < k\), verify that \[y := (B_h +3B_n+ 1)\cdot H(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V_j'), x)^2 \le (M + x)^{2c^2k^3}.\] By the induction hypothesis, \(B_j(x) = f_{j+1}(y) \le (M + x)^{(2c^2k^3) \cdot (4c^3k^3)^{k-j}}\). \[\begin{align} f_j(x) & = 2L(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V_j')+B_j(x), x) \le 2(M^{ck^3} + (M + x)^{(2c^2k^3) \cdot (4c^3k^3)^{k-j}}+x)^c\\ &\leq 2(M+x)^{(3c^3k^3)\cdot (4c^3k^3)^{k-j}}\\ & \le (M + x)^{(4c^3k^3)^{k-j+1}}. \end{align}\] Finally, we have \(f_1(x) \le (\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V, s, t) + x)^{2^{{\mathop{\operatorname{\mathrm{poly}}}\nolimits({k})}}}\). ◻
Proof. Assume that \(s = p(\boldsymbol{x})\) and \(M:=\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)\). Let \(U := 2P(M)^{2k} \cdot (\left\Vert{s}\right\Vert + 2)\), where \(P(x)\) is the polynomial defined in 5. If \(\mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi, U) \ne \emptyset\), then there exists a coordinate that remains bounded by \(U\) throughout \(\pi\), and we are done by taking \(\pi_1=\pi_3:=\varepsilon\) and \(\pi_2 := \pi\). We shall focus on the case \(\mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi, U) = \emptyset\) and will show that there exists a sequence of jointly diagonal cycles \(\theta_1, \theta_2, \theta_3\) enabled along \(\pi\). Since \(c_1:=s\) is pumpable in \(V\), there exists some \(\iota \in [d]\) such that \(p(\boldsymbol{x})\xrightarrow{*}p(\boldsymbol{x}')\) in \(V\) for some \(\boldsymbol{x}' \ge \boldsymbol{x}+\boldsymbol{e}_\iota\). Applying Rackoff’s classical upper bound of coverability [28], we obtain a covering run \(p(\boldsymbol{x})\xrightarrow{\theta_1}p(\boldsymbol{x}'')\) in \(V\) of length \[|\theta_1|\le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({M, \left\Vert{\boldsymbol{x}}\right\Vert+1})} \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s)})},\] where \(\boldsymbol{x}'' > \boldsymbol{x}\). This also implies that \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_1)>\boldsymbol{0}\).
Now there are two subcases. In the case where \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_1) \ge \boldsymbol{1}\), we are done by taking \(\theta_2=\theta_3:=\theta_1\), and \(c_2 = c_3:=c_1\). Otherwise, we assume, w.l.o.g., that \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_1)(3) > 0\). Given a vector \(\boldsymbol{x} \in \mathbb{Q}^3\), we use \(\boldsymbol{x}|_{-3} \in \mathbb{Q}^2\) to denote the unique vector satisfying \(\boldsymbol{x}|_{-3}(i)=\boldsymbol{x}(i)\) for \(i \in [2]\). This subscription can be extended to configurations, runs, and VASS to denote the counterpart obtained by dropping the third coordinate. Now we omit the third coordinate of \((V, s, t)\) to obtain a new 2-VASS \((V',s',t')\) with size at most \(M\). Also, \(\pi\) induces a run \(\pi':=\pi|_{-3}\) in \(V'\) with \(\mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi', U) = \emptyset\), which means that there exists a configuration along \(\pi'\) whose norm exceeds \(U\). Let \(c\) be the first configuration with \(\left\Vert{c}\right\Vert \ge P(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V'))^k\cdot(\left\Vert{s'}\right\Vert+1)\). Note that \(V\) and \(V'\) have the same state graph; hence, \(V'\) is also \(k\)-component. By 5, there is a cycle \(\theta'_2\) such that \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta'_2) > \boldsymbol{0}\) and \(|\theta'_2| \le P(M)\), which is fireable at some \(p_2(\boldsymbol{x}'_2)\) before \(c\). For the original VASS \(V\), these induce a cycle \(\theta_2\) with \(|\theta_2|\le P(M)\) and \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_2)|_{-3} = \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_2')>\boldsymbol{0}\). Moreover, there exists a configuration \(c_2=p_2(\boldsymbol{x}_2)\) such that \((\boldsymbol{x}_2)|_{-3} = \boldsymbol{x}_2' \ge \mathop{\operatorname{\mathrm{\mathrm{\small drop}}}}\nolimits(\theta_2)|_{-3}\). The third entry of \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_3)\) may be negative. But considering the vector \[\boldsymbol{a}_2:=(\left\Vert{\mathop{\operatorname{\mathrm{\mathrm{\small drop}}}}\nolimits(\theta_2)}\right\Vert+1) \cdot \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_1),\] it is easy to see that \(\boldsymbol{a}_2 \in \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(\theta_1)\). As \(\boldsymbol{x}_2 + \boldsymbol{a}_2 \ge \mathop{\operatorname{\mathrm{\mathrm{\small drop}}}}\nolimits(\theta_2)\), we conclude that \(\theta_2\) is fireable at \(p_2(\boldsymbol{x}_2 + \boldsymbol{a}_2)\). Let \(\pi_1\) be the prefix from \(s\) to \(c_2\). Since \(c\) is the first configuration whose norm exceeds the specified bound, it follows that \[\boldsymbol{z}(i) \le P(M)^k\cdot(\left\Vert{s'}\right\Vert+1) + M \le P(M)^k\cdot(\left\Vert{s}\right\Vert+2) \le U,\] holds for every \(i \in [2]\) and \(q(\boldsymbol{z})\) along \(\pi_1\). Therefore, we have \(|\mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi_1, U)|\ge 2\) and for each \(\iota \in [3]\) with \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_1)(\iota) = 0\), it holds that \(\iota \in [2] \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi_1, U)\)
If \(\boldsymbol{a}_2 + \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_2) \in \mathbb{Q}_{>0}^3\), then we are done by taking \(\theta_3:=\theta_2\) and \(c_3:=c_2\). Otherwise, we assume, w.l.o.g., that \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_2)(2) > 0\) and \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_2)(1) = 0\). Since \[P(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V))^k\cdot(\left\Vert{c_2}\right\Vert + 1) \le P(M)^k \cdot (P(M)^k \cdot (\left\Vert{s}\right\Vert + 2) + 1) \le U,\] following the same argument, we can obtain a cycle \(\theta_3\) with \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_3)(1) > 0\), together with some \(c_3=p_3(\boldsymbol{x}_3)\) with \(\boldsymbol{x}_3(1) \ge \mathop{\operatorname{\mathrm{\mathrm{\small drop}}}}\nolimits(\theta_3)(1)\). Let \[\boldsymbol{a}_3 := (\left\Vert{\mathop{\operatorname{\mathrm{\mathrm{\small drop}}}}\nolimits(\theta_3)}\right\Vert + 1)\cdot \boldsymbol{a}_2 \in \mathop{\operatorname{\mathrm{\mathrm{\small SeqCone}}}}\nolimits(\theta_1, \theta_2).\] Then \(\boldsymbol{a}_3 + \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_3) \ge \boldsymbol{1}\), which implies that \(\theta_1, \theta_2, \theta_3\) are jointly diagonal. Moreover, the cycle \(\theta_3\) are fireable at \(p_3(\boldsymbol{x}_3+\boldsymbol{a}_3)\), and consequently \(\theta_1\), \(\theta_2\), \(\theta_3\) are enabled along \(c_1\), \(c_2\), and \(c_3\). Let \(\pi_2\) be the infix of \(\pi\) from \(c_2\) to \(c_3\). Then \(|\mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi_1\pi_2, U + M)| \ge 1\), and for each \(\iota \in [3]\) with \(\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_1)(\iota) = \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_2)(\iota) = 0\), it holds that \(\iota \in \{1\} \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi_2, U)\). Finally, we complete the proof by letting \(B\) be the maximum of all the bounds appearing in the above argument. ◻
Proof. Let \(s \xrightarrow{\pi} q(\boldsymbol{y})\) be the shortest run between these two configurations. It suffices to show that, for each \(\ell \in \mathbb{N}\), there exists a run \(s\xrightarrow{\rho_i} q(\boldsymbol{y}+\ell\cdot\boldsymbol{a})\) with \(|\rho_i| \le |\pi| + \ell \cdot \lambda \cdot |\theta_1| + \ell\cdot |\theta_2|\). Indeed, we can take \(\rho_i := \theta_1^{\ell\lambda} \pi \theta_2^{\ell}\). Since \(\boldsymbol{a} \ge \boldsymbol{0}\) and \(s \xrightarrow{\theta_1} p(x+\boldsymbol{a})\), it must hold that \(s \xrightarrow{\theta_1^{\ell\lambda}} p(\boldsymbol{x}+\ell\cdot\lambda\cdot\boldsymbol{a})\). By the monotonicity of VASS, we have \(p(\boldsymbol{x}+\ell\cdot\lambda\cdot\boldsymbol{a}) \xrightarrow{\pi} q(\boldsymbol{y}+\ell\cdot\lambda\cdot\boldsymbol{a})\). Therefore, it remains to justify that \(q(\boldsymbol{y}+\ell\cdot\lambda\cdot\boldsymbol{b}) \xrightarrow{\theta_2^\ell} q(\boldsymbol{y} + \ell \cdot \boldsymbol{b})\), which is already a \(\mathbb{Z}\)-run. It suffices to show that the first iteration and the last iteration of \(\theta_2\) are fireable, when \(\ell \ge 1\). By assumption, we have \(\boldsymbol{y} + \ell\cdot\lambda\cdot\boldsymbol{a} \ge \boldsymbol{y} + \lambda\cdot\boldsymbol{a} \ge \mathop{\operatorname{\mathrm{\mathrm{\small drop}}}}\nolimits(\theta_2)\), which implies that the first iteration is valid. As for the last iteration, just note that \[\boldsymbol{y} + \ell\cdot\lambda \cdot \boldsymbol{a} + (\ell-1)\cdot \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_2) = \boldsymbol{y} + (\ell - 1)\cdot\boldsymbol{b} + \lambda\cdot \boldsymbol{a} \ge \boldsymbol{y} + \lambda\cdot\boldsymbol{a} \ge \mathop{\operatorname{\mathrm{\mathrm{\small drop}}}}\nolimits(\theta_2).\] Therefore, we have \(s \xrightarrow{\rho_i} q(\boldsymbol{y} + \ell \cdot \boldsymbol{b})\), which completes the proof. ◻
Proof. Note that we do not distinguish between \(\mathbb{Q}^{I}\) and \(\mathbb{Q}^{|I|}\). Let \(M := \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V)\). For each vector \(\boldsymbol{z} \in \mathbb{Q}^3\), we denote by \(\boldsymbol{z}|_{I}\) the unique vector in \(\mathbb{Q}^{I}\) such that \(\boldsymbol{z}|_{I}(\iota) = \boldsymbol{z}(\iota)\) for each \(\iota \in I\), and write \(\boldsymbol{z}|_{-I}:=\boldsymbol{z}|_{[d]\setminus I}\). Let \(Q' := Q \times [0,B-1]^{I}\), and we write \(p_{\boldsymbol{u}}\) for the state \((p,\boldsymbol{u}) \in Q'\). Define \[T':=\{(p_{\boldsymbol{u}},\boldsymbol{a}|_{-I},q_{\boldsymbol{v}})\mid (p,\boldsymbol{a},q) \in T, \boldsymbol{u},\boldsymbol{v} \in [0,B-1]^{I},\text{ and }\boldsymbol{u}+\boldsymbol{a}|_I=\boldsymbol{v}\}.\] Then we can construct a VASS \(V' := (Q', T')\) with \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V') \le B^{|I|}\cdot M\le B^3\cdot M\), which is intuitively obtained from \(V\) by encoding all the coordinates in \(I\) into states. We may add one isolated state and at most two self-loops to \(V'\) to ensure that \(\mathop{\operatorname{\mathrm{\mathrm{\small cyc}}}}\nolimits(V') = \mathbb{Q}^{[3] \setminus I}\). Assume that \(S_p = \boldsymbol{b} + {P}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\). We shall assume that each vector in \(P\) can be used at least once. We first show that \(\boldsymbol{p}|_I = \boldsymbol{0}\) for each \(\boldsymbol{p}\in P\). Otherwise, there exists some \(\boldsymbol{p} \in P\) with \(\boldsymbol{p}|_I > \boldsymbol{0}\). Note that \(\boldsymbol{z} := \boldsymbol{b} + \boldsymbol{p} \in S\) while \(\boldsymbol{z}|_I > \boldsymbol{b}|_I\), which contradicts with the fact that \(\boldsymbol{z}|_I = \boldsymbol{x}|_I = \boldsymbol{b}|_I\). Now we can obtain a hybrid set \(S_p' = \boldsymbol{b}' + {(P')}^{\langle {{\boldsymbol{c}}, \cdot} \rangle \le {K}}\) containing \(\boldsymbol{x}|_{-I}\) by projecting \(S_p\) onto \(\mathbb{Q}^{[3]\setminus I}\), which renders true the following claim.
For each \(\boldsymbol{z}' \in S_p'\), there is a unique \(\boldsymbol{z} \in S_p\) such that \(\boldsymbol{z}|_{-I} = \boldsymbol{z}'\) and \(\boldsymbol{z}|_I = \boldsymbol{x}|_I\).
It is routine to check that \(p_{\boldsymbol{x}|_I}(\boldsymbol{x}|_{-I}) \xrightarrow{*} q_{\boldsymbol{y}|_I}(\boldsymbol{y}|_{-I})\) in \(V'\). Note that \(V'\) is at most 2-dimensional, given that \(I \neq \emptyset\). Since \(P' \subseteq \mathop{\operatorname{\mathrm{\mathrm{\small cyc}}}}\nolimits(V')\), by [thm:hybrid-2vass-hybrid], there exists a hybrid set in the form of \(S_q':=\boldsymbol{b}_q' + {(P'_q)}^{\langle {{\boldsymbol{c}_q}, \cdot} \rangle \le {K_q}}\) with \(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S_q') \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({B,M,\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S_p)})}\) and \[\boldsymbol{y}|_{-I} \in S_q' \subseteq \mathop{\operatorname{\mathrm{Reach}}}\nolimits_{q_{\boldsymbol{y}|_I}}({V'},{p_{\boldsymbol{x}|_I}(S_p')}).\] Let \(\boldsymbol{b}_q \in \mathbb{N}^3\) be the vector obtained by augmenting \(\boldsymbol{b}_q'\) with the values \(\boldsymbol{y}|_I\) at the coordinates in \(I\). Similarly, let \(P_q\subseteq \mathbb{N}^3\) be the sets obtained by augmenting \(P'\) with zero values at the coordinates in \(I\). We claim that \(S_q := \boldsymbol{b}_q + {P_q}^{\langle {{\boldsymbol{c}_q}, \cdot} \rangle \le {K_q}}\) satisfies the requirements.
Since \(\left\Vert{(\boldsymbol{y}|_I)}\right\Vert \le B\), it holds that \(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S_q) \le \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S_q') + B \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({B + M + \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S_p)})}\).
It is trivial that \(\boldsymbol{y} \in S_q\). For every \(\boldsymbol{z} \in S_q\), we have \(\boldsymbol{z} - \boldsymbol{b}_q \in P_q^*\). It holds by construction that \((\boldsymbol{z} - \boldsymbol{b}_q)|_I = \boldsymbol{0}\). Therefore, \(\boldsymbol{z}(\iota) = \boldsymbol{b}_q(\iota) = \boldsymbol{y}(\iota)\) for every \(\iota \in I\).
For each \(\boldsymbol{y}' \in S_q\), we have \(\boldsymbol{y}'|_{-I} \in S_q'\), which implies that there exists some \(\boldsymbol{z} \in S_p'\) with \(p_{\boldsymbol{x}|_I}(\boldsymbol{z}) \xrightarrow{*} q_{\boldsymbol{y}|_I}(\boldsymbol{y}'|_{-I})\) in \(V'\). By 2, there is a run \(p_{\boldsymbol{x}|_I}(\boldsymbol{z}') \xrightarrow{\rho'}q_{\boldsymbol{y}|_I}(\boldsymbol{y}'|_{-I})\) in \(V'\) for some \(\boldsymbol{z}' \in S_p'\) with \[\left\Vert{\boldsymbol{z}'}\right\Vert, |\rho'| \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({B, M,\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S_p'), \left\Vert{\boldsymbol{y}'}\right\Vert})} \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({B, M,\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S_p), \left\Vert{\boldsymbol{y}'}\right\Vert})}.\] Let \(\boldsymbol{x}' \in \mathbb{N}^3\) be the vector obtained by augmenting \(\boldsymbol{z}'\) with the values \(\boldsymbol{x}|_I\) at the coordinates in \(I\). Then by [claim:project-hybrid-set-recoverable], \(\boldsymbol{x}' \in S_p\) and \(\left\Vert{\boldsymbol{x}'}\right\Vert \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({B + \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V) + \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S_p) + \left\Vert{\boldsymbol{y}'}\right\Vert})}\). It is straightforward that \(\rho''\) induces a run \(p(\boldsymbol{x}')\xrightarrow{\rho} q(\boldsymbol{y}')\) in \(V\) with \[|\rho| = |\rho'| \le {\mathop{\operatorname{\mathrm{poly}}}\nolimits({B + \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V) + \mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S_p) + \left\Vert{\boldsymbol{y}'}\right\Vert})}.\]
The argument above completes the proof of the lemma. ◻
Proof. It is trivial that \(\boldsymbol{w} \in S_r \subseteq S_r'\). For any \(\boldsymbol{z} \in S_r'\), we can write it as \[\boldsymbol{z} = \boldsymbol{z}' + \ell\cdot\boldsymbol{a} = \boldsymbol{z}' + \ell\cdot \lambda\cdot \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_1) + \ell \cdot \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_2),\] where \(\boldsymbol{z}' \in S_r \subseteq \mathop{\operatorname{\mathrm{Reach}}}\nolimits_{r}({V},{s})\) and \(\ell \in \mathbb{N}\). Note that \(\boldsymbol{z} \ge \boldsymbol{z}'\). Assume that \(\boldsymbol{a}(\iota) > 0\) for some \(\iota \in [3]\). Since \(\boldsymbol{z}(\iota) \ge \boldsymbol{z}'(\iota) + \ell \ge \ell\), we have \(\ell, \left\Vert{\boldsymbol{z}'}\right\Vert \le \left\Vert{\boldsymbol{z}}\right\Vert\). Then we have \[\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,r(\boldsymbol{z}')) \le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,r(\boldsymbol{z}'))^{2m^2k} \le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,r(\boldsymbol{z}))^{2m^2k}.\] Since \(\theta_1\), \(\theta_2\), \(\theta_3\) can be enabled, by definition, \(\theta_1\) is fireable at \(s\) and \(\boldsymbol{w} + \lambda'\cdot\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_1) \ge \mathop{\operatorname{\mathrm{\mathrm{\small drop}}}}\nolimits(\theta_2)\) for some \(\lambda'\in \mathbb{N}\). Note that \(\boldsymbol{z}'\) coincides with \(\boldsymbol{w}\) in the second and third coordinates. We have \(\boldsymbol{z}' + \lambda' \cdot \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_1) \ge \mathop{\operatorname{\mathrm{\mathrm{\small drop}}}}\nolimits(\theta_2)\). It is clear that choosing \(\lambda = BM+1 \ge \left\Vert{\mathop{\operatorname{\mathrm{\mathrm{\small drop}}}}\nolimits(\theta_2)}\right\Vert\) suffices, which ensures that \(\boldsymbol{z}' + \lambda\cdot \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_1)\ge \mathop{\operatorname{\mathrm{\mathrm{\small drop}}}}\nolimits(\theta_2)\), or equivalently, \[r(\boldsymbol{z}' + \lambda\cdot\mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_1))\xrightarrow{\theta_2} r(\boldsymbol{z}' + \boldsymbol{a}).\] By [lem:reach-closed-under-pumping-cycle], we have \(\boldsymbol{z} \in \mathop{\operatorname{\mathrm{Reach}}}\nolimits_{r}({V},{s})\) and \[\begin{align} \min \mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V, s, r(\boldsymbol{z})) &\le \min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,r(\boldsymbol{z}')) + \ell\cdot\lambda \cdot|\theta_1| + \ell \cdot |\theta_2|\\ &\le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,r(\boldsymbol{z}))^{2m^2k} + \left\Vert{\boldsymbol{z}}\right\Vert \cdot (BM + 1) \cdot B + \left\Vert{\boldsymbol{z}}\right\Vert\cdot B \\ &\le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,r(\boldsymbol{z}))^{6m^2k}. \end{align}\] Note that \(\mathop{\operatorname{\mathrm{\mathrm{\small norm}}}}\nolimits(S_r') \le M^{2m^2k} + \left\Vert{\boldsymbol{a}}\right\Vert \le M^{6m^2k}\), which completes the proof. ◻
Proof. For any \(\boldsymbol{z} \in S_p'\), we can write it as \[\boldsymbol{z} = \boldsymbol{z}' + \ell\cdot\boldsymbol{p} = \boldsymbol{z}' + \ell\cdot \lambda\cdot \boldsymbol{a} + \ell \cdot \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\theta_3),\] where \(\ell \in \mathbb{N}\) and \(\boldsymbol{z}' \in S_p\). Similarly, we have \(\ell, \left\Vert{\boldsymbol{z}'}\right\Vert \le \left\Vert{\boldsymbol{z}}\right\Vert\). Then by 5 , there exists some \(\boldsymbol{w}' \in S'_r\) with a run \(r(\boldsymbol{w}')\xrightarrow{\rho} p(\boldsymbol{z}')\) in \(V\) such that \[\left\Vert{\boldsymbol{w}'}\right\Vert, |\rho| \le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,p(\boldsymbol{z}'))^{8m^3k} \le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,p(\boldsymbol{z}))^{8m^3k}.\] Note that \(\boldsymbol{w}'':=\boldsymbol{w}' + \ell \cdot\lambda\cdot\boldsymbol{a} \in S_r'\) holds by construction. Then \[\left\Vert{\boldsymbol{w}''}\right\Vert \le \left\Vert{\boldsymbol{w}'}\right\Vert + \left\Vert{\boldsymbol{z}}\right\Vert \cdot \lambda \cdot \left\Vert{\boldsymbol{a}}\right\Vert \le 2\cdot\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,p(\boldsymbol{z}))^{8m^3k} \le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,p(\boldsymbol{z}))^{9m^3k}.\] By [claim:len-first-round-approx], there exists a run \(s \xrightarrow{\sigma} r(\boldsymbol{w}'')\) with \[\begin{align} |\sigma| &\le (M + 3 \cdot \left\Vert{\boldsymbol{w}''}\right\Vert)^{6m^2k} \\ &\le \left(4 \cdot \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,p(\boldsymbol{z}))^{9m^3k}\right)^{6m^2k} \\ &\le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,p(\boldsymbol{z}))^{66m^5k^2}. \end{align}\] Again by the monotonicity of VASS reachability, we have \(r(\boldsymbol{w}'')\xrightarrow{\rho}p(\boldsymbol{z}'')\) in \(V\), where \(\boldsymbol{z}'':=\boldsymbol{z}' + \ell\cdot \lambda\cdot \boldsymbol{a}\). It is routine to check that \(p(\boldsymbol{z}'') \xrightarrow{\theta_3^\ell} p(\boldsymbol{z})\). Thus, we conclude that \(s \xrightarrow{\sigma\rho\theta_3^\ell} p(\boldsymbol{z})\) and \[\begin{align} \min \mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V, s, p(\boldsymbol{z})) &\le |\sigma| + |\rho| + \ell\cdot |\theta_3|\\ &\le 3\cdot \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,p(\boldsymbol{z}))^{66m^5k^2}\\ &\le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,p(\boldsymbol{z}))^{68m^5k^2}. \end{align}\] ◻
Proof. It is clear that \(s'\xrightarrow{*} t'\) in \(V'\). Note that \(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V',s',t') \le 3L_k(M) + 10 \le 13 L_k(M)\), and \(\min \mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V, s, t) \le L_k(M) = \min \mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V',s',t')\). ◻
Proof. The size bound is already given in 7 . Let \(\rho\) be the shortest run from \(s'\) to \(t'\) in \(V'\). The self-loops defined by the transitions in \(T_S\) can be moved to the front of the run in \(V_S\) while keeping the whole run valid, as their effects are non-negative. So \(\rho\) can be rearranged into \(s' \xrightarrow{\rho_1} q(\boldsymbol{z})\xrightarrow{\rho_2}t\), where \(\boldsymbol{z} \in \boldsymbol{b} + (P_1 \cup P_0)^*\) and \(\rho_2\) is also a run in \(V\). Let \(\boldsymbol{\lambda} \in \mathbb{N}^{n}\) be the vector such that \(\boldsymbol{\lambda}(i)\) is the number of occurrences of the transition \((q,\boldsymbol{p}_i, q)\) in \(\rho_1\). Then we have \(\boldsymbol{z} - \sum_{i = 1}^n \boldsymbol{\lambda}(i) \cdot \boldsymbol{p}_i \in \boldsymbol{b} + P_0^*\) and \[\langle {\boldsymbol{c},\boldsymbol{\lambda}} \rangle \le \left\Vert{\boldsymbol{c}}\right\Vert \cdot \sum_{i=1}^n \boldsymbol{\lambda}(i) \le \left\Vert{\boldsymbol{c}}\right\Vert \cdot |\rho_1| \le \left\Vert{\boldsymbol{c}}\right\Vert \cdot |\rho| = \left\Vert{\boldsymbol{c}}\right\Vert \cdot \ell \le K,\] which implies that \(\boldsymbol{z} \in S\). We can also estimate the norm of \(\boldsymbol{z}\) by \[\left\Vert{\boldsymbol{z}}\right\Vert \le \left\Vert{t}\right\Vert + \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V) \cdot |\rho_2| \le M \cdot (1 + \ell) \le (M+\ell)^2.\] It follows from 6 that \(s\xrightarrow{\sigma} q(\boldsymbol{z})\) in \(V\) for some \(\sigma\) with \[|\sigma| \le g(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,q(\boldsymbol{z})))^{k^2} \le (M + 3 \cdot \left\Vert{\boldsymbol{z}}\right\Vert)^{mk^2} \le (M + \ell)^{4mk^2}.\] Note that \(s \xrightarrow{\sigma\rho_2} t\) in \(V\), and hence, the length bound is given by \[\begin{align} \min \mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V, s, t) &\le |\sigma| + |\rho_2|\le 2\cdot (M + \ell)^{4mk^2} \le (M + \ell)^{6mk^2} \le R(M+\ell). \end{align}\] The claim is proved. ◻
Proof. Clearly, \((V',s',t')\) is diagonal and \(s' \xrightarrow{*} q(\boldsymbol{y}) \xrightarrow{*} t'\) in \(V'\), given that \(\boldsymbol{\delta} \in P_0\). Recall that \(R(x)=x^{21mk^2}\). The size bound is derived as follows. \[\begin{align} \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V',s',t') &\le M + 3\cdot\left\Vert{\boldsymbol{w}}\right\Vert + 3 \cdot(M + |T_{\boldsymbol{w}}|) \cdot (\left\Vert{T}\right\Vert+\left\Vert{T_{\boldsymbol{w}}}\right\Vert + 1)\\ &\le M + 6\cdot L_k(M)^{14mk^2} + 81 \cdot M^{4mk^2}\\ &\le 88L_k(M)^{14mk^2}\\ &\le R(L_k(M)). \end{align}\] We can similarly rearrange the shortest run \(\rho\) from \(s'\) to \(t'\) into a run \(s' \xrightarrow{\rho_1} q(\boldsymbol{z})\xrightarrow{\rho_2}t'\), where \(\boldsymbol{z} \in \boldsymbol{w} + P_0^* \subseteq S\) and \(\rho_2\) is also a run from \(q(\boldsymbol{z})\) to \(t\) in \(V\). We can also estimate the norm of \(\boldsymbol{z}\) by \[\left\Vert{\boldsymbol{z}}\right\Vert \le \left\Vert{t}\right\Vert + \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V) \cdot |\rho_2|\le (M + |\rho|)^2.\] It follows from 6 that \(s\xrightarrow{\sigma} q(\boldsymbol{z})\) in \(V\) for some \(\sigma\) with \[|\sigma| \le g(\mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,q(\boldsymbol{z})))^{k^2} \le \left(M +3 \cdot \left\Vert{\boldsymbol{z}}\right\Vert\right)^{mk^2} \le (M +|\rho|)^{4mk^2}.\] Note that \(s \xrightarrow{\sigma\rho_2} t\) in \(V\), and consequently, \[\min \mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V, s, t) \le |\sigma| + |\rho_2| \le (M +|\rho|)^{6mk^2} \le R(M+|\rho|),\] where \(|\rho| = \min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V',s',t')\). ◻
Proof. Let \(U:= R(\left\Vert{\boldsymbol{x}}\right\Vert + 1 + |Q| \cdot \left\Vert{T}\right\Vert, M)\), where \(R\) is given by 6. If there is a run \(\pi\) starting from \(s\) with \(\mathop{\operatorname{\mathrm{\mathrm{\small bd}}}}\nolimits(\pi, U) = \emptyset\), then by 6, there is a run \(s \xrightarrow{\rho} q(\boldsymbol{y})\) with \[\boldsymbol{y} \ge (\left\Vert{\boldsymbol{x}}\right\Vert + 1 + |Q| \cdot \left\Vert{T}\right\Vert) \cdot \boldsymbol{1} \ge \boldsymbol{x} + (1 + |Q| \cdot \left\Vert{T}\right\Vert)\cdot\boldsymbol{1}.\] Choose any simple path \(\sigma\) from \(q\) back to \(p\), and we have \(s \xrightarrow{\rho\sigma} p(\boldsymbol{y}')\), where \[\boldsymbol{y}':= \boldsymbol{y} + \mathop{\operatorname{\mathrm{\mathrm{\small eff}}}}\nolimits(\sigma) \ge \boldsymbol{x} + (1 + |Q| \cdot \left\Vert{T}\right\Vert)\cdot\boldsymbol{1} - |\sigma|\cdot \left\Vert{T}\right\Vert\cdot \boldsymbol{1} \ge \boldsymbol{x} + \boldsymbol{1}.\] Therefore \(s\) is diagonal in \(V\). ◻
Proof. It remains to show that \(\min \mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t) \leq R(\ell + M)\). Assume that the shortest run in \((V',s',t')\) is given by \(s' \xrightarrow{\rho_1}p_2(\boldsymbol{z})\xrightarrow{\rho_2}t' = t\) where \(\rho_1\) contains only self-loops in \(T_S\) and \(\rho_2\) is a path of \(V\). Immediately, \(|\rho_1|+|\rho_2| = \ell\), which implies that \[\left\Vert{\boldsymbol{z}}\right\Vert \leq \left\Vert{t}\right\Vert + \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V) \cdot \ell\le (M + \ell)^2.\] Let \(\boldsymbol{\lambda} \in \mathbb{N}^{n}\) be the vector such that \(\boldsymbol{\lambda}(i)\) is the number of occurrences of the transition \((q,\boldsymbol{p}_i, q)\) in \(\rho_1\). Then we have \(\boldsymbol{z} - \sum_{i = 1}^n \boldsymbol{\lambda}(i) \cdot \boldsymbol{p}_i \in \boldsymbol{b} + P_0^*\) and \[\langle {\boldsymbol{c},\boldsymbol{\lambda}} \rangle \le \left\Vert{\boldsymbol{c}}\right\Vert \cdot \sum_{i=1}^n \boldsymbol{\lambda}(i) \le \left\Vert{\boldsymbol{c}}\right\Vert \cdot |\rho_1| \le \left\Vert{\boldsymbol{c}}\right\Vert \cdot \ell \le K,\] which justifies that \(\boldsymbol{z} \in S\). This also implies that \(s\xrightarrow{*}p_2(\boldsymbol{z})\) in \(V\). The length of the shortest path for \((V,s,t)\) is bounded by \[\begin{align} \min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,t) &\leq \min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,s,p_2(\boldsymbol{z})) + \min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V,p_2(\boldsymbol{z}),t) \\ &\leq \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,p_2(\boldsymbol{z}))^{3m^2} + \ell \\ &\leq (M + 3\cdot \left\Vert{\boldsymbol{z}}\right\Vert) ^ {3m^2} + \ell \\ &\leq (M + 3\cdot (M + \ell)^2) ^ {3m^2} + \ell \\ &\leq (M + \ell) ^{13m^2} \\ &\le R(M+\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V',s',t')), \end{align}\] bearing in mind that \(R(x)=x^{30m^2}\). ◻
Proof. Clearly, \((V',s',t')\) is a \((k{-}1)\)-component forward pumpable VASS with \(s' \xrightarrow{*} p_2(\boldsymbol{x}_2) \xrightarrow{\pi'} t'\) in \(V'\). The size bound is derived as follows. \[\begin{align} \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V',s',t') &\le M + 3\cdot\left\Vert{\boldsymbol{w}}\right\Vert + 3 \cdot(M + |T_{\boldsymbol{w}}|) \cdot (\left\Vert{T}\right\Vert+\left\Vert{T_{\boldsymbol{w}}}\right\Vert + 1)\\ &\le M + 6\cdot L_k(M)^{25m^2} + 81 \cdot M^{12m^2}\\ &\le 88\cdot L_k(M)^{25m^2}\\ &\le R(L_k(M)). \end{align}\] It is routine to rearrange the shortest run \(\rho\) from \(s'\) to \(t'\) into a run \(s' \xrightarrow{\rho_1} p_2(\boldsymbol{z})\xrightarrow{\rho_2}t'\), where \(\boldsymbol{z} \in \boldsymbol{w} + P_0^* \subseteq S\) and \(\rho_2\) is also a run from \(p_2(\boldsymbol{z})\) to \(t\) in \(V\). Notice that \[\left\Vert{\boldsymbol{z}}\right\Vert \le \left\Vert{t}\right\Vert + \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V) \cdot |\rho_2|\le (M + |\rho|)^2.\] Thus, by 8 , it follows that \(s\xrightarrow{\sigma} p_2(\boldsymbol{z})\) in \(V\) for some \(\sigma\) with \[|\sigma| \le \mathop{\operatorname{\mathrm{\mathrm{\small size}}}}\nolimits(V,s,q(\boldsymbol{z}))^{3m^2} \le \left(M +3 \cdot \left\Vert{\boldsymbol{z}}\right\Vert\right)^{3m^2} \le (M +|\rho|)^{12mk^2}.\] It follows from \(s \xrightarrow{\sigma\rho_2} t\) that \[\min \mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V, s, t) \le |\sigma| + |\rho_2| \le (M +|\rho|)^{14m^2} \le R(M+\min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V',s',t')),\] where \(|\rho| = \min\mathop{\operatorname{\mathrm{\mathrm{\small len}}}}\nolimits(V',s',t')\) by definition. ◻
BASICS, Shanghai Jiao Tong University, China, cwj2018@sjtu.edu.cn. ORCID: 0009-0007-2611-0338.↩︎
BASICS, Shanghai Jiao Tong University, China, fubo0970@sjtu.edu.cn. ORCID: 0009-0002-6513-8935.↩︎
Corresponding author. BASICS, Shanghai Jiao Tong University, China, fu-yx@cs.sjtu.edu.cn. ORCID: 0000-0001-6429-7550.↩︎
BASICS, Shanghai Jiao Tong University, China, longhuan@sjtu.edu.cn. ORCID: 0000-0002-1328-6197.↩︎
BASICS, Shanghai Jiao Tong University, China, xcf123@sjtu.edu.cn.↩︎
Shanghai Normal University, China, qzyang@shnu.edu.cn.↩︎
BASICS, Shanghai Jiao Tong University, China, wunschunreif@sjtu.edu.cn. ORCID: 0009-0000-1028-5458.↩︎