| Petri网的标注可达 |
| |
| 引用本文： | 蒋昌俊,吴哲辉.Petri网的标注可达[J].软件学报,1993,4(6):22-28. |
| |
| 作者姓名： | 蒋昌俊 吴哲辉 |
| |
| 作者单位： | 山东矿业学院应用数学与软件工程系，泰安 271019;山东矿业学院应用数学与软件工程系，泰安 271019 |
| |
| 基金项目： | 国家自然科学基金;; 中科院自动化所复杂系统控制开放实验室基金资助 |
| |
| 摘 要： | 本文基于Petri网的可达树的概念,给出标注可达树定义,并且证明网N与其标注可达树是一一对应的,然后,我们给出了网N与相应的标注可达树的相互转换算法。
|
| 关 键 词： | 标注可达树 可达树 Petri网 |
| 收稿时间： | 6/1/1991 12:00:00 AM |
LABELED REACHABILITY TREE OF PETRI NETS |
| |
| Jiang Changjun and Wu Zhehui.LABELED REACHABILITY TREE OF PETRI NETS[J].Journal of Software,1993,4(6):22-28. |
| |
| Authors: | Jiang Changjun and 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. |
| |
| Keywords: | |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
