| 序佩特里(Petri)网计算能力分析 |
| |
| 引用本文： | 王永革.序佩特里(Petri)网计算能力分析[J].软件学报,1993,4(3):35-41. |
| |
| 作者姓名： | 王永革 |
| |
| 作者单位： | 南开大学数学研究所 天津 300071 |
| |
| 摘 要： | 本文通过引进序Petri网的概念,定义了序Petri网计算机,最后讨论该机器的计算能力:它可以计算所有的一般递归函数。
|
| 关 键 词： | Petri网 序佩特里 计算能力 分析 |
| 收稿时间： | 1990/12/6 0:00:00 |
| 修稿时间： | 1991/3/23 0:00:00 |
ON THE COMPUTING POWER OF ORDERED PETRI NETS |
| |
| Wang Yongge.ON THE COMPUTING POWER OF ORDERED PETRI NETS[J].Journal of Software,1993,4(3):35-41. |
| |
| Authors: | Wang Yongge |
| |
| Abstract: | Based on the parallel computation model Petri Net, we ll introduce a kind of Ordered Petri Nets, whose computing power is much more stronger compared with Petri Net, by giving a partial order on the transition set of Petri Net, and define a parallel model of computing machine: Ordered Petri Net Computing Machine. In the last section, it is proved that this kind of machine can compute all the general recursive functions, and so it can be regarded as the basic model of computing machine. |
| |
| Keywords: | |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
|
