Pinar Yolum
ABSTRACT
Interaction protocols enable agents to communicate with each other effectively. Whereas several approaches exist to specify interaction protocols, none of them has design tools that can help protocol designers catch semantical protocol errors at design time. As research in networking protocols has shown, flawed specifications of protocols can have disastrous consequences. Hence, it is crucial to systematically analyze protocols in time to ensure correct specification. This paper studies and formalizes important generic properties of commitment protocols that can ease their correct development significantly. Since these properties are formal, they can easily be incorporated in a software tool to (semi-)automate the design and specification of commitment protocols. Where appropriate we provide algorithms that can directly be used to check these properties in such a design tool.
- M. Alberti, D. Daolio, and P. Torroni. Specification and verification of agent interaction protocols in a logic-based system. In Proceedings of the ACM Symposium on Applied Computing (SAC), pages 72--78. ACM Press, Mar. 2004. Google Scholar
Digital Library
- A. Artikis, J. Pitt, and M. Sergot. Animated specifications of computational societies. In Proceedings of the 1st International Joint Conference on Autonomous Agents and MultiAgent Systems (AAMAS), pages 1053--1061. 2002. Google ScholarDigital Library
- J. Bentahar, B. Moulin, J.-J. C. Meyer, and B. Chaib-draa. A logical model for commitment and argument network for agent communication. In Proceedings of the 3rd International Joint Conference on Autonomous Agents and MultiAgent Systems (AAMAS), pages 792--799. 2004. Google ScholarDigital Library
- C. Castelfranchi. Commitments: From individual intentions to groups and organizations. In Proc. of the Intl Conf. on Multiagent Systems, pages 41--48, 1995.Google Scholar
- T. H. Cormen, C. E. Leiserson, and R. Rivest. Design and Analysis of Algorithms. MIT Press, 1990.Google Scholar
- V. Dignum, J.-J. Meyer, F. Dignum, and H. Weigand. Formal specification of interaction in agent societies. In 2nd Goddard Workshop on Formal Approaches to Agent-Based Systems (FAABS), Maryland, Oct 2002.Google Scholar
- U. Endriss, N. Maudet, F. Sadri, and F. Toni. Protocol conformance for logic-based agents. In Proc. of Intl. Joint Conf. on AI (IJCAI), pages 679--684. 2003. Google ScholarDigital Library
- FIPA. Contract net interaction protocol specification, 2002. Number 00029.Google Scholar
- N. Fornara and M. Colombetti. Operational specification of a commitment-based agent communication language. In Proc. of 1st Intl. Joint Conf. on Autonomous Agents and MultiAgent Systems (AAMAS), pages 535--542. 2002. Google ScholarDigital Library
- M. G. Gouda. Protocol verification made simple: a tutorial. Computer Networks and ISDN Systems, 25:969--980, 1993. Google ScholarDigital Library
- G. J. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall, New Jersey, 1991. Google ScholarDigital Library
- M.-P. Huget and J.-L. Koning. Requirement analysis for interaction protocols. In Proc. of the Central and Eastern European Conf. on Multiagent Systems (CEEMAS), LNAI 2691, pages 404--412. Springer-Verlag, 2003. Google ScholarDigital Library
- N. R. Jennings. On agent-based software engineering. Artificial Intelligence, 177(2):277--296, 2000. Google ScholarDigital Library
- R. Kowalski and M. J. Sergot. A logic-based calculus of events. New Generation Computing, 4(1):67--95, 1986. Google ScholarDigital Library
- A. U. Mallya, P. Yolum, and M. P. Sing. Resolving commitments among autonomous agents. In M.-P. Huget and F. Dignum, editors, Proceedings of the AAMAS Workshop on Agent Communication Languages and Conversation Policies, LNAI 2922, pages 166--182. Springer Verlag, 2003.Google Scholar
- P. McBurney and S. Parsons. Posit spaces: A performative model of e-commerce. In Proceedings of the 2nd International Joint Conference on Autonomous Agents and MultiAgent Systems (AAMAS), pages 624--631. 2003. Google ScholarDigital Library
- M. Shanahan. Solving the Frame Problem: A Mathematical Investigation of the Common Sense Law of Inertia. MIT Press, Cambridge, 1997. Google ScholarDigital Library
- M. P. Singh. An ontology for commitments in multiagent systems: Toward a unification of normative concepts. Artificial Intelligence and Law, 7:97--113, 1999.Google ScholarDigital Library
- M. Venkatraman and M. P. Singh. Verifying compliance with commitment protocols: Enabling open Web-based multiagent systems. Autonomous Agents and Multi-Agent Systems, 2(3):217--236, Sept. 1999. Google ScholarDigital Library
- P. Yolum and M. P. Singh. Flexible protocol specification and execution: Applying event calculus planning using commitments. In Proceedings of the 1st International Joint Conference on Autonomous Agents and MultiAgent Systems (AAMAS), pages 527--534. ACM Press, July 2002. Google ScholarDigital Library
- P. Yolum and M. P. Singh. Reasoning about commitments in the event calculus: An approach for specifying and executing protocols. Annals of Mathematics and Artificial Intelligence, 42(1--3):227--253, 2004. Google ScholarDigital Library
Index Terms
- Towards design tools for protocol development
Recommendations
Towards Design Tools for Protocol Development
Agent Communication IIInteraction protocols enable agents to communicate with each other effectively. Whereas several approaches exist to specify interaction protocols, none of them has design tools that can help protocol designers catch semantical protocol errors at design ...
Design time analysis of multiagent protocols
Interaction protocols enable agents to communicate with each other effectively. Whereas several approaches exist to specify interaction protocols, none of them has design tools that can help protocol designers catch semantic protocol errors at design ...
Very-Efficient Simulatable Flipping of Many Coins into a Well
Proceedings, Part II, of the 19th IACR International Conference on Public-Key Cryptography --- PKC 2016 - Volume 9615This paper presents new cryptographic protocols for a stand-alone simulatable two-party parallel coin-flipping into a well and a universally composable commitment scheme, with near optimal asymptotic communication rate, in the static and computational ...
Comments