Alternating Time Temporal Logic (ATL) is widely used for the verification of multi-agent systems. We consider Resource Agent Logic (RAL), which extends ATL to allow the verification of properties of systems where agents act under resource constraints. The model checking problem for RAL with unbounded production and consumption of resources is known to be undecidable. We review existing (un)decidability results for fragments of RAL, tighten some existing undecidability results, and identify several aspects which affect decidability of model checking. One of these aspects is the availability of a ‘do nothing’, or idle action, which does not produce or consume resources. Analysis of undecidability results allows us to identify a significant ne...
The thesis presents logic-based formalisms for modelling and reasoning about resource-bounded multi-...
National audienceIn this work, we begin by providing a general overview of the model-checking result...
We revisit decidability results for resource-bounded logics and use decision problems on vector addi...
Alternating Time Temporal Logic (ATL) is widely used for the verification of multi-agent systems. We...
© 2017 The Authors Alternating Time Temporal Logic (ATL) is widely used for the verification of mult...
The model-checking problem for Resource Agent Logic is known to be undecidable. We review existing (...
Several logics for expressing coalitional ability under resource bounds have been proposed and studi...
Several logics for expressing coalitional ability under resource bounds have been proposed and studi...
Several logics for expressing coalitional ability under resource bounds have been proposed and studi...
Model-checking resource logics with production and consumption of resources is a computationally har...
The verification and modelling of multi-agent systems is an important topic that has attracted much ...
International audienceResource-aware logics to represent strategic abilities in multi-agent systems ...
Approaches to the verification of multi-agent systems are typically based on games or transition sys...
© 2015 The Author. Many problems in AI and multi-agent systems research are most naturally formulate...
Many problems in Multi-Agent Systems (MASs) research are formulated in terms of the abilities of a c...
The thesis presents logic-based formalisms for modelling and reasoning about resource-bounded multi-...
National audienceIn this work, we begin by providing a general overview of the model-checking result...
We revisit decidability results for resource-bounded logics and use decision problems on vector addi...
Alternating Time Temporal Logic (ATL) is widely used for the verification of multi-agent systems. We...
© 2017 The Authors Alternating Time Temporal Logic (ATL) is widely used for the verification of mult...
The model-checking problem for Resource Agent Logic is known to be undecidable. We review existing (...
Several logics for expressing coalitional ability under resource bounds have been proposed and studi...
Several logics for expressing coalitional ability under resource bounds have been proposed and studi...
Several logics for expressing coalitional ability under resource bounds have been proposed and studi...
Model-checking resource logics with production and consumption of resources is a computationally har...
The verification and modelling of multi-agent systems is an important topic that has attracted much ...
International audienceResource-aware logics to represent strategic abilities in multi-agent systems ...
Approaches to the verification of multi-agent systems are typically based on games or transition sys...
© 2015 The Author. Many problems in AI and multi-agent systems research are most naturally formulate...
Many problems in Multi-Agent Systems (MASs) research are formulated in terms of the abilities of a c...
The thesis presents logic-based formalisms for modelling and reasoning about resource-bounded multi-...
National audienceIn this work, we begin by providing a general overview of the model-checking result...
We revisit decidability results for resource-bounded logics and use decision problems on vector addi...