A language measure for partially observed discrete event supervisory control systems

Proceedings of the IEEE Conference on Decision and Control

Volumn 1, Issue , 2004, Pages 45-50

  Chattopadhyay, Ishanu ^a   Ray, Asok ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

Discrete Event Supervisory Control; Language Measure; Partial Observation

Indexed keywords

AUTOMATA THEORY; FORMAL LANGUAGES; FUNCTIONS; MATRIX ALGEBRA; PROBABILITY; SET THEORY; THEOREM PROVING; VECTORS;

DISCRETE EVENT SUPERVISORY CONTROL SYSTEMS; LANGUAGE MEASURE; PARTIAL OBSERVATION; STATE TRANSISTIONS;

SCADA SYSTEMS;

EID: 7544232998     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/cdc.2004.1428604     Document Type: Conference Paper

References (7)

1. J. Fu, A. Ray, and C.M. Lagoa, Unconstrained optimal control of regular languages, Automatica 40 (2004), no. 4, 639-646.
2. J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to automata theory, languages, and computation, 2nd ed., Addison-Wesley, 2001.
3. P. J. Ramadge and W. M. Wonham, Supervisory control of a class of discrete event processes, SIAM J. Control and Optimization 25 (1987), no. 1, 206-230.
4. A. Ray, J. Fu, and C.M. Lagoa, Optimal supervisory control af finite state automata, International Journal of Control (2004), in press.
5. W. Rudin, Real and complex analysis, 3rd ed., McGraw Hill, New York, 1988.
6. A. Surana and A. Ray, Measure of regular languages, Demonstratio Mathematica 37 (2004), no. 2, 485-503.
7. X. Wang and A. Ray, A language measure for performance evaluation of discrete event supervisory control systems, Applied Mathematical Modelling 28 (2004), no. 9, 817-833.