Skip to Main content Skip to Navigation
Journal articles

Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States

Abstract : The boundedness problem is a well-known exponential-space complete problem for vector addition systems with states (or Petri nets); it asks if the reachability set (for a given initial configuration) is finite. Here we consider a dual problem, the co-finiteness problem that asks if the complement of the reachability set is finite; by restricting the question we get the co-emptiness (or universality) problem that asks if all configurations are reachable. We show that both the co-finiteness problem and the co-emptiness problem are exponential-space complete. While the lower bounds are obtained by a straightforward reduction from coverability, getting the upper bounds is more involved; in particular we use the bounds derived for reversible reachability by Leroux (2013). The studied problems were motivated by a result for structural liveness of Petri nets; this problem was shown decidable by Jančar (2017), without clarifying its complexity. The structural liveness problem is tightly related to a generalization of the co-emptiness problem, where the sets of initial configurations are (possibly infinite) downward closed sets instead of just singletons. We formulate the problems even more generally, for semilinear sets of initial configurations; in this case we show that the co-emptiness problem is decidable (without giving an upper complexity bound), and we formulate a conjecture under which the co-finiteness problem is also decidable.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-02390597
Contributor : Jérôme Leroux <>
Submitted on : Monday, November 30, 2020 - 2:55:39 PM
Last modification on : Tuesday, December 8, 2020 - 10:00:03 AM
Long-term archiving on: : Monday, March 1, 2021 - 7:20:27 PM

File

JancarLerouxSutre-FI-2019.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Petr Jančar, Jérôme Leroux, Grégoire Sutre. Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2019, 169 (1-2), pp.123-150. ⟨10.3233/FI-2019-1841⟩. ⟨hal-02390597⟩

Share

Metrics

Record views

96

Files downloads

23