Title :
Deterministic weak-and-marked Petri net languages are regular
Author :
Gaubert, Stéphane ; Giua, Alessandro
Author_Institution :
Inst. Nat. de Recherche en Inf. et Autom., Le Chesnay, France
fDate :
12/1/1996 12:00:00 AM
Abstract :
The intersection of the class of deterministic weak and the class of deterministic marked Petri net languages is the class of regular languages. We prove this result using a lemma that characterizes regular deterministic Petri net languages
Keywords :
Petri nets; formal languages; deterministic marked Petri net language; deterministic weak Petri net language; regular languages; Controllability; Discrete event systems; Linear matrix inequalities; Notice of Violation; Petri nets; Riccati equations; Sparse matrices; Supervisory control; Testing; Upper bound;
Journal_Title :
Automatic Control, IEEE Transactions on
