| 基于Petri网的互斥算法 |
| |
| 引用本文： | 秦奋涛.基于Petri网的互斥算法[J].高师理科学刊,2001,21(2):25-26. |
| |
| 作者姓名： | 秦奋涛 |
| |
| 作者单位： | 张家口师范专科学校,计算机系,河北,张家口,075028 |
| |
| 摘 要： | 使用库所 /变迁网来描述进程的互斥算法 ,并针对两个进程交替进入临界段算法的不足 ,提出了一种高效率的改进算法
|
| 关 键 词： | 进程 临界资源 临界段 互斥 Petri网 库所/变迁网 |
| 文章编号： | 1007-9831(2001)02-0025-02 |
| 修稿时间： | 2000年12月19 |
Petri nets based mutual exclusion algorithms |
| |
| QIN Fen,tao.Petri nets based mutual exclusion algorithms[J].Journal of Science of Teachers＇College and University,2001,21(2):25-26. |
| |
| Authors: | QIN Fen tao |
| |
| Abstract: | The mutual exclusion algorithms between processes are described by means of place/transition nets.Against the shortcoming of the algorithm by which two processes alternate in going critical section,a highly efficient algorithm is presented. |
| |
| Keywords: | process critical resource critical section mutual exclusion Petri net place/transition net |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
