Algorithmic Analysis of Termination and Counter Complexity in Vector Addition Systems with States: A Survey of Recent Results
| Authors | |
|---|---|
| Year of publication | 2021 |
| Type | Article in Periodical |
| Magazine / Source | ACM SIGLOG News |
| MU Faculty or unit | |
| Citation | |
| Web | ACM Digital Library |
| Doi | http://dx.doi.org/10.1145/3527372.3527374 |
| Keywords | VASS; termination complexity |
| Description | We give an overview of recently established results about the effective asymptotic analysis of termination and counter complexity of VASS computations. In contrast to ``classical'' problems such as reachability, boundedness, liveness, coverability, etc., that are EXPSPACE-hard, the decision problems related to VASS asymptotic analysis tend to have low complexity and many important variants are even decidable in polynomial time. We also present selected concepts and techniques used to achieve these results. |
| Related projects: |