Signed real measure of regular languages for discrete event supervisory control

This paper reviews, expands, and clarifies the underlying concepts of a signed real measure of regular languages, which has been used as a novel tool for synthesis of discrete event supervisory control systems. The language measure is constructed upon the principles of automata theory and real analysis. It allows total ordering of a set of partially ordered sublanguages of a regular language for quantitative evaluation of the supervised behaviour of deterministic finite state automata (DFSA) under different supervisors. In the setting of the language measure, a supervisor's performance is superior if the supervised plant is more likely to terminate at a good marked state and/or less likely to terminate at a bad marked state. The computational complexity of the language measure algorithm is polynomial in the number of DFSA states.

[1]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.

[2]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[3]  A language measure for partially observed discrete event supervisory control systems , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[4]  Xi-Ren Cao,et al.  Perturbation analysis of discrete event dynamic systems , 1991 .

[5]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[6]  Asok Ray,et al.  Signed real measure of regular languages for discrete-event automata , 2003 .

[7]  J. C. Martin,et al.  Solutions manual to accompany introduction to languages and the theory of computation , 1997 .

[8]  Robert J. Plemmons,et al.  Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.

[9]  Shashi Phoha,et al.  A high-fidelity ocean sampling mobile network (SAMON) simulator testbed for evaluating intelligent control of unmanned underwater vehicles , 2001 .

[10]  Arch W. Naylor,et al.  Linear Operator Theory in Engineering and Science , 1971 .

[11]  Asok Ray,et al.  A language measure for performance evaluation of discrete-event supervisory control systems , 2004 .

[12]  Vijay K. Garg,et al.  Modeling and Control of Logical Discrete Event Systems , 1994 .

[13]  Asok Ray,et al.  J-DES: A graphical interactive package for analysis and synthesis of discrete event systems , 2003, Proceedings of the 2003 American Control Conference, 2003..

[14]  R. Deal.  Simulation Modeling and Analysis (2nd Ed.) , 1994 .

[15]  Asok Ray,et al.  Signed real measure of regular languages , 2002 .

[16]  Asok Ray,et al.  On-line identification of language measure parameters for discrete event supervisory control , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[17]  Jeffrey D. Ullman,et al.  Introduction to automata theory, languages, and computation, 2nd edition , 2001, SIGA.

[18]  Eugene Seneta,et al.  Non‐Negative Matrices , 1975 .

[19]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[20]  Jinbo Fu,et al.  Optimal supervisory control of finite state automata , 2004 .

[21]  Michael A. Arbib,et al.  Topics in Mathematical System Theory , 1969 .