Simulation Problems Over One-Counter Nets
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- February 2016
- DOI:
- arXiv:
- arXiv:1602.00476
- Bibcode:
- 2016arXiv160200476H
- Keywords:
-
- Computer Science - Logic in Computer Science
- E-Print:
- Logical Methods in Computer Science, Volume 12, Issue 1 (March 14, 2016) lmcs:1629