Global model checking on pushdown multi-agent systems

Chen, Taolue, Song, Fu and Wu, Zhilin (2016) Global model checking on pushdown multi-agent systems. In: Thirtieth AAAI Conference on Artificial Intelligence (AAAI-16), 12-17 Feb 2016, Phoenix, Arizona, USA.

[img] PDF - Published version (with publisher's formatting)
Restricted to Repository staff and depositor only

Download (698kB)

Abstract

Pushdown multi-agent systems, modeled by pushdown game structures (PGSs), are an important paradigm of infinite-state multi-agent systems. Alternating-time temporal logics are well-known specification formalisms for multi-agent systems, where the selective path quantifier is introduced to reason about strategies of agents. In this paper, we investigate model checking algorithms for variants of alternating-time temporal logics over PGSs, initiated by Murano and Perelli at IJCAI'15. We first give a triply exponential-time model checking algorithm for ATL* over PGSs. The algorithm is based on the saturation method, and is the first global model checking algorithm with a matching lower bound. Next, we study the model checking problem for the alternating-time mu-calculus. We propose an exponential-time global model checking algorithm which extends similar algorithms for pushdown systems and modal mu-calculus. The algorithm admits a matching lower bound, which holds even for the alternation-free fragment and ATL.

Item Type: Conference or Workshop Item (Paper)
Research Areas: A. > School of Science and Technology > Computer Science
Item ID: 19183
Useful Links:
Depositing User: Taolue Chen
Date Deposited: 12 Apr 2016 09:47
Last Modified: 30 Jun 2019 01:54
URI: https://eprints.mdx.ac.uk/id/eprint/19183

Actions (login required)

Edit Item Edit Item

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year