The Complexity of Model Checking Succinct Multiagent Systems
File version
Version of Record (VoR)
Author(s)
Chen, Qingliang
Su, Kaile
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
Size
File type(s)
Location
License
Abstract
This paper studies the complexity of model checking multiagent systems, in particular systems succinctly described by two practical representations: concurrent representation and symbolic representation. The logics we concern include branching time temporal logics and several variants of alternating time temporal logics.
Journal Title
Proceedings of the International Joint Conference on Artificial Intelligence
Conference Title
Book Title
Edition
Volume
2015
Issue
Thesis Type
Degree Program
School
Publisher link
DOI
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
© 2015 International Joint Conference on Artificial Intelligence. The attached file is reproduced here in accordance with the copyright policy of the publisher. Please refer to the journal's website for access to the definitive, published version.
Item Access Status
Note
Access the data
Related item(s)
Subject
Artificial intelligence not elsewhere classified