Concurrency, Security, and Puzzles

Concurrency, Security, and Puzzles
复制标题

并发、安全和难题

DOI：
10.1007/978-3-319-51046-0_8
复制
发表时间：
2017
期刊：
--
影响因子：
--
通讯作者：
Lazic R
Lazic R
中科院分区：
--
文献类型：
--
作者：
Lazic R

文献摘要

相似文献

我们展示了Stockmeyer的尺度构造（也由Lipton发展为反自启动）如何被改编和扩展，以获得基于Petri网的两类突出系统的可复盖性问题的新下界：无序数据Petri网的ackermann -硬度和下推向量加系统的tower -硬度。
We show how the yardstick construction of Stockmeyer, also developed as counter bootstrapping by Lipton, can be adapted and extended to obtain new lower bounds for the coverability problem for two prominent classes of systems based on Petri nets:Ackermann-hardness for unordered data Petri nets, andTower-hardness for pushdown vector addition systems.