@inproceedings{LerouxSchmitz:LICS:2015,
Author = {Leroux, J. and Schmitz, S.},
BookTitle = {Proc. of LICS'15},
File = {8875a056 (0) - a - a - v.pdf},
ISSN = {1043-6871},
Keywords = {Petri nets;computational complexity;decidability;program verification;reachability analysis;Petri nets;VAS reachability;complexity upper bound;cubic Ackermann upper bound;decidability proof;decomposition algorithm;decomposition technique;natural embedding relation;quasiordering;termination complexity;vector addition systems;Algorithm design and analysis;Cognition;Complexity theory;Computer science;Finite element analysis;Petri nets;Upper bound;Vector addition system;fast-growing complexity;ideal;reachability;well quasi order},
Month = {July},
Pages = {56--67},
Title = {Demystifying Reachability in Vector Addition Systems},
Year = {2015},
bdsk-url-1 = {http://dx.doi.org/10.1109/LICS.2015.16},
date-added = {2017-04-06 15:49:35 +0000},
date-modified = {2018-04-19 12:06:20 +0000},
file-2 = {vassideals-lics15 (0) - a - a - v.pdf},
doi = {10.1109/LICS.2015.16}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A