@InProceedings{leroux_et_al:LIPIcs.CONCUR.2020.37,
author = {Leroux, J\'{e}r\^{o}me and Sutre, Gr\'{e}goire},
title = {{Reachability in Two-Dimensional Vector Addition Systems with States: One Test Is for Free}},
booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)},
pages = {37:1--37:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-160-3},
ISSN = {1868-8969},
year = {2020},
volume = {171},
editor = {Konnov, Igor and Kov\'{a}cs, Laura},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.37},
URN = {urn:nbn:de:0030-drops-128498},
doi = {10.4230/LIPIcs.CONCUR.2020.37},
annote = {Keywords: Counter machine, Vector addition system, Reachability problem, Formal verification, Infinite-state system}
}