有效模-n S-不变量与不可达性判定  

Effective Modular-n S-invariant and Non-reachability Decidability

作　　者：鲁法明[1] 包云霞[2] 岳昊[1] 

机构地区：[1]山东科技大学信息学院,青岛266510 [2]山东科技大学理学院,青岛266510

出　　处：《计算机工程》2007年第17期96-98,101,共4页Computer Engineering

基　　金：国家自然科学基金(60173053)

摘　　要：Hohn F E提出用S-不变量判定Petri网不可达性的一个方法。Desel J指出,存在某些标识,用S-不变量无法判定其不可达性,但利用模-n S-不变量却可加以判定。然而,对于一个给定的标识,是否存在模-n S-不变量能判定该标识的不可达性。如果存在的话,又该如何求取这些模-n S-不变量Desel J并未就这两个问题给出答案。该文提出了有效模-n S-不变量的概念,将上述问题转化为有效模-n S-不变量的存在性问题,并借助矩阵的整数分解给出了寻找有效模-n S-不变量的方法,有效解决了利用模-n S-不变量进行不可达性判定的问题。A method to decide the non-reachability of a marking using S-invariants is provided by Hohn F E： In fact, there exists some markings, the non-decidability of which can not be decided with S-invariants. But it can be decided with modular-n S-invariants. Desel J points it out in reference two. However, whether or not there exists some modular-n S-invariant, which can be used to decide the non-reachability property of a marking？ And if such modular-n S-invariant exists, how to find it？ There is no answer to both of the questions. The definition of effective modular-n S-invarients is given, and both of the problems can be solved with effective modular-n S-invarients. Furthermore, a method to find the effective modular-n S-invarients using the matrix integral decomposition is presented.

关 键 词：PETRI网 模-nS-不变量 不可达性 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]