One-counter nets (OCN) are finite automata equipped with a counter that can store non-negative integer values, and that cannot be tested for zero. Equivalently, these are exactly 1-dimensional vector addition systems with states. We show that both strong and weak simulation preorder on OCN are PSPACE-complete.
Cite
@article{arxiv.1602.00476,
title = {Simulation Problems Over One-Counter Nets},
author = {Piotr Hofman and Slawomir Lasota and Richard Mayr and Patrick Totzke},
journal= {arXiv preprint arXiv:1602.00476},
year = {2017}
}