期刊文献+

基于KQML的多智能体系统建模与验证 被引量:1

A modeling and verification method to multi-agent system based on KQML
下载PDF
导出
摘要 为了保证MAS相关属性的可满足性、有效性以及验证的高效性,提出了一种基于KQML通信语言的MAS建模以及能够实现自动验证相关规范的方法。设计并实现了KQML语言转化为完整描述状态转换关系的一组状态迁移七元组的算法,以及从七元组到多智能体模型检测工具MCMAS输入语言ISPL的转化算法,从而实现多智能体系统的自动形式化建模,并用MCMAS对多智能体系统规范的正确性进行验证。实验结果表明,所提出的算法不仅能够验证多智能体系统的时态规范,还能验证其特有的认知规范。 To ensure the satisfiability and the validation of the related properties and the high efficiency in the multi- agent system, a method for realizing the automatic verification of the related properties and the MAS mode based on the knowledge query manipulate language are introduced. It is designed and realized to translate KQML into seven- tuple which can describe completely the state transition relationship and translate seven-tuple into the input language ISPL of the model checker MCMAS, so as to realize the automatically formal modeling and verify the correctness of the multi-agent system specifications via MCMAS. The experimental result shows that the proposed algorithm can verify not only the temporal specifications but also the epistemic specifications of the multi-agent system.
出处 《桂林电子科技大学学报》 2012年第3期227-232,共6页 Journal of Guilin University of Electronic Technology
基金 国家自然科学基金(61170028) 华侨大学中央高校基本科研业务项目(JB-GJ1001) 华侨大学高层次人才科研启动项目(11BS108)
关键词 KQML 多智能体系统 模型检测 MCMAS KQML multi-agent system model checking MCMAS
  • 相关文献

参考文献1

二级参考文献26

  • 1Emerson E.A.. Branching time temporal logic and the design of correct concurrent programs[Ph.D. dissertation]. Harvard University, Cambridge, MA, 1981
  • 2Sistla A.P., Clarke E.M.. Complexity of propositional temporal logics. Journal of the ACM, 1986, 32(3): 733~749
  • 3Lichtenstein O., Pnueli A.. Checking that finite state concurrent programs satisfy their linear specification. In: Proceedings of the 12th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, New York, 1985, 97~107
  • 4Godefroid P., Pirottin D.. Refining dependencies improves partial-order verification methods (extended abstract). In: Courcoubetis C. ed.. CAV, Lecture Notes in Computer Science 697. Springer, 1993, 438~449
  • 5Peled D.. Combining partial order reductions with on-the-fly model-checking. Formal Methods in System Design, 1996, 8(1): 39~64
  • 6Valmari A.. A stubborn attack on state explosion. Formal Methods in System Design, 1992, 1(4): 297~322
  • 7Burch J.R., Clarke E.M., McMillan K.L., Dill D.L., Hwang L.J.. Symbolic model checking: 1020 states and beyond. In: Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science, Washington, D.C., 1990, 1~33
  • 8Bryant R.E.. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 1992, 24(3): 293~318
  • 9Clarke E.M., Grumberg O., Hamaguchi K.. Another look at ltl model checking. In: Proceedings of the 6th Conference on Computer Aided Verification,Stanford, California, USA, 1994, 415~427
  • 10Kesten Y., Pnueli A., Raviv L.. Algorithmic verification of linear temporal logic specifications. In: Larsen K.G., Skyum S., Winskel G. eds.. ICALP, Lecture Notes in Computer Science 1443. Springer, 1998, 1~16

共引文献23

同被引文献4

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部