Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete (original) (raw)
Related papers
A decidability theorem for a class of vector-addition systems
Information Processing Letters, 1975
The equality problem for vector addition systems is undecidable
Theoretical Computer Science, 1976
The covering and boundedness problems for vector addition systems
Theoretical Computer Science, 1978
Place-boundedness for vector addition systems with one zero-test
FSTTCS, 2010
Mixing Coverability and Reachability to Analyze VASS with One Zero-Test
Lecture Notes in Computer Science, 2010
Model Checking Vector Addition Systems with one zero-test
Logical Methods in Computer Science, 2012
The reachability problem for ground TRS and some extensions
Lecture Notes in Computer Science, 1989
The context-freeness of the languages associated with vector addition systems is decidable
Theoretical Computer Science, 1992
Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems
ACM Transactions on Computational Logic
The equivalence of vector addition systems to a subclass of post canonical systems
Information Processing Letters, 1978
Reachability Problem for Weak Multi-Pushdown Automata
Logical Methods in Computer Science, 2013
Low dimensional hybrid systems – decidable, undecidable, donʼt know
Information and Computation, 2012
Reachability computation for linear hybrid systems
Gerardo Lafferriere, George Pappas
1999
A New Algorithm for Partitioned Symbolic Reachability Analysis
Electronic Notes in Theoretical Computer Science, 2008
Hyper-Ackermannian bounds for pushdown vector addition systems
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014
A Computatuional Analysis of the Reachability Problem for a Class of Hybrid Dynamical Systems
1996
2022
A New Class of Decidable Hybrid Systems
Lecture Notes in Computer Science, 1999
Complexity of reachability problems for finite discrete dynamical systems
Journal of Computer and System Sciences, 2006
A Computational Analysis of the Reachability Problem for a Class of Hybrid Dynamical Systems
1997
(Un)decidable Problems about Reachability of Quantum Systems
CONCUR 2014 – Concurrency Theory, 2014
Improved approximate reachability using auxiliary state variables
Proceedings 1999 Design Automation Conference (Cat. No. 99CH36361), 1999
Symbolic Reachability Computation for Families of Linear Vector Fields
Journal of Symbolic Computation, 2001
Geometric programming relaxations for linear system reachability
2004
Symbolic Reachability Analysis of High Dimensional Max-Plus Linear Systems
IFAC-PapersOnLine
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems
Lecture Notes in Computer Science, 2014
The Covering and Boundedness Problems for Branching Vector Addition Systems
2009
Algorithms for Computing Reachable Sets and Control Sets
IFAC Proceedings Volumes, 2001
Deciding reachability for planar multi-polynomial systems
Lecture Notes in Computer Science, 1996
Improving Reachability Analysis of Infinite State Systems by Specialization
Lecture Notes in Computer Science, 2011