A logic-based calculus of events
New Generation Computing
Design and validation of computer protocols
Design and validation of computer protocols
Protocol verification made simple: a tutorial
Computer Networks and ISDN Systems - Special issue on protocol specification, testing and verification
Solving the frame problem: a mathematical investigation of the common sense law of inertia
Solving the frame problem: a mathematical investigation of the common sense law of inertia
On agent-based software engineering
Artificial Intelligence
Flexible protocol specification and execution: applying event calculus planning using commitments
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Operational specification of a commitment-based agent communication language
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Animated specifications of computational societies
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
Verifying Compliance with Commitment Protocols
Autonomous Agents and Multi-Agent Systems
Posit spaces: a performative model of e-commerce
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Specification and verification of agent interaction protocols in a logic-based system
Proceedings of the 2004 ACM symposium on Applied computing
Annals of Mathematics and Artificial Intelligence
A Logical Model for Commitment and Argument Network for Agent Communication
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Towards design tools for protocol development
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Protocol conformance for logic-based agents
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Requirement analysis for interaction protocols
CEEMAS'03 Proceedings of the 3rd Central and Eastern European conference on Multi-agent systems
Symbolic model checking commitment protocols using reduction
DALT'10 Proceedings of the 8th international conference on Declarative agent languages and technologies VIII
Model checking commitment protocols
IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II
iDetect: Content Based Monitoring of Complex Networks using Mobile Agents
Applied Soft Computing
Verifiable semantic model for agent interactions using social commitments
LADS'09 Proceedings of the Second international conference on Languages, Methodologies, and Development Tools for Multi-Agent Systems
Semantics and verification of information-based protocols
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Verifying conformance of multi-agent commitment-based protocols
Expert Systems with Applications: An International Journal
Research directions in agent communication
ACM Transactions on Intelligent Systems and Technology (TIST) - Special section on agent communication, trust in multiagent systems, intelligent tutoring and coaching systems
Formalizing and verifying protocol refinements
ACM Transactions on Intelligent Systems and Technology (TIST) - Special section on agent communication, trust in multiagent systems, intelligent tutoring and coaching systems
Engineering commitment-based business protocols with the 2CL methodology
Autonomous Agents and Multi-Agent Systems
| Hi-index | 0.00 |
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 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 effective specification. This paper first studies and formalizes important generic properties of commitment protocols that can ease their effective and consistent development significantly. Next, we identify robustness properties of protocols that are useful in determining the applicability of protocols in different settings. 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.