On the language generated under fully decentralized supervision

Author

Takai, Shigemasa

Author_Institution

Dept. of Opto-Mechatronics, Wakayama Univ.

Volume

43

Issue

9

fYear

1998

fDate

9/1/1998 12:00:00 AM

Firstpage

1253

Lastpage

1256

Abstract

This paper studies the language generated under fully decentralized supervision proposed by Kozak and Wonham (1995). The author assumes that desirable behavior is specified as a closed language. A closed-form expression for the language generated under fully decentralized supervision is presented. It is shown that the generated language is larger than the supremal closed, controllable, and strongly decomposable sublanguage. Moreover, a necessary and sufficient condition is derived for the generated language to be the supremal closed and controllable sublanguage

Keywords

automata theory; controllability; decentralised control; discrete event systems; specification languages; automata theory; closed-form expression; controllability; decentralized supervision; discrete event systems; necessary condition; specification language; sublanguage; sufficient condition; supervisory control; Automatic generation control; Centralized control; Closed-form solution; Communication system control; Control systems; Controllability; Discrete event systems; Optimal control; Sufficient conditions; Supervisory control;

fLanguage

English

Journal_Title

Automatic Control, IEEE Transactions on

Publisher

ieee

ISSN

0018-9286

Type

jour

DOI

10.1109/9.718609

Filename

718609