PVASS Reachability is Decidable
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910025123889152 |
|---|---|
| author | Guttenberg, Roland Keskin, Eren Meyer, Roland |
| author_facet | Guttenberg, Roland Keskin, Eren Meyer, Roland |
| contents | Reachability in pushdown vector addition systems with states (PVASS) is among the longest standing open problems in Theoretical Computer Science. We show that the problem is decidable in full generality. Our decision procedure is similar in spirit to the KLMST algorithm for VASS reachability, but works over objects that support an elaborate form of procedure summarization as known from pushdown reachability. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_05015 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | PVASS Reachability is Decidable Guttenberg, Roland Keskin, Eren Meyer, Roland Logic in Computer Science Formal Languages and Automata Theory F.1.1 Reachability in pushdown vector addition systems with states (PVASS) is among the longest standing open problems in Theoretical Computer Science. We show that the problem is decidable in full generality. Our decision procedure is similar in spirit to the KLMST algorithm for VASS reachability, but works over objects that support an elaborate form of procedure summarization as known from pushdown reachability. |
| title | PVASS Reachability is Decidable |
| topic | Logic in Computer Science Formal Languages and Automata Theory F.1.1 |
| url | https://arxiv.org/abs/2504.05015 |