License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2013.515
URN: urn:nbn:de:0030-drops-43970
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2013/4397/
Hofman, Piotr ;
Lasota, Slawomir ;
Mayr, Richard ;
Totzke, Patrick
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.
BibTeX - Entry
@InProceedings{hofman_et_al:LIPIcs:2013:4397,
author = {Piotr Hofman and Slawomir Lasota and Richard Mayr and Patrick Totzke},
title = {{Simulation Over One-counter Nets is PSPACE-Complete}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)},
pages = {515--526},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-64-4},
ISSN = {1868-8969},
year = {2013},
volume = {24},
editor = {Anil Seth and Nisheeth K. Vishnoi},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4397},
URN = {urn:nbn:de:0030-drops-43970},
doi = {10.4230/LIPIcs.FSTTCS.2013.515},
annote = {Keywords: Simulation preorder; one-counter nets; complexity}
}
|
Keywords: |
|
Simulation preorder; one-counter nets; complexity |
|
Collection: |
|
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013) |
|
Issue Date: |
|
2013 |
|
Date of publication: |
|
10.12.2013 |
