Title :
Some results on Petri net languages
Author :
Lafortune, Stephane ; Yoo, Hyuck
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA
fDate :
4/1/1990 12:00:00 AM
Abstract :
Various classes of Petri net languages are compared. A constructive proof of the equivalence, from the point of view of descriptive power of general Petri nets and restricted Petri nets (no multiple arcs of self-loops are allowed in the latter class), is presented. The descriptive power of Petri nets versus that of finitely recursive processes is discussed
Keywords :
Petri nets; formal languages; Petri net languages; descriptive power; formal languages; recursive processes; Bipartite graph; Computer hacking; Control system analysis; Control theory; Discrete event systems; Fiber reinforced plastics; Formal languages; Labeling; Petri nets; Terminology;
Journal_Title :
Automatic Control, IEEE Transactions on
