Model checking coalitional games in shortage resource scenarios

07/17/2013
by   Dario Della Monica, et al.
0

Verification of multi-agents systems (MAS) has been recently studied taking into account the need of expressing resource bounds. Several logics for specifying properties of MAS have been presented in quite a variety of scenarios with bounded resources. In this paper, we study a different formalism, called Priced Resource-Bounded Alternating-time Temporal Logic (PRBATL), whose main novelty consists in moving the notion of resources from a syntactic level (part of the formula) to a semantic one (part of the model). This allows us to track the evolution of the resource availability along the computations and provides us with a formalisms capable to model a number of real-world scenarios. Two relevant aspects are the notion of global availability of the resources on the market, that are shared by the agents, and the notion of price of resources, depending on their availability. In a previous work of ours, an initial step towards this new formalism was introduced, along with an EXPTIME algorithm for the model checking problem. In this paper we better analyze the features of the proposed formalism, also in comparison with previous approaches. The main technical contribution is the proof of the EXPTIME-hardness of the the model checking problem for PRBATL, based on a reduction from the acceptance problem for Linearly-Bounded Alternating Turing Machines. In particular, since the problem has multiple parameters, we show two fixed-parameter reductions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/24/2018

Resource Logics with a Diminishing Resource

Model-checking resource logics with production and consumption of resour...
research
10/07/2020

Linear-time Temporal Logic with Team Semantics: Expressivity and Complexity

We study the expressivity and the model checking problem of linear tempo...
research
09/13/2022

Bounded Model Checking for Unbounded Client Server Systems

Bounded model checking (BMC) is an efficient formal verification techniq...
research
09/06/2017

Model Checking for Fragments of Halpern and Shoham's Interval Temporal Logic Based on Track Representatives

Model checking allows one to automatically verify a specification of the...
research
10/24/2017

Deadlock and Termination Detection using IMDS Formalism and Model Checking. Version 2

Modern model checking techniques concentrate on global properties of ver...
research
05/21/2019

Behavioural Preorders on Stochastic Systems - Logical, Topological, and Computational Aspects

Computer systems can be found everywhere: in space, in our homes, in our...
research
05/04/2015

Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: a Singly-Exponential Time DC-Checking

Conditional Simple Temporal Network (CSTN) is a constraint-based graph-f...

Please sign up or login with your details

Forgot password? Click here to reset