Alternating Vector Addition Systems with States - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Alternating Vector Addition Systems with States


Alternating vector addition systems are obtained by equipping vector addition systems with states (VASS) with 'fork' rules, and provide a natural setting for infinite-arena games played over a VASS. Initially introduced in the study of propositional linear logic, they have more recently gathered attention in the guise of multi-dimensional energy games for quantitative verification and synthesis. We show that establishing who is the winner in such a game with a state reachability objective is 2-ExpTime-complete. As a further application, we show that the same complexity result applies to the problem of whether a VASS is simulated by a finite-state system.
Fichier principal
Vignette du fichier
article.pdf (553.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00980878 , version 1 (22-04-2014)
hal-00980878 , version 2 (30-06-2014)



Jean-Baptiste Courtois, Sylvain Schmitz. Alternating Vector Addition Systems with States. 39th International Symposium on Mathematical Foundations of Computer Science, Aug 2014, Budapest, Bulgaria. pp.220--231, ⟨10.1007/978-3-662-44522-8_19⟩. ⟨hal-00980878v2⟩
412 View
583 Download



Gmail Facebook X LinkedIn More