Communication Dans Un Congrès Année : 2020

Universality Problem for Unambiguous VASS

Résumé

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).

Fichier principal
Vignette du fichier
main.pdf (1.66 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-02483495 , version 1 (18-02-2020)
hal-02483495 , version 2 (19-05-2020)
hal-02483495 , version 3 (17-07-2020)

Licence

Identifiants

Citer

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⟩
289 Consultations
387 Téléchargements

Altmetric

Partager

  • More