首页> 外文期刊>Expert systems with applications >Model checking agent-based communities against uncertain group commitments and knowledge
【24h】

Model checking agent-based communities against uncertain group commitments and knowledge

机译:模型检查基于代理的社区对不确定的小组承诺和知识

获取原文
获取原文并翻译 | 示例

摘要

In recent years, the use of Multi-Agent Systems (MASs) to solve complex problems has grown rapidly. Social communicative commitments have been widely employed in such systems as a means of communication allowing heterogeneous agents to cooperate. However, to prevent undesirable outcomes, communicative commitments and their interactions with agents' knowledge need to be verified. This paper aims at verifying MASs where agents have knowledge and communicate through manipulating uncertain social commitments, especially when the scope of commitments moves beyond the common agent-to-agent scheme. We introduce a model checking method for verifying those systems and capitalize on the interaction between not only individual but also group communicative commitments and knowledge in the presence of uncertainty. System's properties are expressed using the Probabilistic Computation Tree Logic of Knowledge and Commitment (PCTLkc+). In the proposed approach, model checking PCTLkc+ is reduced to model checking the probabilistic branching-time logic PCTL. This is achieved by transforming PCTLkc+ model to a Markov Decision Process (MDP), and reducing PCTLkc+ formulae into PCTL formulae compatible with PRISM, a reference model checking tool for probabilistic temporal systems. Thereafter, we provide the soundness and completeness proofs of the reduction technique, and compute its time complexity. The effectiveness of the proposed approach is evaluated by implementing it on top of PRISM using two concrete applications, namely Online Shopping System from the business domain, and Insurance Claim Processing from the industrial domain. The obtained results of the two case studies underscore the scientific value of our proposed framework and confirm that verifying commitment-based probabilistic epistemic MASs has become attainable by utilizing this approach. The presented work outperforms existing proposals because it considers the problem of modeling and verifying MASs where group social commitments are interacting with participating agents' knowledge in the presence of uncertainty, which has not been addressed yet in the literature.
机译:近年来,使用多助理系统(质量)来解决复杂问题已迅速增长。社会交际承诺已被广泛雇用在这些系统中,作为允许异质代理人合作的沟通手段。但是,为了防止不良结果,需要核实交际的承诺和与代理人的知识的互动。本文旨在通过操纵不确定的社会承诺来验证代理商有知识和沟通的弥撒,特别是当承诺的范围超出共同的代理人计划时。我们介绍了一种模型检查方法,用于验证这些系统,并在存在不确定的情况下大写人们之间的互动。使用知识和承诺的概率计算树逻辑表示系统的属性(PCTLKC +)。在所提出的方法中,模型检查PCTLKC +降低到模型检查概率分支时间逻辑PCTL。这是通过将PCTLKC +模型转换为Markov决策过程(MDP),并将PCTLKC +公式转换为与棱镜兼容的PCTL公式,是概率时间系统的参考模型检查工具。此后,我们提供减速技术的声音和完整性,并计算其时间复杂性。通过使用两个具体应用,即来自业务领域的在线购物系统的棱镜,以及来自工业领域的保险索赔加工,通过在棱镜顶部进行评估来评估所提出的方法的有效性。获得的两种案例研究结果强调了我们提出的框架的科学价值,并确认通过利用这种方法可以实现基于承诺的概率认证性质。本工作表现优于现有的建议,因为它考虑了群体社会承诺在不确定性存在下与参与代理商的知识进行互动的建模和验证质量的问题,尚未在文献中尚未解决。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号