Informatics Report Series



Related Pages

Report (by Number) Index
Report (by Date) Index
Author Index
Institute Index

Title:Simulation Over One-counter Nets is PSPACE-Complete
Authors: Richard Mayr ; Piotr Hofman ; Slawomir Lasota ; Patrick Totzke
Date:Dec 2013
Publication Title:Foundations of Software Technology and Theoretical Computer Science (FST&TCS 2013)
Publication Type:Conference Paper Publication Status:Published
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.
Links To Paper
1st Link
Bibtex format
author = { Richard Mayr and Piotr Hofman and Slawomir Lasota and Patrick Totzke },
title = {Simulation Over One-counter Nets is PSPACE-Complete},
book title = {Foundations of Software Technology and Theoretical Computer Science (FST&TCS 2013)},
publisher = {LIPIcs},
year = 2013,
month = {Dec},
url = {},

Home : Publications : Report 

Please mail <> with any changes or corrections.
Unless explicitly stated otherwise, all material is copyright The University of Edinburgh