Abstract
We present an approach to the problem of verification of epistemic properties in 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.
The authors acknowledge support from the Polish National Committee for Scientific Research (grant No 4T11C 01325, a special grant supporting ALFEBIITE), the Nuffield Foundation (grant NAL/00690/G), and EPSRC (GR/S49353/01).
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
Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic model checking without bDDs. In: Cleaveland, W.R. (ed.) TACAS 1999, vol. 1579, pp. 193–207. Springer, Heidelberg (1999)
Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science, vol. 53. Cambridge University Press, Cambridge (2001)
Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. Massachusetts. The MIT Press, Cambridge (1999)
Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Journal of the ACM 5(7), 394–397 (1962)
Dembiński, P., Janowska, A., Janowski, P., Penczek, W., Pólrola, A., Szreter, M., Woźna, B., Zbrzezny, A.: VerICS: A tool for verifying Timed Automata and Estelle specifications. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003, vol. 2619, pp. 278–283. Springer, Heidelberg (2003)
Emerson, E.A., Clarke, E.M.: Characterizing correctness properties of parallel programs using fixpoints. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 169–181. Springer, Heidelberg (1980)
Emerson, E.A., Clarke, E.M.: Using branching-time temporal logic to synthesize synchronization skeletons. Science of Computer Programming 2(3), 241–266 (1982)
Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. MIT Press, Cambridge (1995)
Halpern, J., Vardi, M. (eds.): Model checking vs. theorem proving: a manifesto. Artificial Intelligence and Mathematical Theory of Computation, pp. 151–176. Academic Press Inc., London (1991)
Lomuscio, A., Łasica, T., Penczek, W.: Bounded model checking for interpreted systems: Preliminary experimental results. In: Hinchey, M.G., Rash, J.L., Truszkowski, W.F., Rouff, C.A., Gordon-Spears, D.F. (eds.) FAABS 2002. LNCS, vol. 2699, pp. 115–125. Springer, Heidelberg (2003)
McMillan, K.L.: Applying SAT methods in unbounded symbolic model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 250–264. Springer, Heidelberg (2002)
van der Meyden, R., Shilov, H.: Model checking knowledge and time in systems with perfect recall. In: Pandu Rangan, C., Raman, V., Sarukkai, S. (eds.) FST TCS 1999. LNCS, vol. 1738, pp. 432–445. Springer, Heidelberg (1999)
Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proc. of the 38th Design Automation Conference (DAC 2001), June 2001, pp. 530–535.
Penczek, W., Lomuscio, A.: Verifying epistemic properties of multi-agent systems via bounded model checking. Fundamenta Informaticae 55(2), 167–185 (2003)
Raimondi, F., Lomuscio, A.: Symbolic model checking of deontic interpreted systems via OBDD’s. In: Lomuscio, A., Nute, D. (eds.) DEON 2004. LNCS, vol. 3065, Springer, Heidelberg (2004)
Raimondi, F., Lomuscio, A.: Towards model checking for multiagent systems via OBDD’s. In: Hinchey, M.G., Rash, J.L., Truszkowski, W.F., Rouff, C.A. (eds.) FAABS 2004. LNCS, vol. 3228, Springer, Heidelberg (2004)
Raimondi, F., Lomuscio, A.: Verification of multiagent systems via ordered binary decision diagrams: an algorithm and its implementation. In: Faratin, P., Rodríguez-Aguilar, J.-A. (eds.) AMEC 2004. LNCS, vol. 3435, Springer, Heidelberg (2006)
Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5, 285–309 (1955)
van der Hoek, W., Wooldridge, M.: Model checking knowledge and time. In: Bošnački, D., Leue, S. (eds.) SPIN 2002. LNCS, vol. 2318, pp. 95–111. Springer, Heidelberg (2002)
van der Hoek, W., Wooldridge, M.: Tractable multiagent planning for epistemic goals. In: Padget, J., Shehory, O., Parkes, D.C., Sadeh, N.M., Walsh, W.E. (eds.) AMEC 2002. LNCS, vol. 2531, pp. 1167–1174. Springer, Heidelberg (2002)
Wooldridge, M.: Computationally grounded theories of agency. In: Durfee, E. (ed.) Proceedings of ICMAS, International Conference of Multi-Agent Systems, IEEE Press, Los Alamitos (2000)
Wooldridge, M.: An introduction to multi-agent systems. John Wiley, Chichester (2002)
Wooldridge, M., Fisher, M., Huget, M., Parsons, S.: Model checking multiagent systems with mable. In: Padget, J., Shehory, O., Parkes, D.C., Sadeh, N.M., Walsh, W.E. (eds.) AAMAS 2002. LNCS, vol. 2531, Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kacprzak, M., Lomuscio, A., Łasica, T., Penczek, W., Szreter, M. (2004). Verifying Multi-agent Systems via Unbounded Model Checking. In: Hinchey, M.G., Rash, J.L., Truszkowski, W.F., Rouff, C.A. (eds) Formal Approaches to Agent-Based Systems. FAABS 2004. Lecture Notes in Computer Science(), vol 3228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30960-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-30960-4_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24422-6
Online ISBN: 978-3-540-30960-4
eBook Packages: Computer ScienceComputer Science (R0)