文章基本信息
- 标题：The Covering and Boundedness Problems for Branching Vector Addition Systems
- 本地全文：下载
- 作者：St{\'e}phane Demri ; Marcin Jurdzinski ; Oded Lachish 等
- 期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
- 电子版ISSN：1868-8969
- 出版年度：2009
- 卷号：4
- 页码：181-192
- DOI：10.4230/LIPIcs.FSTTCS.2009.2317
- 出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
- 摘要：The covering and boundedness problems for branching vector addition systems are shown complete for doubly-exponential time.
- 关键词：Vector addition systems; Petri nets; covering; boundedness; computational complexity
