首页> 外文期刊>Programming and Computer Software >Systems of Agents Controlled by Logical Programs: Complexity of Verification
【24h】

Systems of Agents Controlled by Logical Programs: Complexity of Verification

机译:逻辑程序控制的代理系统:验证的复杂性

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

摘要

The complexity of the verification problem for the behavior (dynamical properties) of systems of interacting intelligent agents is considered. This paper is a continuation of our publications [1-3], in which this problem was mainly considered as applied to deterministic and nondeterministic systems, and largely focuses on asynchronous systems.
机译:考虑了交互智能代理系统的行为(动态特性)验证问题的复杂性。本文是我们出版物[1-3]的延续,其中,该问题主要被认为适用于确定性和非确定性系统,并且主要关注异步系统。

著录项

  • 来源
    《Programming and Computer Software》 |2009年第5期|266-281|共16页
  • 作者单位

    Keldysh Institute of Applied Mathematics, Russian Academy of Sciences, Miusskaya pl. 1, Moscow, 125047 Russia;

    Tver State University, ul. Zhelyabova 3, Tver, 170013 Russia;

    University of Nantes, 2 rue de la Houssiniere, BP 92208, 44322 Nantes Cedex 3, France;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号