{"type":"ScholarlyArticle","title":"Verifying Pushdown Multi-Agent Systems against Strategy Logics","authors":[{"name":"Taolue Chen","slug":"taolue-chen","given":"Taolue","family":"Chen","affiliation":""},{"name":"Fu Song","slug":"fu-song","given":"Fu","family":"Song","affiliation":""},{"name":"Zhilin Wu","slug":"zhilin-wu","given":"Zhilin","family":"Wu","affiliation":""}],"abstract":"In this paper, we investigate model checking algorithms for variants of strategy logic over pushdown multi-agent systems, modeled by pushdown game structures (PGSs). We consider various fragments of strategy logic, i.e., SL[CG], SL[DG], SL[1G] and BSIL. We show that the model checking problems on PGSs for SL[CG], SL[DG] and SL[1G] are 3EXTIME-complete, which are not harder than the problem for the subsumed logic ATL*. When BSIL is concerned, the model checking problem becomes 2EXPTIME-complete. Our algorithms are automata-theoretic and based on the saturation technique, which are amenable to implementations.","doi":null,"url":"https://ijcai.org/proceedings/2016/33","pdf":"https://ijcai.org/proceedings/2016/0033.pdf","markdown":"https://ijcai.org/proceedings/2016/33.md","bibtex":"https://ijcai.org/proceedings/2016/bibtex/33","volume":{"slug":"2016","title":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2016","url":"https://ijcai.org/proceedings/2016/","year":2016,"location":"New York, NY, USA","dates":"9–15 July 2016","editors":"Subbarao Kambhampati","isbn":"978-1-57735-770-4; 978-1-57735-771-1","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":33,"pages":{"first":180,"last":185},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}