In this paper we present a symbolic implementation of a model checking algorithm for the verification of properties expressed in Resource-Bounded Alternating Time Temporal Logic (RB-ATL). The implementation is based on the model checker MCMAS. We evaluate the performance of our implementation using simple multi-agent model checking problems of increasing complexity
International audienceResource-aware logics to represent strategic abilities in multi-agent systems ...
Bounded Model Checking (BMC) has been recently introduced as an efficient verification method for r...
Model checking is a verification technique that performs an exhaustive search among the states of sa...
In this paper we present a symbolic implementation of a model checking algorithm for the verificati...
RB+-ATL is an extension of ATL where it is possible to model consumption and production of several r...
RB+-ATL is an extension of ATL where it is possible to model consumption and production of several r...
Abstract This paper deals with the problem of verification ofgame-like structures by means of symbol...
Several logics for expressing coalitional ability under resource bounds have been proposed and studi...
National audienceIn this work, we begin by providing a general overview of the model-checking result...
RB±ATL is an extension of ATL where it is possible to model consumption and production of several re...
This paper addresses the problem of verification of multiagent systems by means of symbolic model c...
It is often advantageous to be able to extract resource requirements in resource logics of strategic...
Alternating Time Temporal Logic (ATL) is widely used for the verification of multi-agent systems. We...
Abstract—In this paper we present a complete method for verifying properties expressed in the tempor...
Alternating-time temporal logic (ATL) is an extension of the branching-time temporal logic CTL, desi...
International audienceResource-aware logics to represent strategic abilities in multi-agent systems ...
Bounded Model Checking (BMC) has been recently introduced as an efficient verification method for r...
Model checking is a verification technique that performs an exhaustive search among the states of sa...
In this paper we present a symbolic implementation of a model checking algorithm for the verificati...
RB+-ATL is an extension of ATL where it is possible to model consumption and production of several r...
RB+-ATL is an extension of ATL where it is possible to model consumption and production of several r...
Abstract This paper deals with the problem of verification ofgame-like structures by means of symbol...
Several logics for expressing coalitional ability under resource bounds have been proposed and studi...
National audienceIn this work, we begin by providing a general overview of the model-checking result...
RB±ATL is an extension of ATL where it is possible to model consumption and production of several re...
This paper addresses the problem of verification of multiagent systems by means of symbolic model c...
It is often advantageous to be able to extract resource requirements in resource logics of strategic...
Alternating Time Temporal Logic (ATL) is widely used for the verification of multi-agent systems. We...
Abstract—In this paper we present a complete method for verifying properties expressed in the tempor...
Alternating-time temporal logic (ATL) is an extension of the branching-time temporal logic CTL, desi...
International audienceResource-aware logics to represent strategic abilities in multi-agent systems ...
Bounded Model Checking (BMC) has been recently introduced as an efficient verification method for r...
Model checking is a verification technique that performs an exhaustive search among the states of sa...