Modular Reachability Analysis of Petri Nets for Multiagent Systems
Modular Reachability Analysis of Petri Nets for Multiagent Systems
复制标题
多智能体系统Petri网的模块化可达性分析
DOI：
10.1109/tsmc.2013.2250278
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
Toshiyuki Miyamoto and Kyota Horiguchi
中科院分区：
文献类型：
--
作者：
Shota Itokawa;Shun Shiramatsu;Tadachika Ozono;Toramatsu Shintani;Toshiyuki Miyamoto and Kyota Horiguchi
基于代理或基于多代理的方法已被用于解决各种各样的问题。多智能体网络是扩展Petri网的一种变体，是多智能体系统的一种正式的模型描述语言。可以模拟感兴趣的系统，并使用多智能体网络模型检查其属性。可达性分析是检查系统可达性的一种强大的分析方法，但遗憾的是，对于一般Petri网来说，可达性检查的复杂性非常高。模块化Petri网被提出以模块化的方式来描述离散事件系统。本文利用模块化Petri网对多智能体网络进行了可达性分析，提出了一套从多智能体网络基本类到模块化Petri网的转换规则，并证明了多智能体网络的状态空间与生成的模块化Petri网的状态空间同构。我们的实证评估结果表明了所提出方法的有效性。
Agent-based or multiagent-based methods have been used to solve a wide variety of problems. Multiagent nets are a variant of extended Petri nets, and they are a formal model-description language for multiagent systems. A system of interest can be simulated, and its properties can be checked by using a multiagent-net model. Reachability analysis is a powerful analysis method to check the reachability property of a system, but unfortunately, the complexity of reachability checking for general Petri nets is EXPSPACE-hard. Modular Petri nets have been proposed to describe discrete-event systems in a modular way. This paper performs a reachability analysis of multiagent nets by using modular Petri nets, proposes a set of transformation rules from a fundamental class of multiagent nets into modular Petri nets, and proves the isomorphism of the state spaces of the multiagent nets and of the generated modular Petri nets. Results of our empirical evaluations show the effectiveness of the proposed method.