.png){kind=icon}
返回
Communicative commitments: Model checking and complexity analysis
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2012.04.010.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We refine CTLC, a temporal logic of social commitments that extends CTL to allow reasoning about commitments agents create when communicating and their fulfillment. We present axioms of commitments and their fulfillment and provide the associated BDD-based model checking algorithms. We also analyze the time complexity of CTLC model checking in explicit models (i.e., Kripke-like structures) and its space complexity for concurrent programs, which provide compact representations. We prove that although CTLC extends CTL, their model checking algorithms still have the same time complexity for explicit models, which is P-complete with regard to the size of the model and length of the formula, and the same complexity for concurrent programs, which is PSPACE-complete with regard to the size of the components of these programs. We fully implemented the proposed algorithms on top of MCMAS, a model checker for the verification of multi-agent systems, and provide in this paper simulation results of an industrial case study. (C) 2012 Elsevier B.V. All rights reserved.
Keyword:
Multi-agent systems
Social commitments
Agent communication
Model checking
Complexity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Synthesis, Characterisation and Catalytic Application of Oxidorhenium Complexes Bearing H‐Spirophosphorane Ligands含h-螺膦配体的氧化铼配合物的合成，表征及催化应用
.png){kind=icon}
PREAI
分享收藏
分享收藏
查看更多内容