License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2020.36
URN: urn:nbn:de:0030-drops-128486
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/12848/
Czerwiński, Wojciech ;
Figueira, Diego ;
Hofman, Piotr
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 VASSes (also known as One Counter Nets).
BibTeX - Entry
@InProceedings{czerwiski_et_al:LIPIcs:2020:12848,
author = {Wojciech Czerwiński and Diego Figueira and Piotr Hofman},
title = {{Universality Problem for Unambiguous VASS}},
booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)},
pages = {36:1--36:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-160-3},
ISSN = {1868-8969},
year = {2020},
volume = {171},
editor = {Igor Konnov and Laura Kov{\'a}cs},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12848},
URN = {urn:nbn:de:0030-drops-128486},
doi = {10.4230/LIPIcs.CONCUR.2020.36},
annote = {Keywords: unambiguity, vector addition systems, universality problems}
}
Keywords: |
|
unambiguity, vector addition systems, universality problems |
Collection: |
|
31st International Conference on Concurrency Theory (CONCUR 2020) |
Issue Date: |
|
2020 |
Date of publication: |
|
26.08.2020 |