Synthesis of maximally permissive and robust supervisors for prefix-closed language specifications

Author

Takai, Shigemasa

Author_Institution

Dept. of Opto-Mechatronics, Wakayama Univ., Japan

Volume

47

Issue

1

fYear

2002

fDate

1/1/2002 12:00:00 AM

Firstpage

132

Lastpage

136

Abstract

J.E.R. Cury and B.H. Krogh (1999) have formulated a robust supervisory control problem to synthesize a supervisor for the nominal plant which maximizes robustness. They have solved the problem by unnecessarily restricting the upper bound of the legal behavior. We show that the problem can be solved without restricting the upper bound of the legal behavior when the specification is described by prefix-closed languages. We synthesize a maximally permissive supervisor for the nominal plant which maximizes not only robustness, but also permissiveness for the maximal set of admissible plant variations

Keywords

discrete event systems; formal languages; optimisation; robust control; DES; admissible plant variations; discrete-event system; legal behavior; maximal set; maximally permissive robust supervisor synthesis; maximally permissive supervisor; nominal plant; prefix-closed language specifications; prefix-closed languages; robust supervisory control problem; robustness; supervisory control; upper bound; Automatic control; Control system synthesis; Control systems; Feedback; Robust control; Robust stability; Robustness; Supervisory control; Topology; Upper bound;

fLanguage

English

Journal_Title

Automatic Control, IEEE Transactions on

Publisher

ieee

ISSN

0018-9286

Type

jour

DOI

10.1109/9.981732

Filename

981732