Pages that link to "Item:Q4635789"
From MaRDI portal
The following pages link to Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete (Q4635789):
Displaying 26 items.
- Forward analysis and model checking for trace bounded WSTS (Q290914) (← links)
- The reachability problem for branching vector addition systems requires doubly-exponential space (Q407525) (← links)
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states (Q1096388) (← links)
- Completeness results for conflict-free vector replacement systems (Q1113674) (← links)
- Reachability problem for polynomial iteration is PSPACE-complete (Q1685792) (← links)
- Projections of vector addition system reachability sets are semilinear (Q1823697) (← links)
- On decidability and complexity of low-dimensional robot games (Q2009641) (← links)
- Strategic reasoning with a bounded number of resources: the quest for tractability (Q2238736) (← links)
- Trace inclusion for one-counter nets revisited (Q2636512) (← links)
- On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension (Q3449486) (← links)
- Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete (Q4635905) (← links)
- (Q4968382) (← links)
- (Q5009428) (← links)
- The Reachability Problem for Two-Dimensional Vector Addition Systems with States (Q5056423) (← links)
- Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States (Q5089288) (← links)
- (Q5089304) (← links)
- (Q5089314) (← links)
- (Q5089315) (← links)
- (Q5090970) (← links)
- (Q5092425) (← links)
- (Q5136335) (← links)
- The Complexity of Reachability in Affine Vector Addition Systems with States (Q5145633) (← links)
- (Q5875390) (← links)
- On the complexity of resource-bounded logics (Q5915568) (← links)
- Deterministic weighted automata under partial observability (Q6545582) (← links)
- Lower bounds for the reachability problem in fixed dimensional VASSes (Q6649473) (← links)
