The Complexity of Model Checking Succinct Multiagent Systems
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.
Cite
Text
Huang et al. "The Complexity of Model Checking Succinct Multiagent Systems." International Joint Conference on Artificial Intelligence, 2015.Markdown
[Huang et al. "The Complexity of Model Checking Succinct Multiagent Systems." International Joint Conference on Artificial Intelligence, 2015.](https://mlanthology.org/ijcai/2015/huang2015ijcai-complexity/)BibTeX
@inproceedings{huang2015ijcai-complexity,
title = {{The Complexity of Model Checking Succinct Multiagent Systems}},
author = {Huang, Xiaowei and Chen, Qingliang and Su, Kaile},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2015},
pages = {1076-1082},
url = {https://mlanthology.org/ijcai/2015/huang2015ijcai-complexity/}
}