Co-finiteness and Co-emptiness of Reachability Sets in Vector Addition Systems with States

The coverability and boundedness problems are well-known exponential-space complete problems for vector addition systems with states (or Petri nets). The boundedness problem 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.

[1]  S. Ginsburg,et al.  Semigroups, Presburger formulas, and languages. , 1966 .

[2]  Petr Jancar.  Deciding Structural Liveness of Petri Nets , 2017, SOFSEM.

[3]  Michel Hack,et al.  The Recursive Equivalence of the Reachability Problem and the Liveness Problem for Petri Nets and Vector Addition Systems , 1974, SWAT.

[4]  John E. Hopcroft,et al.  On the Reachability Problem for 5-Dimensional Vector Addition Systems , 1976, Theor. Comput. Sci..

[5]  Ernst W. Mayr.  An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[6]  Mohamed Faouzi Atig,et al.  On Yen's Path Logic for Petri Nets , 2009, Int. J. Found. Comput. Sci..

[7]  Hsu-Chun Yen,et al.  A Unified Approach for Deciding the Existence of Certain Petri Net Paths , 1992, Inf. Comput..

[8]  Jérôme Leroux,et al.  Presburger Vector Addition Systems , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[9]  Jérôme Leroux.  Vector Addition System Reversible Reachability Problem , 2013, Log. Methods Comput. Sci..

[10]  Sylvain Schmitz,et al.  Demystifying Reachability in Vector Addition Systems , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[11]  Javier Esparza,et al.  Existence of home states in Petri nets is decidable , 2016, Inf. Process. Lett..

[12]  Guillem Godoy,et al.  Decidable classes of tree automata mixing local and global constraints modulo flat theories , 2013 .

[13]  Charles Rackoff,et al.  The Covering and Boundedness Problems for Vector Addition Systems , 1978, Theor. Comput. Sci..

[14]  Javier Esparza,et al.  Decidability and Complexity of Petri Net Problems - An Introduction , 1996, Petri Nets.