作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (17): 96-98,1. doi: 10.3969/j.issn.1000-3428.2007.17.033

• 软件技术与数据库 • 上一篇    下一篇

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

鲁法明1,包云霞2,岳 昊1   

  1. (1. 山东科技大学信息学院,青岛 266510;2. 山东科技大学理学院,青岛 266510)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-09-05 发布日期:2007-09-05

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

LU Fa-ming1, BAO Yun-xia2 ,YUE Hao1   

  1. (1. School of Information, Shandong University of Science and Technology, Qingdao 266510; 2. College of Science, Shandong University of Science and Technology, Qingdao 266510)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-09-05 Published:2007-09-05

摘要: Hohn F E提出用S-不变量判定Petri网不可达性的一个方法。Desel J指出,存在某些标识,用S-不变量无法判定其不可达性,但利用模-n S-不变量却可加以判定。然而,对于一个给定的标识,是否存在模-n S-不变量能判定该标识的不可达性。如果存在的话,又该如何求取这些模-n S-不变量,Desel J并未就这两个问题给出答案。该文提出了有效模-n S-不变量的概念,将上述问题转化为有效模-n S-不变量的存在性问题,并借助矩阵的整数分解给出了寻找有效模-n S-不变量的方法,有效解决了利用模-n S-不变量进行不可达性判定的问题。

关键词: Petri网, 模-n S-不变量, 不可达性

Abstract: 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.

Key words: Petri nets, modular-n S-invariant, non-reachability property

中图分类号: