| Petri网的可达图与可达树的比较 |
| |
| 引用本文： | 周建涛,叶新铭.Petri网的可达图与可达树的比较[J].内蒙古大学学报(自然科学版),2000,31(1):117-120. |
| |
| 作者姓名： | 周建涛 叶新铭 |
| |
| 作者单位： | 内蒙古大学计算机学院 |
| |
| 摘 要： | Ｐｅｔｒｉ网的可达图和可达树都是用于分析Ｐｅｔｒｉ网的工具，章将展示如何用可产完成Ｐｅｔｒｉ风的各项分析，并将可达图与可达树相比较，证明可达图是较可达树更为有一种分析工具．
|
| 关 键 词： | 可达图 可达树 安全性 有界性 守恒性 Petri网 |
The Comparison of Reachability Graph and Reachability Tree |
| |
| ZHOU Jian tao,YE Xin ming.The Comparison of Reachability Graph and Reachability Tree[J].Acta Scientiarum Naturalium Universitatis Neimongol,2000,31(1):117-120. |
| |
| Authors: | ZHOU Jian tao YE Xin ming |
| |
| Abstract: | Reachability graph and reachability tree are tools for Petri net analysis. We will show how reachability graph to analyse the problem with Petri net. And we will compare it with reachability tree to improve it is stronger than reachability tree. |
| |
| Keywords: | reachability graph reachability tree safeness boundedness conservation liveness reachability coverability |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
