摘要
给出了Petri网的语言等价性概念和有界Petri网的最小化概念;证明了有限状态自动机、有界Petri网、正规文法的等价性,给出了它们之间等价转换的算法;分析了有界Petri网的化简过程,并给出了有界Petri网最小化化简的算法,为有界Petri网的自动化化简提供了方法。
The concepts of language equivalence of Petri net and of minimization of bounded Petri net are presented. The equivalences of bounded Petri net, finite automaton and regular grammar is proofed, the algorithms of equivalence transition are given. The process of bounded Petri net simplification is discussed, the algorithm of simplification of bounded Petri net is given. A basic method to automated simplify the bounded Petri net is provided.
出处
《计算机科学》
CSCD
北大核心
2007年第11期26-28,61,共4页
Computer Science
关键词
PETRI网
语言等价
最小化
化简
Petri net,Language equivalence, Minimization, Simplification
