Deciding Polynomial Termination Complexity for VASS Programs

DOI10.4230/LIPICS.CONCUR.2021.30arXiv2102.06889OpenAlexW3194409140MaRDI QIDQ6176114

Unnamed Author, Unnamed Author

Publication date: 21 August 2023

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

zbMATH Keywords

vector addition systemstermination complexity

Mathematics Subject Classification ID

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

This page was built for publication: Deciding Polynomial Termination Complexity for VASS Programs