Pushdown Multi-Agent System Verification
Abstract
In this paper we investigate the model-checking problem of pushdown multi-agent systems for ATL* specifications. To this aim, we introduce pushdown game structures over which ATL* formulas are interpreted. We show an algorithm that solves the addressed model-checking problem in 3ExpTime. We also provide a 2ExpSpace lower bound by showing a reduction from the word acceptance problem for deterministic Turing machines with doubly exponential space.
Cite
Text
Murano and Perelli. "Pushdown Multi-Agent System Verification." International Joint Conference on Artificial Intelligence, 2015.Markdown
[Murano and Perelli. "Pushdown Multi-Agent System Verification." International Joint Conference on Artificial Intelligence, 2015.](https://mlanthology.org/ijcai/2015/murano2015ijcai-pushdown/)BibTeX
@inproceedings{murano2015ijcai-pushdown,
title = {{Pushdown Multi-Agent System Verification}},
author = {Murano, Aniello and Perelli, Giuseppe},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2015},
pages = {1090-1097},
url = {https://mlanthology.org/ijcai/2015/murano2015ijcai-pushdown/}
}