The Complexity of Model Checking Succinct Multiagent SystemsOpen Website

2015 (modified: 16 Jul 2019)IJCAI 2015Readers: Everyone
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.
0 Replies

Loading