Mcmas: A model checker for multi-agent systems (2006)
| Venue: | Proceedings of TACAS 2006 |
| Citations: | 32 - 15 self |
BibTeX
@INPROCEEDINGS{Lomuscio06mcmas:a,
author = {Alessio Lomuscio and Franco Raimondi},
title = {Mcmas: A model checker for multi-agent systems},
booktitle = {Proceedings of TACAS 2006},
year = {2006},
pages = {450--454},
publisher = {Springer Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
from traditional model checkers, MCMAS permits the automatic verification of specifications that use epistemic, correctness, and cooperation modalities, in addition to the standard temporal modalities. These additional modalities are used to capture properties of various scenarios (including communication and security protocols, games, etc.) that may be difficult or unnatural to express with temporal operators only; a small number of applications are presented in Section 4. Agents are described in MCMAS by means of the dedicated programming language ISPL (Interpreted Systems Programming Language). The approach is symbolic and uses ordered binary decision diagrams (OBDDs), thereby extending standard techniques for temporal logic to other modalities distinctive of agents. MCMAS and all the examples presented in this paper are available for download [14] under the terms of the GPL license. 2 Theoretical background Interpreted systems [5] provide the formal semantics for MCMAS programs. In the formalism of interpreted systems, each agent is characterised by a set of local states and by a set of local actions that are performed following a local protocol. Given a set of initial
Citations
No citations identified.
