arrow
返回

Model checking probabilistic social commitments for intelligent agent communication

delete2014-09-01
delete16
PRE
AI
K
Khalid Sultan
J
Jamal Bentahar *
DOI:10.1016/j.asoc.2014.04.014delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Interaction among autonomous agents in Multi-Agent Systems (MASs) is a key aspect for agents to coordinate with one another. Social approaches, as opposed to the mental approaches, have recently received a considerable attention in the area of agent communication. They exploit observable social commitments to develop a verifiable formal semantics through which communication protocols can be specified. Developing and implementing algorithmic model checking for social commitments have been recently addressed. However, model checking social commitments in the presence of uncertainty is yet to be investigated. In this paper, we propose a model checking technique for verifying social commitments in uncertain settings. Social commitments are specified in a modal logical language called Probabilistic Computation Tree Logic of Commitments (PCTLC). The modal logic PCTLC extends PCTL, the probabilistic extension of CTL, with modalities for commitments and their fulfillments. The proposed verification method is a reduction-based model checking technique to the model checking of PCTL. The technique is based upon a set of reduction rules that translate PCTLC formulae to PCTL formulae to take benefit of existing model checkers such as PRISM. Proofs that confirm the soundness of the reduction technique are presented. We also present rules that transform our new version of interpreted systems into models of Markov Decision Processes (MDPs) to be suitable for the PRISM tool. We implemented our approach on top of the PRISM model checker and verified some given properties for the Oblivious Transfer Protocol from the cryptography domain. Our simulation demonstrates the effectiveness of our approach in verifying and model checking social commitments in the presence of uncertainty. We believe that the proposed formal verification technique will advance the literature of social commitments in such a way that not only representing social commitments in uncertain settings is doable, but also verifying them in such settings becomes achievable. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Model checking
Social commitments
Multi-Agent Systems
Autonomous reasoning
Probabilistic logic
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Applied Soft Computing 封面图
Applied Soft Computing
IF:
6.6
论文数:
1.4W
被引数:
4.8W

机构

C
concordia university - canada
学者数:
8.0K
论文数: 8.9K
被引数: 4
引用论文

引用论文

A complete first-order temporal BDI logic for forest multi-agent systems
err2012-03-01
err7
PREAI
errWu, Lijun; Su, Kaile; Sattar, Abdul; Chen, Qingliang; Su, Jinshu; Wu, Wei
err分享
err收藏
err分享
err收藏
Communicative commitments: Model checking and complexity analysis
err2012-11-01
err33
PREAI
errBentahar, Jamal; El-Menshawy, Mohamed; Qu, Hongyang; Dssouli, Rachida
err分享
err收藏
err分享
err收藏
err分享
err收藏
学者 查看更多内容