Parametrized Universality Problems for One-Counter Nets

9^th June 2020, 11:00
Patrick Totzke

Abstract

We study the language universality problem for One-Counter Nets, also known as 1-dimensional Vector Addition Systems with States (1-VASS), parameterized either with an initial counter value, or with an upper bound on the allowed counter value during runs. The language accepted by an OCN (defined by reaching a final control state) is monotone in both parameters. This yields two natural questions:
1. does there exist an initial counter value that makes the language universal?
2. does there exist a sufficiently high ceiling so that the bounded language is universal?

Despite the fact that unparameterized universality is Ackermann-complete and that these problems seem to reduce to checking basic structural properties of the underlying automaton, we show that in fact both problems are undecidable.

We also look into the complexities of the problems for several decidable subclasses, namely for unambiguous, and deterministic systems, and for those over a single-letter alphabet.

This is unpublished joint work with Shaull Almagor, Udi Boker, and Piotr Hofman.
I will (attempt to) give a "blackboard" talk instead of showing fancy slides.
A draft version can be found on the arXiv: http://arxiv.org/abs/2005.03435

Additional Materials

• http://arxiv.org/abs/2005.03435