The Pumping Lemma of Petri Net Language
Jiang Chang · Chinese Journal of Computers · 2006
Petri net language is both an important component of Petri net theory and a good tool for analyzing behavior of a system. The Pumping Lemma of Petri net language reflects some commonness of Petri net language and can be used to prove that some languages is not Petri net language. A Petri net language L, which is produced by a bounded Petri net, has been proved to be a regular language. So the Pumping Lemma of regular language is effective to L. But the Pumping Lemma of regular language is not applicable for any Petri net language. This article gives a Pumping Lemma of Petri net language which is proved to be effective to all Petri net languages without empty-label and the Pumping Lemma of regular languages actually is a special format of the Lemma. By the Lemma, this paper proofs some languages not be produced by any Petri net.