Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Universality Problem for Unambiguous VASS

Abstract : We study languages of unambiguous VASS, that is, Vector Addition Systems with States, whose transitions read letters from a finite alphabet, and whose acceptance condition is defined by a set of final states (i.e., the coverability language). We show that the problem of universality for unambiguous VASS is ExpSpace-complete, in sheer contrast to Ackermann-completeness for arbitrary VASS, even in dimension 1. When the dimension d is fixed, the universality problem is PSpace-complete if d ≥ 2, and coNP-hard for 1-dimensional VASS (also known as One Counter Nets).
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Diego Figueira <>
Submitted on : Tuesday, February 18, 2020 - 5:01:12 PM
Last modification on : Monday, December 14, 2020 - 5:26:03 PM


Files produced by the author(s)


  • HAL Id : hal-02483495, version 1


Wojciech Czerwiński, Diego Figueira, Piotr Hofman. Universality Problem for Unambiguous VASS. 2020. ⟨hal-02483495v1⟩



Record views


Files downloads