Verification of Multiagent Systems via Unbounded Model Checking

New York City, New York, USA July 19-July 23

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/AAMAS.2004.10086

Third International Joint Conference ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Magdalena Kacprzak Articles by Alessio Lomuscio Articles by Wojciech Penczek

	ASCII Text	x
	Magdalena Kacprzak, Alessio Lomuscio, Wojciech Penczek, "Verification of Multiagent Systems via Unbounded Model Checking," Autonomous Agents and Multiagent Systems, International Joint Conference on, vol. 2, pp. 638-645, Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2 (AAMAS'04), 2004.

	BibTex	x
	@article{ 10.1109/AAMAS.2004.10086, author = {Magdalena Kacprzak and Alessio Lomuscio and Wojciech Penczek}, title = {Verification of Multiagent Systems via Unbounded Model Checking}, journal ={Autonomous Agents and Multiagent Systems, International Joint Conference on}, volume = {2}, year = {2004}, isbn = {0-7695-2092-8}, pages = {638-645}, doi = {http://doi.ieeecomputersociety.org/10.1109/AAMAS.2004.10086}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Autonomous Agents and Multiagent Systems, International Joint Conference on TI - Verification of Multiagent Systems via Unbounded Model Checking SN - 0-7695-2092-8 SP638 EP645 A1 - Magdalena Kacprzak, A1 - Alessio Lomuscio, A1 - Wojciech Penczek, PY - 2004 KW - null VL - 2 JA - Autonomous Agents and Multiagent Systems, International Joint Conference on ER -

Magdalena Kacprzak, Bia?ystok University of Technology

Alessio Lomuscio, King?s College London

Wojciech Penczek, ICS PAS and Podlasie Academy

We present an approach to the problem of verification of epistemic properties of multi-agent systems by means of symbolic model checking. In particular, it is shown how to extend the technique of unbounded model checking from a purely temporal setting to a temporal-epistemic one. In order to achieve this, we base our discussion on interpreted systems semantics, a popular semantics used in multi-agent systems literature.We give details of the technique and show how it can be applied to the well-known train, gate and controller problem.

Citation:

Magdalena Kacprzak, Alessio Lomuscio, Wojciech Penczek, "Verification of Multiagent Systems via Unbounded Model Checking," aamas, vol. 2, pp.638-645, Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2 (AAMAS'04), 2004

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.