The Complexity of Model Checking Succinct Multiagent Systems
MetadataShow full item record
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.
Proceedings of the International Joint Conference on Artificial Intelligence
© 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.
Artificial Intelligence and Image Processing not elsewhere classified