2000 character limit reached
Simulation Problems Over One-Counter Nets (1602.00476v2)
Published 1 Feb 2016 in cs.LO
Abstract: 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.