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

IEEE Transactions on Automatic Control

Volumn 47, Issue 1, 2002, Pages 132-136

  Takai, Shigemasa ^a  

^a WAKAYAMA UNIVERSITY   (Japan)

Author keywords

Discrete event system (DES); Maximally permissive supervisor; Robustness; Supervisory control

Indexed keywords

AUTOMATA THEORY; BOUNDARY CONDITIONS; CLOSED LOOP CONTROL SYSTEMS; CONSTRAINT THEORY; CONTROLLABILITY; DISCRETE TIME CONTROL SYSTEMS; FORMAL LANGUAGES; MATHEMATICAL MODELS; ROBUSTNESS (CONTROL SYSTEMS); SCADA SYSTEMS; SET THEORY; STATE SPACE METHODS;

DISCRETE EVENT SYSTEMS; MAXIMALLY PERMISSIVE SUPERVISOR; PREFIX CLOSED LANGUAGE;

CONTROL SYSTEM SYNTHESIS;

EID: 0036257331     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/9.981732     Document Type: Article

References (12)

1. Formulas for calculating supremal controllable and normal sublanguages
2. Incremental model evolution and reusability of supervisors for discrete event systems
3. Limited lookahead policies in supervisory control of discrete event systems
4. Robustness of supervisors for discrete-event systems
5. Extremal solutions of inequations over lattices with applications to supervisory control
6. On controllability and normality of discrete event dynamical systems
7. Robust and adaptive supervisory control of discrete event systems
8. Supervisory control of a class of discrete-event processes
9. Robust supervisory control of a class of timed discrete event systems under partial observation
10. On the supremal controllable sublanguage of a given language