@InProceedings{clemente_et_al:LIPIcs.STACS.2017.24, author = {Clemente, Lorenzo and Czerwinski, Wojciech and Lasota, Slawomir and Paperman, Charles}, title = {{Separability of Reachability Sets of Vector Addition Systems}}, booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)}, pages = {24:1--24:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-028-6}, ISSN = {1868-8969}, year = {2017}, volume = {66}, editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.24}, URN = {urn:nbn:de:0030-drops-70091}, doi = {10.4230/LIPIcs.STACS.2017.24}, annote = {Keywords: separability, Petri nets, modular sets, unary sets, decidability} }