摘要
本文通过引进序Petri网的概念,定义了序Petri网计算机,最后讨论该机器的计算能力:它可以计算所有的一般递归函数。
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.
出处
《软件学报》
EI
CSCD
北大核心
1993年第3期35-41,共7页
Journal of Software
基金
国家自然科学基金资助
