pdf-format: |
|
@InProceedings{ajdarow_et_al:LIPIcs.CONCUR.2021.30, author = {Ajdar\'{o}w, Michal and Ku\v{c}era, Anton{\'\i}n}, title = {{Deciding Polynomial Termination Complexity for VASS Programs}}, booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)}, pages = {30:1--30:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-203-7}, ISSN = {1868-8969}, year = {2021}, volume = {203}, editor = {Haddad, Serge and Varacca, Daniele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14407}, URN = {urn:nbn:de:0030-drops-144076}, doi = {10.4230/LIPIcs.CONCUR.2021.30}, annote = {Keywords: Termination complexity, vector addition systems} }
Keywords: | Termination complexity, vector addition systems | |
Seminar: | 32nd International Conference on Concurrency Theory (CONCUR 2021) | |
Issue date: | 2021 | |
Date of publication: | 13.08.2021 |