Simulation problems over one-counter nets

From MaRDI portal
Publication:2800968

DOI10.2168/LMCS-12(1:6)2016zbMATH Open1448.68342arXiv1602.00476MaRDI QIDQ2800968FDOQ2800968


Authors: Piotr Hofman, Sławomir Lasota, Patrick Totzke, Richard M. Mayr Edit this on Wikidata


Publication date: 19 April 2016

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1602.00476




Recommendations





Cited In (12)





This page was built for publication: Simulation problems over one-counter nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2800968)