Making Agents' Abilities Explicit

被引:0
|
作者
Zhang, Yedi [1 ,2 ,3 ]
Song, Fu [1 ]
Chew, Taolue [4 ]
机构
[1] ShanghaiTech Univ, Sch Informat Sci & Technol, Shanghai 201210, Peoples R China
[2] Chinese Acad Sci, Shanghai Inst Microsyst & Informat Technol, Shanghai 200050, Peoples R China
[3] Univ Chinese Acad Sci, Beijing 100049, Peoples R China
[4] Birkbeck Univ London, Dept Comp Sci & Informat Syst, London WC1E 7HX, England
来源
IEEE ACCESS | 2019年 / 7卷
基金
英国工程与自然科学研究理事会; 中国国家自然科学基金;
关键词
Model-checking; multi-agent systems; alternating-time temporal logics; agents' abilities; AUTOMATA; BUCHI;
D O I
10.1109/ACCESS.2019.2931514
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Alternating-time temporal logics (ATL/ATL*) represent a family of modal and temporal logics for reasoning about strategic abilities of agents in multiagent systems. These logics are usually interpreted over concurrent game structures (CGSs), and their interpretations may vary depending on the abilities of agents, such as perfect versus imperfect information and perfect versus imperfect recall. These different abilities lead to a variety of variants that have been studied extensively in the literature. However, all of these variants are defined at the semantic level, which may restrict modeling flexibility, or even give counterintuitive interpretations. For example, an agent may have different abilities when achieving two different goals on the same CGS. To mitigate these issues, in this paper, we propose to extend CGSs with agents' abilities, resulting in Abilities Augmented CGSs, where concrete abilities can be defined at the syntactic level. We study ATL/ATL* over this new model. We give formal definitions of the new semantics and present model-checking algorithms for ATL/ATL*. We also identify the computational complexity of ATL/ATL* model checking problem, i.e., Delta(P)(3)-/2EXPTIME-complete. The model-checking algorithms are implemented in a prototype tool. The experimental results show the practical feasibility and effectiveness of our approach.
引用
收藏
页码:101804 / 101819
页数:16
相关论文
共 50 条
  • [31] Decentralized navigation method for a robotic swarm with nonhomogeneous abilities
    Yoshimoto, Masahiro
    Endo, Takahiro
    Maeda, Ryuma
    Matsuno, Fumitoshi
    AUTONOMOUS ROBOTS, 2018, 42 (08) : 1583 - 1599
  • [32] A Logical Framework for the Representation and Verification of Context-aware Agents
    Rakib, Abdur
    Ul Haque, Hafiz Mahfooz
    MOBILE NETWORKS & APPLICATIONS, 2014, 19 (05) : 585 - 597
  • [33] Representation and Reasoning about Strategic Abilities with ω-Regular Properties
    Xiong, Liping
    Guo, Sumei
    MATHEMATICS, 2021, 9 (23)
  • [34] Fixpoint Approximation of Strategic Abilities under Imperfect Information
    Jamroga, Wojciech
    Knapik, Michal
    Kurpiewski, Damian
    AAMAS'17: PROCEEDINGS OF THE 16TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS, 2017, : 1241 - 1249
  • [35] Approximate verification of strategic abilities under imperfect information
    Jamroga, Wojciech
    Knapik, Michal
    Kurpiewski, Damian
    Mikulski, Lukasz
    ARTIFICIAL INTELLIGENCE, 2019, 277
  • [36] Explicit-Symbolic Modelling for Formal Verification
    Costa, Umberto
    Campos, Sergio
    Vieira, Newton
    Deharbe, David
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 130 : 301 - 321
  • [37] The Petri net twist in explicit model checking
    Karsten Wolf
    Software & Systems Modeling, 2015, 14 : 711 - 717
  • [38] The Petri net twist in explicit model checking
    Wolf, Karsten
    SOFTWARE AND SYSTEMS MODELING, 2015, 14 (02) : 711 - 717
  • [39] Epistemic and Probabilistic ATL with Quantification and Explicit Strategies
    Schnoor, Henning
    AGENTS AND ARTIFICIAL INTELLIGENCE, ICAART 2013, 2014, 449 : 131 - 148
  • [40] Solving Parity Games: Explicit vs Symbolic
    Di Stasio, Antonio
    Murano, Aniello
    Vardi, Moshe Y.
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2018, 2018, 10977 : 159 - 172