Abstract
We present a bounded model checking (BMC) approach to the verification of temporal epistemic properties of multi-agent systems. We extend the temporal logic CTL * by incorporating epistemic modalities and obtain a temporal epistemic logic that we call CTL * K. CTL * K logic is interpreted under the semantics of synchronous interpreted systems. Though CTL * K is of great expressive power in both temporal and epistemic dimensions, we show that BMC method is still applicable for the universal fragment of CTL * K. We present in some detail a BMC algorithm and prove its correctness. In our approach, agents’ knowledge interpreted in synchronous semantics can be skillfully attained by the state position function, which avoids extending the encoding of the states and the transition relations of the plain temporal epistemic model for time domain.
This work was partially supported by the Australian Research Council grant DP0452628, National Basic Research 973 Program of China under grant 2005CB321902, National Natural Science Foundation of China grants 60496327, 10410638 and 60473004, and Guangdong Provincial Natural Science Foundation grants 04205407 and 06023195.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (2000)
Bordini, R.H., Fisher, M., Pardavila, C., Wooldridge, M.: Model checking agentspeak. In: Proceedings of the second international joint conference on Autonomous agents and multiagent systems, pp. 409–416. ACM Press, New York (2003)
Halpern, J.Y., Vardi, M.Y.: Model checking vs. theorem proving: A manifesto. In: KR, pp. 325–334 (1991)
van der Hoek, W., Wooldridge, M.: Model checking knowledge and time. In: Proc. 19th Workshop on SPIN, Grenoble (2002)
van der Hoek, W., Wooldridge, M.: Tractable multiagent planning for epistemic goals. In: Proc. of the 1st Int. Conf. on Autonomous Agents and Multi-Agent Systems (AAMAS 2002), vol. III, pp. 1167–1174. ACM, New York (2003)
van der Meyden, R., Su, K.: Symbolic model checking the knowledge of the dining cryptographers. In: Proc. of 17th IEEE Computer Security Foundations Workshop, pp. 280–291 (2004)
Su, K.: Model checking temporal logics of knowledge in distributed systems. In: McGuinness, D.L., Ferguson, G. (eds.) AAAI, pp. 98–103. AAAI Press / The MIT Press (2004)
Biere, A., Cimatti, A., Clarke, E.M., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) ETAPS 1999 and TACAS 1999. LNCS, vol. 1579, pp. 193–207. Springer, Heidelberg (1999)
Penczek, W., Woźna, B., Zbrzezny, A.: Bounded model checking for the universal fragment of CTL. Fundamenta Informaticae 51, 135–156 (2002)
Penczek, W., Lomuscio, A.: Verifying epistemic properties of multi-agent systems via bounded model checking. Fundamenta Informaticae 55 (2003)
Woźna, B.: ACTL* properties and Bounded Model Checking. Fundamenta Informaticae 63(1), 65–87 (2004)
Luo, X., Su, K., Sattar, A., Chen, Q., Lv, G.: Bounded model checking knowledge and branching time in synchronous multi-agent systems. In: Dignum, F., Dignum, V., Koenig, S., Kraus, S., Singh, M.P., Wooldridge, M. (eds.) AAMAS, pp. 1129–1130. ACM, New York (2005)
Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning about knowledge. MIT Press, Cambridge (1995)
Kacprzak, M., Lomuscio, A., Penczek, W.: From bounded to unbounded model checking for temporal epistemic logic. Fundamenta Informaticae 62, 1–20 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Luo, X., Su, K., Sattar, A., Reynolds, M. (2006). Verification of Multi-agent Systems Via Bounded Model Checking. In: Sattar, A., Kang, Bh. (eds) AI 2006: Advances in Artificial Intelligence. AI 2006. Lecture Notes in Computer Science(), vol 4304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11941439_11
Download citation
DOI: https://doi.org/10.1007/11941439_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49787-5
Online ISBN: 978-3-540-49788-2
eBook Packages: Computer ScienceComputer Science (R0)