Skip to Main content Skip to Navigation
Conference 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 :
Conference papers
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02483495
Contributor : Diego Figueira <>
Submitted on : Friday, July 17, 2020 - 3:48:44 PM
Last modification on : Monday, December 14, 2020 - 5:26:03 PM

File

main.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Wojciech Czerwiński, Diego Figueira, Piotr Hofman. Universality Problem for Unambiguous VASS. International Conference on Concurrency Theory (CONCUR), Sep 2020, Vienna, Austria. pp.36:1-36:15, ⟨10.4230/LIPIcs.CONCUR.2020.36⟩. ⟨hal-02483495v3⟩

Share

Metrics

Record views

17

Files downloads

57