Advertisement
Published in:
2014 | OriginalPaper | Chapter
Alternating Vector Addition Systems with States
Authors : Jean-Baptiste Courtois, Sylvain Schmitz
Published in: Mathematical Foundations of Computer Science 2014
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.