Skip Navigation

Journal of Logic and Computation 1998 8(3):401-423; doi:10.1093/logcom/8.3.401
© 1998 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (19)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by BENERECETTI, M.
Right arrow Articles by SERAFINI, L.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Articles

Model Checking Multiagent Systems

MASSIMO BENERECETTI, DISA, FAUSTO GIUNCHIGLIA, DISA and LUCIANO SERAFINI, IRST

Universitdà degli Studi di Trento Via Inama 5, 38100 Trento, Italy. E-mail: bene{at}cs.unitn.it
Universitdà degli Studi di Trento Via Inama 5, 38100 Trento, Italy and IRST - Istituto Trentino di Cultura, 38050 Povo, Trento, Italy. E-mail: fausto{at}irst.itc.it
Istituto Trentino di Cultura 38050 Povo, Trento, Italy. E-mail: serafini{at}irst.itc.it

Model checking is a very successful technique which has been applied in the design and verification of finite state concurrent reactive processes. In this paper we show how this technique can be lifted to be applicable to multiagent systems. Our approach allows us to reuse the technology and tools developed in model checking, to design and verify multiagent systems in a modular and incremental way, and also to have a very efficient model checking algorithm.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.