Alternating vector addition systems with states
From MaRDI portal
Publication:2922017
Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
- Reachability games on extended vector addition systems with states
- Solving parity games on integer vectors
- Z-reachability problem for games on 2-dimensional vector addition systems with states is in P
- Z-reachability problem for games on 2-dimensional vector addition systems with states is in P
- Polynomial vector addition systems with states
Cited in
(13)- State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems
- Z-reachability problem for games on 2-dimensional vector addition systems with states is in P
- The ideal view on Rackoff's coverability technique
- Round- and context-bounded control of dynamic pushdown systems
- On the complexity of resource-bounded logics
- Long-Run Average Behavior of Vector Addition Systems with States
- Z-reachability problem for games on 2-dimensional vector addition systems with states is in P
- On the coverability problem for pushdown vector addition systems in one dimension
- Solving parity games on integer vectors
- On reachability-related games on vector addition systems with states
- Strategic reasoning with a bounded number of resources: the quest for tractability
- Concurrent games on VASS with inhibition
- Fixed-dimensional energy games are in pseudo-polynomial time
This page was built for publication: Alternating vector addition systems with states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2922017)
