Abstract
In this paper, we propose a new tableau-based model checking technique for verifying dialogue game protocols for agent communication. These protocols are defined using our social commitment-based framework for agent communication called Commitment and Argument Network (CAN). We use a variant of CTL* (ACTL*) for specifying these protocols and the properties to be verified. This logic extends CTL* by allowing formulae to constrain actions as well as states. The verification method is based on the translation of formulae into a variant of alternating tree automata called Alternating Büchi Tableau Automata (ABTA). We propose a set of tableau rules (inference rules) for specifying this translation procedure. Unlike the model checking algorithms proposed in the literature, the algorithm that we propose in this paper allows us not only to verify if the dialogue game protocol (the model) satisfies a given property, but also if this protocol respects the tableau rules-based decomposition of the action formulae. This algorithm is an on-the-fly efficient algorithm.
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
Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: Compliance verification of agent interaction: a logic-based tool. In: Proc. of the European Meeting on Cybernetics and Systems Research, vol. II, pp. 570–575 (2004)
Baldoni, M., Baroglio, C., Martelli, A., Patti, V., Schifanella, C.: Verifying protocol conformance for logic-based communicating agents. In: Leite, J., Torroni, P. (eds.) CLIMA 2004. LNCS (LNAI), vol. 3487, pp. 196–212. Springer, Heidelberg (2005)
Benerecetti, M., Cimatti, A.: Symbolic model checking for multi-agent systems. In: Proc. of the International Workshop on Model Checking and AI, pp. 1–8 (2002)
Bentahar, J.: A pragmatic and semantic unified framework for agent communication. PhD Thesis, Laval University, Canada (May 2005)
Bentahar, J., Moulin, B., Chaib-draa, B.: A persuasion dialogue game based on commitments and arguments. In: Proc. of the International Workshop on Argumentation in Multi-Agent Systems, pp. 148–164 (2004)
Bentahar, J., Moulin, B., Meyer, J.-J.C., Chaib-draa, B.: A logical model for commitment and argument network for agent communication. In: Proc. of the International Joint Conference on AAMAS, pp. 792–799 (2004)
Bhat, G., Cleaveland, R., Groce, A.: Efficient model checking via Büchi tableau automata. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 38–52. Springer, Heidelberg (2001)
Bhat, G., Cleaveland, R., Grumberg, O.: Efficient on-the-fly model checking for CTL*. In: The IEEE Symposium on Logics in Computer Science, pp. 388–397 (1995)
Bordini, R.H., Fisher, M., Pardavila, C., Wooldridge, M.: Model checking AgentSpeak. In: Proc. of the International Joint Conference on AAMAS, pp. 409–419 (2003)
Bordini, R.H., Visser, W., Fisher, M., Pardavila, C., Wooldridge, M.: Model checking multi-agent programs with CASP. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 110–113. Springer, Heidelberg (2003)
Cleaveland, R.: Tableau-based model checking in the propositional mu-calculus. Acta Informatica 27(8), 725–747 (1990)
Cohen, P.R., Levesque, H.J.: Persistence, intentions and commitment. Intentions in Communication, pp. 33–69. MIT Press, Cambridge (1990)
Colombetti, M.: A commitment-based approach to agent speech acts and conversations. In: Proc. of the International Autonomous Agent Workshop on Conversational Policies, pp. 21–29 (2000)
Courcoubetis, C., Vardi, M.Y., Wolper, P., Yannakakis, M.: Memory efficient algorithms for verification of temporal properties. Formal Methods in System Design 1, 275–288 (1992)
Endriss, U., Maudet, N., Sadri, F., Toni, F.: Protocol conformance for logicbased agents. In: Proc. of the International Joint Conference on AI, pp. 679–684 (2003)
Fornara, N., Colombetti, M.: Operational specification of a commitment-based agent communication language. In: Proc. of the International Joint Conference on AAMS, pp. 535–542 (2002)
Giordano, L., Martelli, A., Schwind, C.: Verifying communicating agents by model checking in a temporal action logic. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 57–69. Springer, Heidelberg (2004)
Huget, M.P., Wooldridge, M.: Model checking for ACL compliance verification. In: Dignum, F.P.M. (ed.) ACL 2003. LNCS (LNAI), vol. 2922, pp. 75–90. Springer, Heidelberg (2004)
Kacprzak, M., Penczek, W.: Unbounded model checking for alternating-time temporal logic. In: The International Joint Conference on AAMAS, pp. 646–653 (2004)
Kacprzak, M., Lomuscio, A., Penczek, W.: Verification of multiagent systems via unbounded model checking. In: Proc. of the International Joint Conference on AAMAS, pp. 638–645 (2004)
Maudet, N., Chaib-draa, B.: Commitment-based and dialogue-game based protocols, new trends in agent communication languages. Knowledge Engineering Review 17(2), 157–179 (2002)
McBurney, P., Parsons, S.: Games that agents play: A formal framework for dialogues between autonomous agents. Journal of Logic, Language, and Information 3(11), 315–334 (2002)
Moulin, B.: The social dimension of interactions in multi-agent systems. In: Wobcke, W., Pagnucco, M., Zhang, C. (eds.) Agents and Multi-Agent Systems Formalisms, Methodologies, and Applications. LNCS, vol. 1441, pp. 109–122. Springer, Heidelberg (1998)
Penczek, W., Lomuscio, A.: Verifying epistemic properties of multi-agent systems via model checking. Fundamenta Informaticae 55(2), 167–185 (2003)
Raimondi, F., Lomuscio, A.: Verification of multiagent systems via ordered binary decision diagrams: an algorithm and its implementation. In: Proc. of the International Joint Conference on AAMAS, pp. 630–637 (2004)
Rao, A.S., Georgeff, M.P.: A model-theoretic approach to the verification of situated reasoning systems. In: Proc. of IJCAI, pp. 318–324 (1993)
Sadri, F., Toni, F., Torroni, P.: Dialogues for negotiation: Agent varieties and dialogue sequences. In: Meyer, J.-J.C., Tambe, M. (eds.) ATAL 2001. LNCS (LNAI), vol. 2333, pp. 405–421. Springer, Heidelberg (2002)
Singh, M.P.: Agent communication languages: rethinking the principles. IEEE Computer 31(12), 40–47 (1998)
Stirling, C., Walker, D.: Local model checking in the modal Mu-Calculus. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol. 354, pp. 369–383. Springer, Heidelberg (1989)
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)
Vardi, M., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Symposium on Logic in Computer Science, pp. 332–344 (1986)
Walton, D.C.: Model checking agent dialogues. In: Leite, J., Omicini, A., Torroni, P., Yolum, p. (eds.) DALT 2004. LNCS (LNAI), vol. 3476, pp. 132–147. Springer, Heidelberg (2005)
Wooldridge, M., Fisher, M., Huget, M.P., Parsons, S.: Model checking multiagent systems with MABLE. In: Proc. of the International Joint Conference on AAMAS, pp. 952–959 (2002)
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
Bentahar, J., Moulin, B., Meyer, JJ.C. (2006). A Tableau Method for Verifying Dialogue Game Protocols for Agent Communication. In: Baldoni, M., Endriss, U., Omicini, A., Torroni, P. (eds) Declarative Agent Languages and Technologies III. DALT 2005. Lecture Notes in Computer Science(), vol 3904. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11691792_14
Download citation
DOI: https://doi.org/10.1007/11691792_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33106-3
Online ISBN: 978-3-540-33107-0
eBook Packages: Computer ScienceComputer Science (R0)