|
|
软件学报 1993
ON THE COMPUTING POWER OF ORDERED PETRI NETS
|
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.
