Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Reasoning about knowledge
Credits and debits on the Internet
IEEE Spectrum - Special issue: electronic money
Model checking
Verifying Compliance with Commitment Protocols
Autonomous Agents and Multi-Agent Systems
A Social Semantics for Agent Communication Languages
Issues in Agent Communication
Verifying epistemic properties of multi-agent systems via bounded model checking
Fundamenta Informaticae - Concurrency specification and programming
Specification and verification of agent interaction protocols in a logic-based system
Proceedings of the 2004 ACM symposium on Applied computing
Logic in Computer Science: Modelling and Reasoning about Systems
Logic in Computer Science: Modelling and Reasoning about Systems
Annals of Mathematics and Artificial Intelligence
An algebra for commitment protocols
Autonomous Agents and Multi-Agent Systems
Verifying commitment based business protocols and their compositions: model checking using promela and spin
Toward verification of commitment protocols and their compositions
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Implementing commitment-based interactions
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Artificial institutions: a model of institutional reality for open multiagent systems
Artificial Intelligence and Law
Amoeba: A methodology for modeling and evolving cross-organizational business processes
ACM Transactions on Software Engineering and Methodology (TOSEM)
MCMAS: A Model Checker for the Verification of Multi-Agent Systems
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Symbolic model checking for agent interactions
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Behavior-Oriented Commitment-based Protocols
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
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
A complete first-order temporal BDI logic for forest multi-agent systems
Knowledge-Based Systems
A retrospective on the reactive event calculus and commitment modeling language
DALT'11 Proceedings of the 9th international conference on Declarative Agent Languages and Technologies
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
Communicative commitments: Model checking and complexity analysis
Knowledge-Based Systems
Representing and monitoring social commitments using the event calculus
Autonomous Agents and Multi-Agent Systems
PROTOSS: A Run Time Tool for Detecting Privacy Violations in Online Social Networks
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Engineering commitment-based business protocols with the 2CL methodology
Autonomous Agents and Multi-Agent Systems
Detecting and predicting privacy violations in online social networks
Distributed and Parallel Databases
Hi-index | 0.00 |
Social commitments have been widely studied to represent business contracts among agents with different competing objectives in communicating multi-agent systems. However, their formal verification is still an open issue. This paper proposes a novel model-checking algorithm to address this problem. We define a new temporal logic, CTLC, which extends CTL with modalities for social commitments and their fulfillment and violation. The verification technique is based on symbolic model checking that uses ordered binary decision diagrams to give a compact representation of the system. We also prove that the problem of model checking CTLC is polynomial-time reducible to the problem of model checking CTLK, the combination of CTL with modalities for knowledge. We finally present the full implementation of the proposed algorithm by extending the MCMAS symbolic model checker and report on the experimental results obtained when verifying the NetBill protocol.