Abdur, Rakib

Nguyen, Hoang Nga

English

Many problems in Multi-Agent Systems (MASs) research are formulated in terms of the abilities of a coalition of agents. Existing approaches to reasoning about coalitional ability are usually focused on games or transition systems, which are described in terms of states and actions. Such approaches however often neglect a key feature of multi-agent systems, namely that the actions of the agents require resources. In this paper, we describe a logic for reasoning about coalitional ability under resource constraints in the probabilistic setting. We extend Resource-bounded Alternating-time Temporal Logic (RB-ATL) with probabilistic reasoning and provide a standard algorithm for the model-checking problem of the resulting logic Probabilistic resource-bounded ATL (pRB-ATL). We implement model-checking algorithms and present experimental results using simple multi-agent model-checking problems of increasing complexity

Coventry University Pure Portal

Formal Modelling and Verification of Probabilistic Resource Bounded Agents

https://pure.coventry.ac.uk/ws/files/78711248/s10849-023-09405-1.pdf

Formal Modelling and Verification of Probabilistic Resource Bounded Agents

Abstract

Similar works

Full text

Available Versions

Coventry University Pure Portal