P. A. Abdulla, A. Bouajjani, and J. , Deciding Monotonic Games, CSL 2003, pp.1-14, 2003.
DOI : 10.1007/978-3-540-45220-1_1

P. A. Abdulla, R. Mayr, A. Sangnier, and J. Sproston, Solving Parity Games on Integer Vectors, Concur 2013, pp.106-120, 2013.
DOI : 10.1007/978-3-642-40184-8_9

P. A. Abdulla, M. F. Atig, P. Hofman, R. Mayr, K. N. Kumar et al., Infinite-state energy games, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, 2014.
DOI : 10.1145/2603088.2603100

B. Bérard, S. Haddad, M. Sassolas, and N. Sznajder, Concurrent Games on VASS with Inhibition, Concur 2012, pp.39-52, 2012.
DOI : 10.1007/978-3-642-32940-1_5

M. Blockelet and S. Schmitz, Model Checking Coverability Graphs of Vector Addition Systems, MFCS 2011, pp.108-119, 2011.
DOI : 10.1007/978-3-642-22993-0_13
URL : https://hal.archives-ouvertes.fr/hal-00600077

T. Brázdil, P. Jan?ar, and A. Ku?era, Reachability Games on Extended Vector Addition Systems with States, LNCS, vol.6199, pp.478-489, 2010.
DOI : 10.1007/978-3-642-14162-1_40

J. Chaloupka, Z-reachability problem for games on 2-dimensional vector addition systems with states is in P. Fund, Inform, vol.123, issue.1, pp.15-42

K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, Generalized mean-payoff and energy games, FSTTCS 2010, pp.505-516

K. Chatterjee, M. Randour, and J. Raskin, Strategy synthesis for multidimensional quantitative objectives, Concur 2012, pp.115-131, 2012.

S. Demri, M. Jurdzi´nskijurdzi´nski, O. Lachish, and R. Lazi´clazi´c, The covering and boundedness problems for branching vector addition systems, Journal of Computer and System Sciences, vol.79, issue.1, pp.23-38
DOI : 10.1016/j.jcss.2012.04.002

D. Figueira, S. Figueira, S. Schmitz, and P. Schnoebelen, Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma, 2011 IEEE 26th Annual Symposium on Logic in Computer Science, pp.269-278
DOI : 10.1109/LICS.2011.39

P. C. Fischer, A. R. Meyer, and A. L. Rosenberg, Counter machines and counter languages, Mathematical Systems Theory, vol.14, issue.3, pp.265-28310, 1968.
DOI : 10.1007/BF01694011

P. Hoffmann and P. Totzke, Trace Inclusion for One-Counter Nets Revisited, 2014.
DOI : 10.1007/978-3-319-11439-2_12

P. Jan?ar and F. Moller, Checking regular properties of Petri nets, Concur '95, pp.348-362, 1995.
DOI : 10.1007/3-540-60218-6_26

M. I. Kanovich, Petri nets, Horn programs, Linear Logic and vector games, Annals of Pure and Applied Logic, vol.75, issue.1-2, pp.107-13510, 1995.
DOI : 10.1016/0168-0072(94)00060-G
URL : http://doi.org/10.1016/0168-0072(94)00060-g

A. P. Kopylov, Decidability of Linear Affine Logic, Information and Computation, vol.164, issue.1, pp.173-198, 2001.
DOI : 10.1006/inco.1999.2834

A. Ku?era and R. Mayr, Simulation Preorder over Simple Process Algebras, Information and Computation, vol.173, issue.2, pp.184-198, 2002.
DOI : 10.1006/inco.2001.3122

]. S. Lasota, EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system, Information Processing Letters, vol.109, issue.15, pp.850-855, 2009.
DOI : 10.1016/j.ipl.2009.04.003

R. Lazi´clazi´c and S. Schmitz, Non-elementary complexities for branching VASS, MELL, and extensions, CSL-LICS 2014, 2014.

P. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar, Decision problems for propositional linear logic, Ann. Pure App. Logic, vol.56, issue.92, pp.1-3239, 1992.

R. Lipton, The reachability problem requires exponential space, 1976.

C. Rackoff, The covering and boundedness problems for vector addition systems, Theoretical Computer Science, vol.6, issue.2, pp.223-23110, 1978.
DOI : 10.1016/0304-3975(78)90036-1

J. Raskin, M. Samuelides, and L. V. Begin, Games for Counting Abstractions, AVoCS, pp.69-85, 2004.
DOI : 10.1016/j.entcs.2005.04.005
URL : https://hal.archives-ouvertes.fr/hal-00158701

L. Rosier and H. Yen, A multiparameter analysis of the boundedness problem for vector addition systems, Journal of Computer and System Sciences, vol.32, issue.1, pp.105-13510, 1986.
DOI : 10.1016/0022-0000(86)90006-1

A. Urquhart, The complexity of decision procedures in relevance logic II, The Journal of Symbolic Logic, vol.24, issue.04, pp.1774-180210, 1999.
DOI : 10.1145/322261.322271

H. Yen and C. Chen, On minimal elements of upward-closed sets, Theoretical Computer Science, vol.410, issue.24-25, pp.24-252442, 2009.
DOI : 10.1016/j.tcs.2009.02.036