Two Pumping Lemmata for Petri Nets

A careful analysis of the coverability tree for Petri nets shows that each infinite reachability set contains infinite linear subsets. This can be formulated as a pumping lemma for markings. It can also be shown that the nonterminal Petri net languages satisfy a pumping lemma similar to that for regular languages.Peer Reviewe