10.4230/LIPICS.FSTTCS.2009.2317
Demri, Stéphane
Stéphane
Demri
Jurdzinski, Marcin
Marcin
Jurdzinski
Lachish, Oded
Oded
Lachish
Lazic, Ranko
Ranko
Lazic
The Covering and Boundedness Problems for Branching Vector Addition Systems
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2009
Article
Vector addition systems
Petri nets
covering
boundedness
computational complexity
Kannan, Ravi
Ravi
Kannan
Kumar, K. Narayan
K. Narayan
Kumar
2009
2009-12-14
2009-12-14
2009-12-14
en
urn:nbn:de:0030-drops-23173
10.4230/LIPIcs.FSTTCS.2009
978-3-939897-13-2
1868-8969
10.4230/LIPIcs.FSTTCS.2009
LIPIcs, Volume 4, FSTTCS 2009
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
2013
4
16
181
192
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Kannan, Ravi
Ravi
Kannan
Kumar, K. Narayan
K. Narayan
Kumar
1868-8969
Leibniz International Proceedings in Informatics (LIPIcs)
2009
4
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
12 pages
122629 bytes
application/pdf
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
The covering and boundedness problems for
branching vector addition systems
are shown complete for doubly-exponential time.
LIPIcs, Vol. 4, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, pages 181-192