Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS

DOI10.1145/3209108.3209191zbMath1497.68328arXiv1804.10985OpenAlexW2962849754MaRDI QIDQ5145291

Petr Novotný, Florian Zuleger, Tomáš Brázdil, Krishnendu Chatterjee, Dominik Velan, Antonín Kučera

Publication date: 20 January 2021

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

Full work available at URL: https://arxiv.org/abs/1804.10985

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

ATLAS: automated amortised complexity analysis of self-adjusting data structures ⋮ The polynomial complexity of vector addition systems with states ⋮ Deciding Fast Termination for Probabilistic VASS with Nondeterminism ⋮ Long-Run Average Behavior of Vector Addition Systems with States ⋮ Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States ⋮ Type-based analysis of logarithmic amortised complexity

This page was built for publication: Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS