一种递归π演算向Petri网的转换方法  

Petri net translation of recursion π-calculus

作　　者：康辉[1] 张双双[1,2] 梅芳[1] 

机构地区：[1]吉林大学,计算机科学与技术学院,长春130012 [2]吉林信息安全测评中心,长春130062

出　　处：《吉林大学学报（工学版）》2014年第1期142-148,共7页Journal of Jilin University:Engineering and Technology Edition

基　　金：国家自然科学基金项目(61073164)

摘　　要：针对π演算中的递归结构,本文给出了一种递归π演算向Petri网的转换方法。该转换遵循基本进程转换规则以及组合规则,采用层次化方法,针对递归次数较多时产生的Petri网结点过多的情况,本文给出了一种更简洁的Petri网表示,它保留了系统的语义,且编码完全相同的轨迹集合,对于在规模较大的复杂系统中应用Petri网模型有着积极的意义。本文还分别证明了递归π演算与转换的Petri网的互模拟等价性以及Petri网与其简洁表示的等价性。In view of the recursive structure in π-calculus, a kind of Petri net translation of recursion π- calculus is presented. Following the basic process translation rules and combination rules, the translation uses the hierarchical method. When the recursive structure executes many times, excessive more Petri net nodes will be generated. To solve this problem, a more compact representation for this Petri net is defined, which preserves the semantics of the system in that it encodes exactly the same set of traces. The bisimulation of recursion n-calculus and the Petri net transition is proved, as well as the equivalence between Petri net and its more compact representation.

关 键 词：计算机软件 递归兀演算转换 层次化方法 Petri网简洁表示 互模拟等价 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]