arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.2678cs.MAcs.AIcs.LO
收藏

基于Agent的可重构系统的验证

Verification of Agent-Based Artifact Systems

Laboratoire Ibisc, Université d’Evry(埃夫里大学Ibisc实验室);Imperial College London(帝国理工学院);Università di Roma “La Sapienza”(罗马大学(萨皮恩扎))

Francesco Belardinelli, Alessio Lomuscio, Fabio Patrizi

摘要:

人工智能系统是一种新颖的范例,用于指定和实现业务流程,这些业务流程用称为工件的交互模块来描述。工件由数据和生命周期组成,分别说明工件状态的关系结构和它们随时间的可能演变。在本文中,我们提出了以人为中心的多智能体系统,一种新的形式化的工件系统的背景下,多智能体系统对他们进行操作。与通常的基于流程的服务模型不同,我们给出的语义明确地说明了工件系统所定义的数据结构。我们研究的模型检验问题,以人为中心的多智能体系统对规范写在一个量化的版本的时间认知逻辑表示的代理人的知识在交流。我们首先注意到,这个问题一般是不可判定的。然后,我们确定了两个值得注意的限制,一个语法和语义,使我们能够找到bisilimeric有限的抽象,从而减少有限模型的实例上的模型检验问题。在这些假设下,我们证明了这些系统的模型检验问题是EXPSPACE完全的。然后,我们介绍了以人为中心的程序,紧凑和声明性表示的程序管理的工件系统和代理。我们表明,虽然这些原则上产生无限状态系统,在自然条件下,他们的验证问题可以解决有限的抽象,可以有效地计算程序。最后,我们通过一个主流的采购方案,从工件系统文献的理论结果的文件。

英文摘要:

Artifact systems are a novel paradigm for specifying and implementing business processes described in terms of interacting modules called artifacts. Artifacts consist of data and lifecycles, accounting respectively for the relational structure of the artifacts' states and their possible evolutions over time. In this paper we put forward artifact-centric multi-agent systems, a novel formalisation of artifact systems in the context of multi-agent systems operating on them. Differently from the usual process-based models of services, the semantics we give explicitly accounts for the data structures on which artifact systems are defined. We study the model checking problem for artifact-centric multi-agent systems against specifications written in a quantified version of temporal-epistemic logic expressing the knowledge of the agents in the exchange. We begin by noting that the problem is undecidable in general. We then identify two noteworthy restrictions, one syntactical and one semantical, that enable us to find bisimilar finite abstractions and therefore reduce the model checking problem to the instance on finite models. Under these assumptions we show that the model checking problem for these systems is EXPSPACE-complete. We then introduce artifact-centric programs, compact and declarative representations of the programs governing both the artifact system and the agents. We show that, while these in principle generate infinite-state systems, under natural conditions their verification problem can be solved on finite abstractions that can be effectively computed from the programs. Finally we exemplify the theoretical results of the paper through a mainstream procurement scenario from the artifact systems literature.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑