On the complexity of resourcebounded logics, Theoretical Computer Science, vol.750, pp.69-100, 2018. ,
On the boundary of (un)decidability : Decidable model-checking for a fragment of resource agent logic, IJCAI'15, pp.1494-1501, 2015. ,
The virtues of idleness : A decidable fragment of resource agent logic, Artificial Intelligence, vol.245, pp.56-85, 2017. ,
, Coverability in 1-VASS with disequality tests, 2019.
jMocha : A model checking tool that exploits design structure, Proceedings of the 23rd International Conference on Software Engineering (ICSE01), pp.835-836, 2001. ,
On Yen's path logic for Petri nets, RP'09, vol.5797, pp.51-63, 2009. ,
Alternating-time temporal logic, Journal of the ACM, vol.49, issue.5, pp.672-713, 2002. ,
Resource logics with a diminishing resource, International Foundation for Autonomous Agents and Multiagent Systems, pp.1847-1849, 2018. ,
Symbolic modelchecking for resource-bounded atl, AAMAS'15, pages 1809-1810. International Foundation for Autonomous Agents and Multiagent Systems, 2015. ,
Decidable model-checking for a resource logic with production of resources, ECAI'14, pp.9-14, 2014. ,
Model-checking for resourcebounded ATL with production and consumption of resources, Journal of Computer and System Sciences, vol.88, pp.126-144, 2017. ,
Expressing properties of resource-bounded systems : The logics RBTL * and RBTL, Lecture Notes in Computer Science, vol.6214, pp.22-45, 2009. ,
On the (Un-)Decidability of Model-Checking Resource-Bounded Agents, ECAI'10, pp.567-572, 2010. ,
Reachability in twodimensional vector addition systems with states is PSPACE-complete, LICS'15, pp.32-43, 2015. ,
Modelchecking coverability graphs of vector addition systems, MFCS'11, vol.6907, pp.108-119, 2011. ,
Piterman. Strategy logic, CONCUR'07, pp.59-73, 2007. ,
The Reachability Problem for Petri Nets is Not Elementary, 2018. ,
MCMAS-SLK : A model checker for the verification of strategy logic specifications, CAV'14, vol.8559, pp.525-532, 2014. ,
Alternating vector addition systems with states, MFCS'14, vol.8634, pp.220-231, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00980878
On selective unboundedness of VASS, Journal of Computer and System Sciences, vol.79, issue.5, pp.689-713, 2013. ,
Temporal Logics in Computer Science, 2016. ,
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. ,
A polynomial-time algorithm for reachability in branching VASS in dimension one, -105 :13. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, vol.55, 2016. ,
A note on emptiness for alternating finite automata with a oneletter alphabet, Information Processing Letters, vol.104, issue.5, pp.164-167, 2007. ,
Parallel program schemata, Journal of Computer and System Sciences, vol.3, issue.2, pp.147-195, 1969. ,
Verics 2007 -a model checker for knowledge and real-time, Fundamenta Informaticae, vol.85, issue.1, pp.313-328, 2008. ,
The reachability problem requires exponential space, 1976. ,
Augmenting atl with strategy contexts. Information and Computation, pp.98-123, 2015. ,
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
MCMAS : A model checker for the verification of multi-agent systems. Software Tools for Technology Transfer, 2015. ,
Reasoning about strategies : On the model-checking problem, ACM Transactions on Computational Logic, vol.15, issue.4, 2014. ,
A modal logic for coalitional power in games, Journal of Logic and Computation, vol.12, issue.1, pp.149-166, 2002. ,
Possible worlds and resources : the semantics of BI, Theoretical Computer Science, vol.315, issue.1, pp.257-305, 2004. ,
The covering and boundedness problems for vector addition systems, Theoretical Computer Science, vol.6, issue.2, pp.223-231, 1978. ,
A multiparameter analysis of the boundedness problem for vector addition systems, Journal of Computer and System Sciences, vol.32, pp.105-135, 1986. ,
The complexity of temporal logic model checking, AIML'02, pp.437-459, 2003. ,
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