| 可达性等价于状态方程可满足性的两个Petri-Nets子类 |
| |
| 引用本文： | 邱经华,吴哲辉.可达性等价于状态方程可满足性的两个Petri-Nets子类[J].系统仿真学报,2003,15(Z1):46-48. |
| |
| 作者姓名： | 邱经华 吴哲辉 |
| |
| 作者单位： | 山东科技大学信息学院,山东,泰安,271019 |
| |
| 基金项目： | 国家自然科学基金(60173053) |
| |
| 摘 要： | 可达性是Petri网的一个基本性质,其判定问题是Petri网理论研究方面的一个重要课题.众所周知,一个Petri网的状态方程可满足性是其可达性的一个必要不充分条件.然而2]证明了,对于活的T-系统,其状态方程可满足性是其可达性的一个充分必要条件.另外3]指出,对于活的加权T-系统,这一点也成立.下面第1部分给出一种包含活T-系统的活Petri网子类,并证明其状态方程可满足性是其可达性的一个充分必要条件.特别地,第2部分提出另一种Petri网子类(可以是不活的),并证明其状态方程可满足性也是其可达性的一个充分必要条件.
|
| 关 键 词： | 可达性 状态方程 状态方程可满足性 活性 |
| 文章编号： | 1004-731X(2003)S1-0046-03 |
| 修稿时间： | 2003年5月21日 |
Two Subclasses of Petri-Nets with Equivalence of Reachability and State Equation Satisfiability |
| |
| QIU Jing-hua,WU Zhe-hui.Two Subclasses of Petri-Nets with Equivalence of Reachability and State Equation Satisfiability[J].Journal of System Simulation,2003,15(Z1):46-48. |
| |
| Authors: | QIU Jing-hua WU Zhe-hui |
| |
| Abstract: | Reachability is one of the most basic properties of Petri-Nets and its decision problem is one of the most important topics in Petri-Nets theory. It is well known that state equation satisfiability is a necessary but not sufficient condition for reachability. However, the two problems are showed to be equivalent for Live T-Systems-a subclass of Petri nets in 2]. Furthermore, 3] tested that the result holds for Live Weighted T-Systems. In following Section 1, a more general subclass of Live Petri-Nets than Weighted T-Systems is proposed and the fact state equation satisfiability is a necessary and sufficient condition for reachability for this subclass is proved. In particular, it is show that without the strong assumption of live Petri-Nets, the subclass proposed in Section 3 enjoys the feature as well. |
| |
| Keywords: | Reachability State equation state equation satisfiability liveness |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
