Blocking and controllability of Petri nets in supervisory control

Author

Giua, Alessandro ; DiCesare, Frank

Author_Institution

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

Volume

39

Issue

4

fYear

1994

fDate

4/1/1994 12:00:00 AM

Firstpage

818

Lastpage

823

Abstract

This note discusses the use of Petri net languages in supervisory control theory. First it is shown that the trimming of an unbounded Petri net is not always possible and a new class of Petri net languages, that may be generated by nonblocking nets, is defined. Secondly, necessary and sufficient conditions for the existence of a Petri net supervisor, under the hypothesis that the system´s behavior and the legal behavior are both Petri net languages, are derived. Finally, by means of an example, it is shown that Petri net languages are not closed under the supremal controllable sublanguage operator

Keywords

Petri nets; controllability; discrete time systems; formal languages; Petri net languages; Petri net supervisor; blocking; controllability; necessary and sufficient conditions; nonblocking nets; supervisory control; supremal controllable sublanguage operator; unbounded Petri net; Automata; Control systems; Control theory; Controllability; Formal languages; Law; Legal factors; Petri nets; Sufficient conditions; Supervisory control;

fLanguage

English

Journal_Title

Automatic Control, IEEE Transactions on

Publisher

ieee

ISSN

0018-9286

Type

jour

DOI

10.1109/9.286260

Filename

286260