Decidability of Weak Simulation on One-Counter Nets

DOI10.1109/LICS.2013.26zbMath1366.68206arXiv1304.4104MaRDI QIDQ5271057

Piotr Hofman, Patrick Totzke, Richard Mayr

Publication date: 3 July 2017

Published in: 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.4104

zbMATH Keywords

automata theoryone-counter machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Trace Inclusion for One-Counter Nets Revisited ⋮ Trace inclusion for one-counter nets revisited ⋮ On history-deterministic one-counter nets ⋮ Shortest Paths in One-Counter Systems

This page was built for publication: Decidability of Weak Simulation on One-Counter Nets