@inproceedings{95f42e94fc6c4df6b2c39a2ee163f295,
title = "Simulation Over One-counter Nets is PSPACE-Complete",
abstract = "One-counter nets (OCN) are Petri nets with exactly one unbounded place. They are equivalent to a subclass of one-counter automata with just a weak test for zero. Unlike many other semantic equivalences, strong and weak simulation preorder are decidable for OCN, but the computational complexity was an open problem. We show that both strong and weak simulation preorder on OCN are Pspace-complete.",
author = "Piotr Hofman and Slawomir Lasota and Richard Mayr and Patrick Totzke",
year = "2013",
doi = "10.4230/LIPIcs.FSTTCS.2013.515",
language = "English",
isbn = "978-3-939897-64-4",
series = "Leibniz International Proceedings in Informatics (LIPIcs)",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany",
pages = "515--526",
booktitle = "IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, December 12-14, 2013, Guwahati, India",
}