| Petri网的依赖关系 |
| |
| 引用本文： | 韩莹洁,吴哲辉,孙永强. Petri网的依赖关系[J]. 小型微型计算机系统, 2001, 22(7): 827-829 |
| |
| 作者姓名： | 韩莹洁 吴哲辉 孙永强 |
| |
| 作者单位： | 1. 上海交通大学计算机系
2. 山东科技大学计算机系 |
| |
| 摘 要： | 为了分析变迁不处于公平关系或弱公平关系时在运行中的依赖关系，本文提出了公平依赖和弱公平依赖的概念。研究了伪可重复向量的性质及在判断公平依赖关系时起的作用。给出了判断变迁处于公平依赖关系和弱公平依赖关系的充分必要条件。
|
| 关 键 词： | 公平关系 弱公平关系 公平依赖关系 Petri网 |
| 文章编号： | 1000-1220(2001)07-0827-03 |
Dependence Relations in Petri Nets |
| |
| HAN Ying jie WU Zhe hui SUN Yong qiang. Dependence Relations in Petri Nets[J]. Mini-micro Systems, 2001, 22(7): 827-829 |
| |
| Authors: | HAN Ying jie WU Zhe hui SUN Yong qiang |
| |
| Affiliation: | HAN Ying jie 1 WU Zhe hui 2 SUN Yong qiang 1 1 |
| |
| Abstract: | In order to analyze the dependence relations between the firing of transitions in case they are not in fair relations or weak fair relations, fair dependence relation and weak fair dependence relation are presented in this paper. The characteristics of the pseudo repetitive vectors and their effects in deciding whether two transitions are in fair dependence relation are analyzed. The necessary and sufficient conditions are also given to decide the fair dependence relations and weak fair dependence relations between two transitions. |
| |
| Keywords: | Fair relation Weak fair relation Fair dependence relation Weak fair dependence relation Repetitive vector Pseudo repetitive vector |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
