Abstract
We present an algorithm for model checking temporal-epistemic properties of multi-agent systems, expressed in the formalism of interpreted systems. We first introduce a technique for the translation of interpreted systems into boolean formulae, and then present a model-checking algorithm based on this translation. The algorithm is based on obdd’s, as they offer a compact and efficient representation for boolean formulae.
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.
Similar content being viewed by others
References
McCarthy, J.: Ascribing mental qualities to machines. In: Ringle, M. (ed.) Philosophical Perspectives in Artificial Intelligence., Atlantic Highlands, pp. 161–195. Humanities Press, New Jersey (1979)
Huth, M.R.A., Ryan, M.D.: Logic in Computer Science: Modelling and Reasoning about Systems., England. Cambridge University Press, Cambridge (2000)
Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (1999)
Wooldridge, M., Fisher, M., Huget, M.P., Parsons, S.: Model checking multiagent systems with MABLE. In: Gini, M., Ishida, T., Castelfranchi, C., Johnson, W.L. (eds.) AAMAS 2002, pp. 952–959. ACM Press, New York (2002)
Benerecetti, M., Giunchiglia, F., Serafini, L.: Model checking multiagent systems. Journal of Logic and Computation 8, 401–423 (1998)
Bordini, R.H., Fisher, M., Pardavila, C., Wooldridge, M.: Model checking AgentSpeak. In: Faratin, P., Parkes, D.C., Rodríguez-Aguilar, J.-A., Walsh, W.E. (eds.) AAMAS 2003. LNCS, vol. 3048, Springer, Heidelberg (2003)
Rao, A.S.: AgentSpeak(L): BDI agents speak out in a logical computable language. In: Perram, J., Van de Velde, W. (eds.) MAAMAW 1996, vol. 1038, pp. 42–58. Springer, Heidelberg (1996)
Holzmann, G.J.: The model checker spin. IEEE transaction on software engineering 23 (1997)
van der Meyden, R., Shilov, N.V.: Model checking knowledge and time in systems with perfect recall. FSTTCS: Foundations of Software Technology and Theoretical Computer Science 19 (1999)
van der Meyden, R., Su, K.: Symbolic model checking the knowledge of the dining cryptographers (2002) (submitted)
Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. Massachusetts. The MIT Press, Cambridge (1995)
McMillan, K.: Symbolic model checking: An approach to the state explosion problem. Kluwer Academic Publishers, Dordrecht (1993)
Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Transaction on Computers, 677–691 (1986)
Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 102 0 states and beyond. Information and Computation 98, 142–170 (1992)
Penczek, W., Lomuscio, A.: Verifying epistemic properties of multi-agent systems via model checking. Fundamenta Informaticae 55, 167–185 (2003)
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
Raimondi, F., Lomuscio, A. (2004). Towards Symbolic Model Checking for Multi-agent Systems via obdd’s. 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_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-30960-4_14
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)