Projects per year
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.
|Number of pages||46|
|Journal||Logical Methods in Computer Science|
|Publication status||Published - 14 Mar 2016|
- Simulation preorder; one-counter nets; complexity
FingerprintDive into the research topics of 'Simulation Problems Over One-Counter Nets'. Together they form a unique fingerprint.
- 1 Finished