文章基本信息

标题：Simulation Problems Over One-Counter Nets
本地全文：下载
作者：Piotr Hofman ; Slawomir Lasota ; Richard Mayr 等
期刊名称：Logical Methods in Computer Science
印刷版ISSN：1860-5974
电子版ISSN：1860-5974
出版年度：2016
卷号：12
期号：1
页码：1
DOI：10.2168/LMCS-12(1:6)2016
出版社：Technical University of Braunschweig
摘要：One-counter nets (OCN) are finite automata equipped with a counter that can store non-negative integer values, and that cannot be tested for zero. Equivalently, these are exactly 1-dimensional vector addition systems with states. We show that both strong and weak simulation preorder on OCN are PSPACE-complete.
其他关键词：Simulation preorder; one-counter nets; complexity.