k-选择网和Pi演算的表达能力

摘要

文中定义了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 k-choice nets is defined.The k-choice nets forms an infinite sequence where the predecessors include the successors.The union of all the k-choice nets equals the universal set of Petri nets is proved.Based on the conclusion that the free choice net can be expressed in the Pi calculus,this paper proves that the 2-choice nets can also be expressed in the Pi calculus.