On deadlock-free modular supervisory control of discrete-event systems

Author

Li, Yonghua

Author_Institution

Dept. of Electr. & Comput. Eng., Wayne State Univ., Detroit, MI, USA

Volume

42

Issue

12

fYear

1997

fDate

12/1/1997 12:00:00 AM

Firstpage

1705

Lastpage

1708

Abstract

In this paper the problem of synthesizing deadlock-free modular supervisors for discrete-event systems is discussed. By introducing the d-invariant relation between a pair of supervisors, it is shown that when the control objective is described in terms of intersection of two languages, a necessary and sufficient condition for the modular supervisor to be deadlock-free is that this pair of subsupervisors satisfies a d-invariant relation. A procedure for synthesizing the deadlock-free modular supervisor is presented. Some issues concerning deadlock-free modular supervisory control are also discussed

Keywords

automata theory; computational complexity; controllability; discrete event systems; set theory; automata; computational complexity; controllability; deadlock-free modular supervisors; discrete-event systems; necessary condition; set theory; sufficient condition; supervisory control; Automata; Automatic control; Communication system control; Control system synthesis; Discrete event systems; Educational institutions; Processor scheduling; Sufficient conditions; Supervisory control; System recovery;

fLanguage

English

Journal_Title

Automatic Control, IEEE Transactions on

Publisher

ieee

ISSN

0018-9286

Type

jour

DOI

10.1109/9.650022

Filename

650022