摘要
文中定义了Petri网的一子类系列:k-选择网,它形成一个后类包含前类的Petri网子类的无穷序列,证明了此无穷序列的并集等于Petri网类,自由选择网是k=1的k-选择网,即1-选择网.在证明自由选择网系统可以用Pi演算表达的基础上,文中进一步证明了所有2-选择网系统可以用Pi演算表达.
To study the expressiveness of the Pi calculus, a subclass series of the Petri nets named κ-choice nets is defined. The κ-choice nets forms an infinite sequence where the predeces- sors include the successors. The union of all the κ-choice nets equals the universal set of Petri nets is proved. Based on the conclusion that the free lus, this paper proves that the 2-choice nets can also choice net can be expressed in the Pi calcu be expressed in the Pi calculus.
出处
《计算机学报》
EI
CSCD
北大核心
2013年第6期1261-1266,共6页
Chinese Journal of Computers
基金
中央高校基本科研业务费(72114431)
西安市科技计划项目(OF0201110403)资助~~
