DocumentCode
3158764
Title
On language convergence in discrete-event systems
Author
Willner, Yosef ; Heymann, Michael
Author_Institution
Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel
fYear
1991
fDate
5-7 Mar 1991
Firstpage
83
Lastpage
86
Abstract
Uses the formalism of ω-languages, that is, formal languages consisting of infinite strings. The behavior of a DES P converges to a given ω-language E if after a finite number of state transitions, P executes only infinite strings that belong to E . The authors investigate the problem of synthesizing a supervisor under which the closed-loop system converges to E
Keywords
closed loop systems; discrete time systems; formal languages; ω-languages; DES; closed-loop system; discrete-event systems; formal languages; infinite strings; language convergence; state transitions; Automata; Automatic control; Computer science; Control systems; Convergence; Discrete event systems; Formal languages; Law; Legal factors; Terminology;
fLanguage
English
Publisher
ieee
Conference_Titel
Electrical and Electronics Engineers in Israel, 1991. Proceedings., 17th Convention of
Conference_Location
Tel Aviv
Print_ISBN
0-87942-678-0
Type
conf
DOI
10.1109/EEIS.1991.217706
Filename
217706
Link To Document