| T-网的活性分析及其判断算法 |
| |
| 引用本文： | 段华,曾庆田.T-网的活性分析及其判断算法[J].小型微型计算机系统,2005,26(12):2131-2134. |
| |
| 作者姓名： | 段华 曾庆田 |
| |
| 作者单位： | 1. 上海交通大学,应用数学系,上海,200030;山东科技大学,信息科学与工程学院,山东,青岛,266510
2. 山东科技大学,信息科学与工程学院,山东,青岛,266510 |
| |
| 基金项目： | 国家自然科学基金项目（10171055,60173053和60274063）资助;山东省中青年科学家科研奖励基金（02BS069）资助. |
| |
| 摘 要： | Petri网的活性反映了实际系统的元死锁性.本文讨论了一类结构简单的Petri网-T-网的活性问题,给出了各类T-网的活性判定定理并给出了判定算法.算法主要计算工作是变迁的前序库所集和后继变迁集以及回路的判断,这三个过程实际上是一个树的搜索过程,因此算法易于实现,判定效率也大大提高.
|
| 关 键 词： | Petri网 T-网 T-图 活性 算法 |
| 文章编号： | 1000-1220（2005）12-2131-04 |
| 收稿时间： | 2004-06-02 |
| 修稿时间： | 2004-06-02 |
Decision Algorithm for the Liveness of T-Nets |
| |
| DUAN Hua,ZENG Qing-tian.Decision Algorithm for the Liveness of T-Nets[J].Mini-micro Systems,2005,26(12):2131-2134. |
| |
| Authors: | DUAN Hua ZENG Qing-tian |
| |
| Abstract: | The liveness is an important property for Petri net, and it is difficult to decide whether a Petri net is live or not. In this paper, we have a research on the liveness of T-net, which is a kind of structure-simple Petri net. A set of decision conditions about the liveness of T-net and the algorithm to judge the liveness of each transition are presented. The algorithm is efficient and easy to realize because it is based on searching the maximum strong connected sub nets and the preset and post place set of transitions. The decision of the liveness of the structure-complex Petri nets will benefit the results obtained based on the decomposition methods for Petri net. |
| |
| Keywords: | Petri net T-net T-graph liveness algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
