Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets
- 6 September 2019
- book chapter
- Published by Springer Nature
- p. 193-201
Abstract
No abstract availableKeywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete2016
- Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete2015
- On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension2015
- Hyper-Ackermannian bounds for pushdown vector addition systems2014
- Decidability of Reachability Problems for Classes of Two Counters Automata2000
- Reset nets between decidability and undecidability1998
- On the reachability problem for 5-dimensional vector addition systemsTheoretical Computer Science, 1979
- Recursivite et cones rationnels fermes par intersectionCalcolo, 1978
- Approximating Petri Net Reachability Along Context-free Traces
- Parallel program schemataJournal of Computer and System Sciences, 1969