%0 Journal Article
%T ON THE COMPUTING POWER OF ORDERED PETRI NETS<br>序佩特里(Petri)网计算能力分析
%A Wang Yongge
%A <br>王永革
%J 软件学报
%D 1993
%I 
%X 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.
%K Petri网
%K 序佩特里
%K 计算能力
%K 分析
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=AD20CABC9983FB85C07E6BD0764E89B2&yid=D418FDC97F7C2EBA&vid=E158A972A605785F&iid=38B194292C032A66&sid=6209D9E8050195F5&eid=2001E0D53B7B80EC&journal_id=1000-9825&journal_name=软件学报&referenced_num=1&reference_num=6