Abstract: This paper presents a new Petri nets model named standard properly end Petri nets. It is proved that the language descriptive ability of standard properly end Petri nets is equal to regular expression. This paper reaches the quality about standard properly end Petri nets operation such as connection, union, kleene closure and concurrence. As essential supplement of formal language theory, the transformation methods from the regular expression with concurrence operation to standard properly end Petri nets is given. The methods from the regular expression to standard properly end Petri nets is given.

Key words: standard properly end Petri nets, Petri nets, regular language, regular expression, language

摘要： 给出了一种较特殊的Petri网子类——恰当终结的标准Petri网，可以证明恰当终结的标准Petri网产生的语言是正规语言，反之任一正规语言都可由恰当终结的标准Petri网产生。研究了恰当终结的标准Petri网语言关于连接运算“ ”、选择(并)运算“∪”、kleene闭包运算“*”、并行运算“//”的性质，给出了用恰当终结的标准Petri网(带空标注)模拟和带并发算子的正规表达式的方法。

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

CLC Number: 

• TP393