The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Reasoning about knowledge
Model checking
Operational specification of a commitment-based agent communication language
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Verifying Compliance with Commitment Protocols
Autonomous Agents and Multi-Agent Systems
Efficient Model Checking Via Büchi Tableau Automata
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
Guaranteeing Properties for E-commerce Systems
AAMAS '02 Revised Papers from the Workshop on Agent Mediated Electronic Commerce on Agent-Mediated Electronic Commerce IV, Designing Mechanisms and Systems
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Verifying epistemic properties of multi-agent systems via bounded model checking
Fundamenta Informaticae - Concurrency specification and programming
Annals of Mathematics and Artificial Intelligence
Design time analysis of multiagent protocols
Data & Knowledge Engineering
Symbolic model checking of institutions
Proceedings of the ninth international conference on Electronic commerce
Verifying commitment based business protocols and their compositions: model checking using promela and spin
Proving the Correctness of Multiprocess Programs
IEEE Transactions on Software Engineering
Toward verification of commitment protocols and their compositions
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Symbolic Model Checking of Logics with Actions
Model Checking and Artificial Intelligence
MCMAS: A Model Checker for the Verification of Multi-Agent Systems
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Automatic verification of knowledge and time with NuSMV
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Formalizing communication protocols for multiagent systems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Specifying and implementing a persuasion dialogue game using commitments and arguments
ArgMAS'04 Proceedings of the First international conference on Argumentation in Multi-Agent Systems
Producing compliant interactions: conformance, coverage, and interoperability
DALT'06 Proceedings of the 4th international conference on Declarative Agent Languages and Technologies
A complete first-order temporal BDI logic for forest multi-agent systems
Knowledge-Based Systems
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
Constitutive and regulative specifications of commitment protocols: A decoupled approach
ACM Transactions on Intelligent Systems and Technology (TIST) - Special section on agent communication, trust in multiagent systems, intelligent tutoring and coaching systems
Representing and monitoring social commitments using the event calculus
Autonomous Agents and Multi-Agent Systems
Hi-index | 0.00 |
Using model checking to verify that interaction protocols have given properties is widely recognized as an important issue in multiagent systems where autonomous and heterogeneous agents need to successfully regulate and coordinate their interactions. In this paper, we investigate the use of symbolic model checkers to verify the compliance of a special kind of interaction protocols called commitment protocols with some properties such as liveness and safety. These properties are expressed as formulae in a new temporal logic, called CTLC, which extends the temporal logic CTL with modality for social commitments. Our approach shows that the problem of model checking CTLC can be reduced to the problem of model checking either CTLK or ARCTL, which are extensions of CTL. We finally present an implementation and report on the experimental results of verifying the Contract Net Protocol modeled in terms of commitments and associated actions using the symbolic model checkers MCMAS and extended NuSMV.