@InProceedings{leroux:LIPIcs.FSTTCS.2019.47, author = {Leroux, J\'{e}r\^{o}me}, title = {{Distance Between Mutually Reachable Petri Net Configurations}}, booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)}, pages = {47:1--47:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-131-3}, ISSN = {1868-8969}, year = {2019}, volume = {150}, editor = {Chattopadhyay, Arkadev and Gastin, Paul}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.47}, URN = {urn:nbn:de:0030-drops-116094}, doi = {10.4230/LIPIcs.FSTTCS.2019.47}, annote = {Keywords: Petri nets, Vector addition systems, Formal verification, Reachability problem} }