Simulation over one-counter nets is PSPACE-complete

Hofman, P, Lasota, S, Mayr, R and Totzke, P ORCID: 0000-0001-5274-8190 (2013) Simulation over one-counter nets is PSPACE-complete. .

Text HLMT2013.pdf - Author Accepted Manuscript Download (565kB)

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.

Item Type:	Conference or Workshop Item (Unspecified)
Additional Information:	timestamp: Thu, 23 Aug 2018 01:00:00 +0200 biburl: https://dblp.org/rec/bib/conf/fsttcs/HofmanLMT13 bibsource: dblp computer science bibliography, https://dblp.org
Depositing User:	Symplectic Admin
Date Deposited:	09 Jan 2019 10:10
Last Modified:	28 Oct 2023 10:01
DOI:	10.4230/LIPIcs.FSTTCS.2013.515
Related URLs:	Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3031033