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.
Pushdown multi-agent system verification / Murano, Aniello; Giuseppe, Perelli. - In: IJCAI. - ISSN 1045-0823. - 2015-January:(2015), pp. 1090-1097. (Intervento presentato al convegno Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015 tenutosi a Buenos Aires, Argentina nel Luglio 25-31, 2015).
Pushdown multi-agent system verification
MURANO, ANIELLO;
2015
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
