Authors: Piotr Hofman ; Slawomir Lasota ; Richard Mayr ; Patrick Totzke
NULL##NULL##NULL##0000-0001-5274-8190
Piotr Hofman;Slawomir Lasota;Richard Mayr;Patrick Totzke
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.
Michael Blondin;Alain Finkel;Piotr Hofman;Filip Mazowiecki;Philip Offtermatt, Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, Soundness of reset workflow nets, pp. 1-14, 2024, Tallinn Estonia, 10.1145/3661814.3662086.
Pierre Ganty;Nicolas Manini;Francesco Ranzato, Lecture notes in computer science, Computing Reachable Simulations on Transition Systems, pp. 21-37, 2024, 10.1007/978-3-031-72621-7_3.