Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2018.119
URN: urn:nbn:de:0030-drops-91235
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9123/
Czerwinski, Wojciech ; Hofman, Piotr ; Zetzsche, Georg
Unboundedness Problems for Languages of Vector Addition Systems
| pdf-format: |
|
Abstract
A vector addition system (VAS) with an initial and a final marking and transition labels induces a language. In part because the reachability problem in VAS remains far from being well-understood, it is difficult to devise decision procedures for such languages. This is especially true for checking properties that state the existence of infinitely many words of a particular shape. Informally, we call these unboundedness properties.We present a simple set of axioms for predicates that can express unboundedness properties. Our main result is that such a predicate is decidable for VAS languages as soon as it is decidable for regular languages. Among other results, this allows us to show decidability of (i) separability by bounded regular languages, (ii) unboundedness of occurring factors from a language K with mild conditions on K, and (iii) universality of the set of factors.
BibTeX - Entry
@InProceedings{czerwinski_et_al:LIPIcs:2018:9123,
author = {Wojciech Czerwinski and Piotr Hofman and Georg Zetzsche},
title = {{Unboundedness Problems for Languages of Vector Addition Systems}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {119:1--119:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-076-7},
ISSN = {1868-8969},
year = {2018},
volume = {107},
editor = {Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'a}niel Marx and Donald Sannella},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9123},
URN = {urn:nbn:de:0030-drops-91235},
doi = {10.4230/LIPIcs.ICALP.2018.119},
annote = {Keywords: vector addition systems, decision problems, unboundedness, separability}
}
| Keywords: | vector addition systems, decision problems, unboundedness, separability | |
| Seminar: | 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) | |
| Issue date: | 2018 | |
| Date of publication: | 04.07.2018 |
