P. A. Abdulla, A. Bouajjani, and J. Orso, Deciding monotonic games, CSL'03, volume 2803 of LNCS, pp.1-14, 2003.

P. A. Abdulla and G. Delzanno, Parameterized verification, Int. J. Softw. Tools Technol. Transf, vol.18, issue.5, pp.469-473, 2016.

P. A. Abdulla, R. Mayr, A. Sangnier, and J. Sproston, Solving parity games on integer vectors, CONCUR'13, vol.8052, pp.106-120, 2013.

B. Aminof, S. Jacobs, A. Khalimov, and S. Rubin, Parameterized model checking of token-passing systems, VMCAI'14, vol.8318, pp.262-281

. Springer, , 2014.

M. F. Atig, A. Bouajjani, K. N. Kumar, and P. Saivasan, Parity games on bounded phase multi-pushdown systems, NETYS'17, vol.10299, pp.272-287, 2017.

M. F. Atig, A. Bouajjani, and S. Qadeer, Context-bounded analysis for concurrent programs with dynamic creation of threads, Log. Methods Comput. Sci, vol.7, issue.4, 2011.

B. Bérard, S. Haddad, M. Sassolas, and N. Sznajder, Concurrent games on VASS with inhibition, CONCUR'12, vol.7454, pp.39-52, 2012.

H. Björklund and T. Schwentick, On notions of regularity for data languages, Theoretical Computer Science, vol.411, issue.4-5, pp.702-715, 2010.

M. Boja´nczykboja´nczyk, C. David, A. Muscholl, T. Schwentick, and L. Segoufin, Twovariable logic on data words, ACM Trans. Comput. Log, vol.12, issue.4, p.27, 2011.

T. Brázdil, P. Jancar, and A. Kucera, Reachability games on extended vector addition systems with states, ICALP'10, Part II, vol.6199, pp.478-489, 2010.

B. Brütsch and W. Thomas, Playing games in the Baire space, Proc. Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd Int. Workshop on Synthesis of Complex Parameters, vol.220, pp.13-25, 2016.

J. Courtois and S. Schmitz, Alternating vector addition systems with states, MFCS'14, vol.8634, pp.220-231, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00980878

E. A. Emerson and C. S. Jutla, Tree automata, mu-calculus and determinacy, Proceedings of FOCS'91, pp.368-377, 1991.

E. A. Emerson and K. S. Namjoshi, On reasoning about rings, Int. J. Found. Comput. S, vol.14, issue.4, pp.527-550, 2003.

J. Esparza, Keeping a crowd safe: On the complexity of parameterized verification, Leibniz-Zentrum für Informatik, vol.25, pp.1-10, 2014.

D. Figueira and M. Praveen, Playing with repetitions in data words using energy games, Proceedings of LICS'18, pp.404-413, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01715125

J. E. Hopcroft, R. Motwani, J. D. Rotwani, and . Ullman, Introduction to Automata Theory, Languages and Computability, 2000.

S. Jacobs and R. Bloem, Parameterized synthesis, Log. Methods Comput. Sci, vol.10, issue.1, 2014.

P. Jancar, On reachability-related games on vector addition systems with states, RP'15, vol.9328, pp.50-62, 2015.

A. Kara, Logics on data words: Expressivity, satisfiability, model checking, 2016.

D. Kozen, Lower bounds for natural proof systems, Proceedings of SFCS'77, pp.254-266, 1977.

S. L. Torre, P. Madhusudan, and G. Parlato, A robust class of context-sensitive languages, LICS'07, pp.161-170, 2007.

S. L. Torre, P. Madhusudan, and G. Parlato, Context-bounded analysis of concurrent queue systems, Proceedings of TACAS'08, vol.4963, pp.299-314, 2008.

S. L. Torre, P. Madhusudan, and G. Parlato, Model-checking parameterized concurrent programs using linear interfaces, CAV'10, vol.6174, pp.629-644, 2010.

S. L. Torre, P. Madhusudan, and G. Parlato, Model-checking parameterized concurrent programs using linear interfaces, 2010.

M. Lange and C. Stirling, Model checking games for branching time logics, J. Log. Comput, vol.12, issue.4, pp.623-639, 2002.

S. Qadeer and J. Rehof, Context-bounded model checking of concurrent software, TACAS'05, vol.3440, pp.93-107, 2005.

G. Ramalingam, Context-sensitive synchronization-sensitive analysis is undecidable, ACM Trans. Program. Lang. Syst, vol.22, issue.2, pp.416-430, 2000.

A. Seth, Games on multi-stack pushdown systems, LFCS'09, vol.5407, pp.395-408, 2009.

L. J. Stockmeyer, The Complexity of Decision Problems in Automata Theory and Logic

?. Guess,

. Guess,

. ?-(-?-;-?-{?, ? {x})) for ? ? {?, ?} 6. (? 1 ?? 2 , first) ? ? (? i , first) for ?, p.2

, ? ? (Win, (a, S)) if x ? S 8. (¬a(x), (b, S)) ? ? (Win, (b, S)) if x ? S and b = a

, 1, r) such that w, ? |= ?x.? , then by construction of f ? we have v k+1 = (c( ? , w, ? ), i + 1, r) and v k+2 = (c(? , w, ? ), 1, r + 1) for some 1 ? i ? n and ? = ? {x ? i}

, 1, r) such that w, ? |= ?x.? , then for some 1 ? i ? n (defined by f ) we have ? = ? {x ? i} such that v k+1 = (c( ? , w, ? ), i + 1, r) and v k+2 = (c(? , w, ? ), 1, r + 1). By definition since w, ? |= ?x

, 1, 2), we deduce that v n+2·|Var?| = (c(? , w, ?), 1, B) where ? has no quantifiers and w, ? |= ?

, 1, B) and w, ? |= ? 1 ? ? 2 then by definition of f ? , v k+1 = (c(? i , w, ?), 1, B) with i ? {1

, 1, B) and w, ? |= ? 1 ? ? 2 then for some i ? {1, 2} defined by f , v k+1 = (c(? i , w, ?), 1, B). By definition of satisfiability

, Using those two properties, we deduce that there exists m ? n + 2 · |Var ? |

, t = a(x): as w, ? |= t we know that a ?(x) = a, and v m = (c(t, w, ?), 1, B) so v m +1 = (c(Win, w, ?), ?(x) + 1, B)

, similarly, we have v m +1 = (c(Win, w, ?), ?(x) + 1, B)

, B) where ? = ? ?{{x ? ?(x)} | x ? Var ? }. Since ?(x) = ?(y), ? (y) = ?(y) > ?(x), we know that ?(x) < ?(y) so v m +1 = (c(Win-if-y, w, ? ), ?(x

=. ¬(x-&lt;-y, this case ?(y) ? ?(x) and we have v m +1 = (c(Win-if-x, w, ?), ?(y), B) and v m +2 = (c(Win, w, ?), ?(x), B)

, Every case ends in an accepting node, therefore ? is winning