Weak Petri net languages in supervisory control

Author

Giua, Alessandro ; DiCesare, Frank

Author_Institution

Dept. of Electr. Comput. & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA

fYear

1993

fDate

15-17 Dec 1993

Firstpage

229

Abstract

We present a notion of terminal behavior for place/transition nets, called weak behavior. The classes of weak and marked languages generated by deterministic nets are incomparable. Thus, also taking into account the weak behavior of deterministic nets (in addition to the marked behavior) we extend the control problems that can be modeled by Petri nets. Deterministic weak languages are DP-closed, i.e., they represent closed-loop terminal behaviors that may be enforced by Petri net supervisors. The main properties of interest in supervisory control are decidable when this class of languages is considered. The class of deterministic weak PN languages is not closed under the supremal controllable sublanguage operator

Keywords

Petri nets; formal languages; hierarchical systems; DP-closed languages; Petri net supervisors; closed-loop terminal behaviors; deterministic weak languages; marked languages; place/transition nets; supervisory control; supremal controllable sublanguage operator; weak Petri net languages; Controllability; Discrete event systems; Electronic switching systems; Petri nets; Supervisory control; Systems engineering and theory;

fLanguage

English

Publisher

ieee

Conference_Titel

Decision and Control, 1993., Proceedings of the 32nd IEEE Conference on

Conference_Location

San Antonio, TX

Print_ISBN

0-7803-1298-8

Type

conf

DOI

10.1109/CDC.1993.325158

Filename

325158