Effective control synthesis for DES under partial observations

Author

Lamouchi, Hichem ; Thistle, John

Author_Institution

Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada

Volume

1

fYear

2000

fDate

2000

Firstpage

22

Abstract

A procedure is given for the effective solution of an infinite-string supervisory control problem under partial observations, for the case where the plant and specification languages are represented by finite ω-automata (automata on infinite strings), and the observation mask by a finite Moore automaton. This solves an ω-language version of the standard centralized supervisory control problem under partial observations. It is shown that a natural extension to decentralized control is undecidable, even if the plant, the specification languages and the masks are represented by finite automata. This undecidability result carries over to the finite-string case

Keywords

control system synthesis; decidability; discrete event systems; finite automata; formal languages; ω-language; effective control synthesis; finite ω-automata; finite Moore automaton; infinite-string supervisory control problem; partial observations; specification languages; undecidability; Automata; Automatic control; Centralized control; Control system synthesis; Discrete event systems; Distributed control; Specification languages; Supervisory control; System recovery;

fLanguage

English

Publisher

ieee

Conference_Titel

Decision and Control, 2000. Proceedings of the 39th IEEE Conference on

Conference_Location

Sydney, NSW

ISSN

0191-2216

Print_ISBN

0-7803-6638-7

Type

conf

DOI

10.1109/CDC.2000.912726

Filename

912726