Verification of Broadcasting Multi-Agent Systems Against an Epistemic Strategy Logic
Abstract
We study a class of synchronous, perfect-recall multi-agent systemswith imperfect information and broadcasting (i.e., fully observableactions). We define an epistemic extension of strategy logic withincomplete information and the assumption of uniform and coherentstrategies. In this setting, we prove that the model checking problem, and thus rational synthesis, is decidable with non-elementarycomplexity. We exemplify the applicability of the framework on arational secret-sharing scenario.
Cite
Text
Belardinelli et al. "Verification of Broadcasting Multi-Agent Systems Against an Epistemic Strategy Logic." International Joint Conference on Artificial Intelligence, 2017. doi:10.24963/IJCAI.2017/14Markdown
[Belardinelli et al. "Verification of Broadcasting Multi-Agent Systems Against an Epistemic Strategy Logic." International Joint Conference on Artificial Intelligence, 2017.](https://mlanthology.org/ijcai/2017/belardinelli2017ijcai-verification/) doi:10.24963/IJCAI.2017/14BibTeX
@inproceedings{belardinelli2017ijcai-verification,
title = {{Verification of Broadcasting Multi-Agent Systems Against an Epistemic Strategy Logic}},
author = {Belardinelli, Francesco and Lomuscio, Alessio and Murano, Aniello and Rubin, Sasha},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2017},
pages = {91-97},
doi = {10.24963/IJCAI.2017/14},
url = {https://mlanthology.org/ijcai/2017/belardinelli2017ijcai-verification/}
}