Paper: The Complexity of Reachability in Affine Vector Addition Systems with States (at LICS 2020)
Authors: Michael Blondin Mikhail A. Raskin
Abstract
No Abstract Available
BibTeX
@InProceedings{BlondinRaskin-TheComplexityofReac,
author = {Michael Blondin and Mikhail A. Raskin},
title = {The Complexity of Reachability in Affine Vector Addition Systems with States},
booktitle = {Proceedings of the Thirty fifth Annual IEEE Symposium on Logic in Computer Science (LICS 2020)},
year = {2020},
month = {July},
pages = {224--236},
location = {Saarbrucken, Germany},
publisher = {IEEE Computer Society Press}
}
