Alternating vector addition systems with states
DOI10.1007/978-3-662-44522-8_19zbMATH Open1425.68290OpenAlexW7162165MaRDI QIDQ2922017FDOQ2922017
Authors: Jean-Baptiste Courtois, Sylvain Schmitz 
Publication date: 14 October 2014
Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44522-8_19
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
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)
Cited In (10)
- Z-reachability problem for games on 2-dimensional vector addition systems with states is in P
- Round- and context-bounded control of dynamic pushdown systems
- The ideal view on Rackoff's coverability technique
- On the complexity of resource-bounded logics
- Long-Run Average Behavior of Vector Addition Systems with States
- Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time
- Nonelementary Complexities for Branching VASS, MELL, and Extensions
- On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension
- Strategic reasoning with a bounded number of resources: the quest for tractability
- State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems
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)
