N. Alechina, N. Bulling, S. Demri, and B. Logan, On the complexity of resourcebounded logics, Theoretical Computer Science, vol.750, pp.69-100, 2018.

N. Alechina, N. Bulling, B. Logan, and H. N. Nguyen, On the boundary of (un)decidability : Decidable model-checking for a fragment of resource agent logic, IJCAI'15, pp.1494-1501, 2015.

N. Alechina, N. Bulling, B. Logan, and H. N. Nguyen, The virtues of idleness : A decidable fragment of resource agent logic, Artificial Intelligence, vol.245, pp.56-85, 2017.

S. Almagor, N. Cohen, G. Pérez, M. Shirmohammadi, and J. Worrell, Coverability in 1-VASS with disequality tests, 2019.

L. Adag-+-01]-r.-alur, R. De-alfaro, T. Grosu, A. Henzinger, M. Thomas et al., jMocha : A model checking tool that exploits design structure, Proceedings of the 23rd International Conference on Software Engineering (ICSE01), pp.835-836, 2001.

M. , F. Atig, and P. Habermehl, On Yen's path logic for Petri nets, RP'09, vol.5797, pp.51-63, 2009.

R. Alur, T. A. Henzinger, and O. Kupferman, Alternating-time temporal logic, Journal of the ACM, vol.49, issue.5, pp.672-713, 2002.

N. Alechina and B. Logan, Resource logics with a diminishing resource, International Foundation for Autonomous Agents and Multiagent Systems, pp.1847-1849, 2018.

B. Aln-+-15]-n.-alechina, H. N. Logan, F. Nguyen, L. Raimondi, and . Mostarda, Symbolic modelchecking for resource-bounded atl, AAMAS'15, pages 1809-1810. International Foundation for Autonomous Agents and Multiagent Systems, 2015.

N. Alechina, B. Logan, H. N. Nguyen, and F. Raimondi, Decidable model-checking for a resource logic with production of resources, ECAI'14, pp.9-14, 2014.

N. Alechina, B. Logan, H. N. Nguyen, and F. Raimondi, Model-checking for resourcebounded ATL with production and consumption of resources, Journal of Computer and System Sciences, vol.88, pp.126-144, 2017.

N. Bulling and B. Farwer, Expressing properties of resource-bounded systems : The logics RBTL * and RBTL, Lecture Notes in Computer Science, vol.6214, pp.22-45, 2009.

N. Bulling and B. Farwer, On the (Un-)Decidability of Model-Checking Resource-Bounded Agents, ECAI'10, pp.567-572, 2010.

]. M. +-15, A. Blondin, S. Finkel, C. Göller, P. Haase et al., Reachability in twodimensional vector addition systems with states is PSPACE-complete, LICS'15, pp.32-43, 2015.

M. Blockelet and S. Schmitz, Modelchecking coverability graphs of vector addition systems, MFCS'11, vol.6907, pp.108-119, 2011.

K. Chatterjee, T. Henzinger, and N. , Piterman. Strategy logic, CONCUR'07, pp.59-73, 2007.

]. W. Cll-+-18, S. Czerwinski, R. Lasota, J. Lazi?, F. Leroux et al., The Reachability Problem for Petri Nets is Not Elementary, 2018.

P. Cermák, A. Lomuscio, F. Mogavero, and A. Murano, MCMAS-SLK : A model checker for the verification of strategy logic specifications, CAV'14, vol.8559, pp.525-532, 2014.

J. B. 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

S. Demri, On selective unboundedness of VASS, Journal of Computer and System Sciences, vol.79, issue.5, pp.689-713, 2013.

S. Demri, V. Goranko, and M. Lange, Temporal Logics in Computer Science, 2016.

]. D. +-17, R. Figueira, J. Lazi?, F. Leroux, G. Mazowiecki et al., Polynomial-space completeness of reachability for succinct branching VASS in dimension one, 14. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, vol.119, pp.1-119, 2017.

. St, C. Göller, R. Haase, P. Lazic, and . Totzke, A polynomial-time algorithm for reachability in branching VASS in dimension one, -105 :13. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, vol.55, 2016.

P. Jan?ar and Z. Sawa, A note on emptiness for alternating finite automata with a oneletter alphabet, Information Processing Letters, vol.104, issue.5, pp.164-167, 2007.

M. Richard, R. E. Karp, and . Miller, Parallel program schemata, Journal of Computer and System Sciences, vol.3, issue.2, pp.147-195, 1969.

M. Kacprzak, W. Nabialek, A. Niewiadomski, W. Penczek, A. Pólrola et al., Verics 2007 -a model checker for knowledge and real-time, Fundamenta Informaticae, vol.85, issue.1, pp.313-328, 2008.

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

F. Laroussinie and N. Markey, Augmenting atl with strategy contexts. Information and Computation, pp.98-123, 2015.

F. Laroussinie, N. Markey, and G. Oreiby, On the expressiveness and complexity of ATL, Logical Methods in Computer Science, vol.4, issue.2, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01194605

A. Lomuscio, H. Qu, and F. Raimondi, MCMAS : A model checker for the verification of multi-agent systems. Software Tools for Technology Transfer, 2015.

F. Mogavero, A. Murano, G. Perelli, and M. Y. Vardi, Reasoning about strategies : On the model-checking problem, ACM Transactions on Computational Logic, vol.15, issue.4, 2014.

M. Pauly, A modal logic for coalitional power in games, Journal of Logic and Computation, vol.12, issue.1, pp.149-166, 2002.

D. J. Pym, P. W. O'hearn, and H. Yang, Possible worlds and resources : the semantics of BI, Theoretical Computer Science, vol.315, issue.1, pp.257-305, 2004.

C. Rackoff, The covering and boundedness problems for vector addition systems, Theoretical Computer Science, vol.6, issue.2, pp.223-231, 1978.

L. Rosier and H. Yen, A multiparameter analysis of the boundedness problem for vector addition systems, Journal of Computer and System Sciences, vol.32, pp.105-135, 1986.

. Ph and . Schnoebelen, The complexity of temporal logic model checking, AIML'02, pp.437-459, 2003.

S. Schmitz, The complexity of reachability in vector addition systems, SIGLOG News, vol.3, issue.1, pp.4-21, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01275972