Decidability of Weak Simulation on One-Counter Nets

@article{Hofman2013DecidabilityOW,
title={Decidability of Weak Simulation on One-Counter Nets},
author={Piotr Hofman and Richard Mayr and Patrick Totzke},
journal={2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science},
year={2013},
pages={203-212}
}

One-counter nets are Petri nets with exactly one unbounded place. They are equivalent to a subclass of one-counter automata with only a weak test for zero. We show that weak simulation preorder is decidable for OCN and that weak simulation approximants do not converge at level ω, but only at ω2. In contrast, other semantic relations like weak bisimulation are undecidable for OCN, and so are weak (and strong) trace inclusion.