Efficient Analysis of VASS Termination Complexity

DOI10.1145/3373718.3394751MaRDI QIDQ5145672zbMATH OpenOpenAlexWikidataFDO

Authors Jérôme Leroux, Dominik Velan, Antonin 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)

Cited in

(3)

• Asymptotic complexity estimates for probabilistic programs and their VASS abstractions
• Deciding Polynomial Termination Complexity for VASS Programs
• Fast termination and workflow nets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145672)