Model-checking for resource-bounded ATL with production and consumption of resources

Alechina, Natasha and Logan, Brian and Nguyen, Hoang Nga and Raimondi, Franco (2017) Model-checking for resource-bounded ATL with production and consumption of resources. Journal of Computer and System Sciences . ISSN 1090-2724

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Available under Licence Creative Commons Attribution.
Download (1MB) | Preview

Abstract

Several logics for expressing coalitional ability under resource bounds have been proposed and studied in the literature. Previous work has shown that if only consumption of resources is considered or the total amount of resources produced or consumed on any path in the system is bounded, then the model-checking problem for several standard logics, such as Resource-Bounded Coalition Logic (RB-CL) and Resource-Bounded Alternating-Time Temporal Logic (RB-ATL) is decidable. However, for coalition logics with unbounded resource production and consumption, only some undecidability results are known. In this paper, we show that the modelchecking problem for RB-ATL with unbounded production and consumption of resources is decidable but EXPSPACE-hard. We also investigate some tractable cases and provide a detailed comparison to a variant of the resource logic RAL, together with new complexity results.

Item Type: Article
Keywords: model-checking, resources, coalitional ability, verification of multi-agent systems
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Identification Number: 10.1016/j.jcss.2017.03.008
Depositing User: Eprints, Support
Date Deposited: 26 Sep 2016 10:59
Last Modified: 14 Apr 2017 06:06
URI: http://eprints.nottingham.ac.uk/id/eprint/37147

Actions (Archive Staff Only)

Edit View Edit View