An Abstraction-Based Method for Verifying Strategic Properties in Multi-Agent Systems with Imperfect Information

Belardinelli, Francesco; Lomuscio, Alessio; Malvone, Vadim

doi:10.1609/aaai.v33i01.33016030

Cited by 16 publications

(20 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Using the same model, strategic abilities in MAS with private data sharing (Belardinelli, F., Boureanu, I., et al ., 2019) and those under imperfect information (Belardinelli, F., Lumuscio, A., et al ., 2019) were verified. We propose to call the models exhibited above AIPs models with reference to the Agent Interaction Protocols.…”

Section: Modelling Mas Openness: State Of the Artmentioning

confidence: 89%

A generic model for representing openness in multi-agent systems

Hattab¹,

Chaari²

2021

The Knowledge Engineering Review

View full text Add to dashboard Cite

Openness is a challenging property that may characterize multi-agent systems (MAS). It refers to their ability to deal with entities leaving and joining agent society over time. This property makes the MAS behaviour complex and difficult to study and analyze, hence the need for a representative model allowing its understanding. In this context, many models were defined in the literature and we propose to classify them into three categories: structural models, functional models and interactional models. The existing models were proposed either for representing structural openness or for modelling functional or interactional ones independently. But, none of them was oriented to represent MAS openness in a global way while considering its three aspects at once. Besides, each one was defined in order to realize a specific objective and in a particular domain of application. In this paper, we propose an evolving KAGR graph. The latter provides a common understanding of openness and unifies its structural, functional and interactional aspects in a generic way. Our model is finally tested and validated on a multi-agent rescue simulator.

show abstract

Section: Modelling Mas Openness: State Of the Artmentioning

confidence: 89%

A generic model for representing openness in multi-agent systems

Hattab¹,

Chaari²

2021

The Knowledge Engineering Review

View full text Add to dashboard Cite

show abstract

“…In addition, here we just consider perfect recall strategies in multi-agent concurrent games with complete information. Next, we will further study these new proposed strategic logics under incomplete information [45][46][47], where the strategies of agents maybe memoryless or perfect recall [48]. In this paper, we present formal frameworks and show technical results; in the future, we will also present case studies or practical applications to illustrate these theories, such as information security [49], solving winning strategies [50], and voting protocol [51].…”

Section: Discussionmentioning

confidence: 99%

Representation and Reasoning about Strategic Abilities with ω-Regular Properties

Xiong

Guo

2021

Mathematics

View full text Add to dashboard Cite

Specification and verification of coalitional strategic abilities have been an active research area in multi-agent systems, artificial intelligence, and game theory. Recently, many strategic logics, e.g., Strategy Logic (SL) and alternating-time temporal logic (ATL*), have been proposed based on classical temporal logics, e.g., linear-time temporal logic (LTL) and computational tree logic (CTL*), respectively. However, these logics cannot express general ω-regular properties, the need for which are considered compelling from practical applications, especially in industry. To remedy this problem, in this paper, based on linear dynamic logic (LDL), proposed by Moshe Y. Vardi, we propose LDL-based Strategy Logic (LDL-SL). Interpreted on concurrent game structures, LDL-SL extends SL, which contains existential/universal quantification operators about regular expressions. Here we adopt a branching-time version. This logic can express general ω-regular properties and describe more programmed constraints about individual/group strategies. Then we study three types of fragments (i.e., one-goal, ATL-like, star-free) of LDL-SL. Furthermore, we show that prevalent strategic logics based on LTL/CTL*, such as SL/ATL*, are exactly equivalent with those corresponding star-free strategic logics, where only star-free regular expressions are considered. Moreover, results show that reasoning complexity about the model-checking problems for these new logics, including one-goal and ATL-like fragments, is not harder than those of corresponding SL or ATL*.

show abstract

“…Model Checking on MAS. Existing approaches to approximate AT L model checking under imperfect information and perfect recall have either focused on an approximation to perfect information [4,5] or developed notions of bounded recall [6]. Differently from these works, we do not restrain the class of problems tackled by our technique.…”

Section: Related Workmentioning

confidence: 99%

“…So, our procedure approximates the truth value by considering the case in which all the agents in the game collaborate to achieve the objectives not satisfied in the model checking phase. That is, while in [4,5] the approximation is given in terms of information, in [6] is given in terms of recall of the strategies, and in [17] the approximation is given by generalizing the logic, here we give results by approximating the coalitions. Furthermore, we recall that our procedure produces always results, even partial.…”

Section: Our Proceduresmentioning

confidence: 99%

Towards the Combination of Model Checking and Runtime Verification on Multi-Agent Systems

Ferrando¹,

Malvone²

2022

Preprint

Self Cite

View full text Add to dashboard Cite

Multi-Agent Systems (MAS) are notoriously complex and hard to verify. In fact, it is not trivial to model a MAS, and even when a model is built, it is not always possible to verify, in a formal way, that it is actually behaving as we expect. Usually, it is relevant to know whether an agent is capable of fulfilling its own goals. One possible way to check this is through Model Checking. Specifically, by verifying Alternating-time Temporal Logic (ATL) properties, where the notion of strategies for achieving goals can be described. Unfortunately, the resulting model checking problem is not decidable in general. In this paper, we present a verification procedure based on combining Model Checking and Runtime Verification, where sub-models of the MAS model belonging to decidable fragments are verified by a model checker, and runtime monitors are used to verify the rest. Furthermore, we implement our technique and show experimental results.

show abstract

An Abstraction-Based Method for Verifying Strategic Properties in Multi-Agent Systems with Imperfect Information

Cited by 16 publications

References 20 publications

A generic model for representing openness in multi-agent systems

A generic model for representing openness in multi-agent systems

Representation and Reasoning about Strategic Abilities with ω-Regular Properties

Towards the Combination of Model Checking and Runtime Verification on Multi-Agent Systems

Contact Info

Product

Resources

About