正规表达式与恰当终结的标准Petri网(英文)

Regular Expression and Standard Properly End Petri Net

已知一个语言表达式或语言的集合,如何构造产生该语言的Petri网模型是Petri网语言理论中的一个重要问题。为解决这个问题,引入一种称为恰当终结的标准Petri网模型。研究了恰当终结的标准Petri网语言(无ε-空标注)关于连接算""、选择(并)运算"+"、kleene闭包运算"+"、并行运算"//"的性质,证明了恰当终结的标准Petri网语言与正规语言的等价性,并给出了正规表达式到恰当终结的标准Petri网(带ε-空标注)的转换算法。作为对传统形式语言的有益补充,还给出了带并发算子的正规表达式到恰当终结的标准Petri网(带ε-空标注)的转换算法。

The method to create a Petri net according to a known language expression or a language set is an important problem in Petri net language theory. In order to resolve this problem,a new Petri net model named standard properly end Petri net was introduced. The properties of operations in standard properly end Petri net,such as connection,union,kleene closure and concurrence,were researched. The equivalence between standard properly end Petri net language and regular language was proved. And the transformation method from regular expression to standard properly end Petri net （with empty-label） was given. Fourth more,the transformation method from the regular expression with concurrence operation to standard properly end Petri net （without empty-label） was given as an essential complement of formal language theory.