语言表达式到Petri网模型的转化及其算法  

Algorithm for Constructing Petri Net Based on Language Expression

作　　者：张继军[1] 范昊[1] 

机构地区：[1]山东农业大学信息科学与工程学院,山东泰安271018

出　　处：《小型微型计算机系统》2011年第4期726-731,共6页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(60673053)资助;国家自然科学基金委员会重大研究计划项目(90718011)资助

摘　　要：已知一个语言的表达式,直接构造产生该语言的Petri网模型是Petri网语言理论中一个重要问题.本文分析、研究同步交错正规表达式中各种运算与Petri网模型的对应转换关系,分别给出正规表达式、α闭包表达式到Petri网模型的转换方法;定义了Petri网的有界覆盖合成运算,研究有界覆盖合成网的语言性质,给出将同步交错正规表达式转换为Petri网模型的算法,从而实现了语言表达式到Petri网模型的等价转化.To create a Petri net that the language it produced is equal to a given language express is an important problem in the Petri nets language theory. The relationships between the language operations of synchronization alternate regular expression and the Petri nets compositions are analyzed. The transformation methods that the regular expression and the α-closure expression is created a Petri net are given, The bounded cover composition operation for Petri net is defined and the language properties about bounded cover composition Petri net is researched. The algorithm for constructing Petri net based on language expression is given. It is realized that to create a Petri net that the language it produced is equal to a given language expression.

关 键 词：正规表达式 α闭包表达式 同步交错正规表达式 有界覆盖合成 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]