正规表达式到无空标注Petri网的构造方法  

Regular Expression Constructing Methods using no ε-label Petri Nets

作　　者：束德勤[1] 范昊[1] 

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

出　　处：《系统仿真学报》2008年第S2期15-19,24,共6页Journal of System Simulation

基　　金：国家自然科学基金重大研究计划(90718011);国家自然科学基金(60673053;60603090)

摘　　要：已知一个语言表达式或语言的集合,如何直接构造产生该语言的Petri网模型是Petri网语言理论中的一个重要问题。语言表达式到Petri网(无ε-空标注)的转换算法更有难度。研究了恰当终结的标准Petri网语言(无ε-空标注)关于连接算、选择(并)运算、闭包运算、并行运算的性质,在此基础上给出正规表达式到无ε-空标注的恰当终结的标准Petri网的转换算法。作为对传统形式语言的有益补充,还给出了带并发算子"//"的正规表达式到恰当终结的标准Petri网(无ε-空标注)的转换算法。How 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.To transform the regular expression to Petri nets(no ε-label) is more difficult.The properties about the standard properly end Petri net(no ε-label) language operations,such as connection,union,kleene-closure and concurrence,will be researched.Based on those foundations,the transformation algorithms from the regular expression to the standard properly end Petri nets(no ε-label) are given.As an essential complementarily of the formal language theory,the algorithms from the regular expression with concurrence operation to standard properly end Petri nets(no ε-label) are also given.

关 键 词：恰当终结的标准Petri网 PETRI网 正规语言 正规表达式 语言 

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