Simulation Over One-counter Nets is PSPACE-Complete
From MaRDI portal
Publication:2963939
DOI10.4230/LIPIcs.FSTTCS.2013.515zbMath1359.68223arXiv1310.6303MaRDI QIDQ2963939
Sławomir Lasota, Piotr Hofman, Patrick Totzke, Richard Mayr
Publication date: 21 February 2017
Full work available at URL: https://arxiv.org/abs/1310.6303
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Trace inclusion for one-counter nets revisited, Bisimulation equivalence and regularity for real-time one-counter automata, Trace Inclusion for One-Counter Nets Revisited
