参数化交错多Agent系统的自动验证
Automatic Verification of Parameterised Interleaved Multi-Agent Systems
摘要:
多智能体系统的模型检验验证中的一个关键问题是系统的状态空间随智能体数量呈指数增长。这使得实际的模型检验不可行,只要系统包含几个以上的代理。在本文中,我们提出了一种技术,建立一个截止结果,从而表明,任何数量的代理的所有系统可以通过模型检验一个单一的系统包含的代理数量等于系统的截止验证。虽然这个问题是不可判定的一般,我们在这里定义了一类参数化的解释系统和参数化的时间认知逻辑的结果可以显示。我们在机器人的例子上验证了理论结果,并在多智能体系统的开源模型检查器mcmas上实现了该技术。
英文摘要:
A key problem in verification of multi-agent systems by model checking concerns the fact that the state-space of the system grows exponentially with the number of agents present. This makes practical model checking unfeasible whenever the system contains more than a few agents. In this paper we put forward a technique to establish a cutoff result, thereby showing that all systems of arbitrary number of agents can be verified by model checking a single system containing a number of agents equal to the cutoff of the system. While this problem is undecidable in general, we here define a class of parameterised interpreted systems and a parameterised temporal-epistemic logic for which the result can be shown. We exemplify the theoretical results on a robotic example and present an implementation of the technique on top of mcmas, an open-source model checker for multi-agent systems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。