Efficient Analysis of VASS Termination Complexity

DOI10.1145/3373718.3394751OpenAlexW3029036723MaRDI QIDQ5145672

Jérôme Leroux, Dominik Velan, Antonín Kučera

Publication date: 21 January 2021

Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3373718.3394751

zbMATH Keywords

terminationvector addition systems

Mathematics Subject Classification ID

Computer science (68-XX)

This page was built for publication: Efficient Analysis of VASS Termination Complexity