2026-07-21T18:48:29Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4397 2024-03-06T10:35:01Z ddc:004 open_access

Simulation Over One-counter Nets is PSPACE-Complete Hofman, Piotr Lasota, Slawomir Mayr, Richard Totzke, Patrick Simulation preorder; one-counter nets; complexity 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Piotr Hofman and Slawomir Lasota and Richard Mayr and Patrick Totzke 2013 Is Part Of LIPIcs, Volume 24, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2013.515 urn:nbn:de:0030-drops-43970 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.515 eng https://creativecommons.org/licenses/by/3.0/legalcode