Simulation Problems Over One-Counter Nets
From MaRDI portal
Publication:2800968
DOI10.2168/LMCS-12(1:6)2016zbMath1448.68342arXiv1602.00476MaRDI QIDQ2800968
Sławomir Lasota, Patrick Totzke, Piotr Hofman, Richard Mayr
Publication date: 19 April 2016
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.00476
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
Unnamed Item, Unnamed Item, The Complexity of Flat Freeze LTL, Countdown games, and simulation on (succinct) one-counter nets, On history-deterministic one-counter nets, A generic framework for checking semantic equivalences between pushdown automata and finite-state automata