An improved approach to test diagnosability of bounded petri nets
An improved approach to test diagnosability of bounded petri nets
复制标题
DOI：
10.1109/jas.2017.7510406
复制
发表时间：
2017-04
期刊：
影响因子：
--
通讯作者：
Ning Ran;H. Su;Shouguang Wang
中科院分区：
文献类型：
--
作者：
Ning Ran;H. Su;Shouguang Wang
对于有界Petri网，Cabasino等人提出了一种基于修改的基可达图和基可达诊断器的可诊断性测试方法。然而，它的复杂性是指数的基础可达性诊断的节点数。为了降低其方法的复杂性，本文提出了一种新的有界Petri网可诊断性测试方法。我们提出了扩展基可达图的概念，并证明了我们的方法是多项式复杂性的扩展基可达图的节点数。最后通过一个实例说明了该方法的应用。
For bounded Petri nets, Cabasino et al. propose a diagnosability test method that is based on the analysis of a modified basis reachability graph and a basis reachability diagnoser. However, its complexity is exponential in the number of nodes of the basis reachability diagnoser. In order to reduce the complexity of their method, this paper presents a new diagnosability test approach for bounded Petri nets. We present the concept of an extended basis reachability graph and prove that our approach is of polynomial complexity in the number of nodes of extended basis reachability graphs. An example is given to illustrate the application of the presented approach.