| 摘要: |
| 本文基于Petri网的可达树的概念,给出标注可达树定义,并且证明网N与其标注可达树是一一对应的,然后,我们给出了网N与相应的标注可达树的相互转换算法。 |
| 关键词: |
| DOI： |
| 分类号: |
| 基金项目:国家自然科学基金;; 中科院自动化所复杂系统控制开放实验室基金资助 |
|
| LABELED REACHABILITY TREE OF PETRI NETS |
|
Jiang Changjun,Wu Zhehui
|
| Abstract: |
| The definition of labeled reachability tree of Petri nets is given in this paper. It is based on the concept of reachability tree of Petri nets. It can be proved that there exists an one correspondence between the set of Petri nets and the set of label reachability trees more over. An algorithm for transforming and in algorithm for transforming labeled reachability trees to their corresponding nets are given. |
| Key words: |
