Summary
This chapter formulates a signed real measure of sublanguages of a regular language based on the principles of automata theory and real analysis. The measure allows total ordering of a set of partially ordered sublanguages of the regular language for quantitative evaluation of the controlled behavior 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C.G. Cassandras and S. Lafortune, Introducrion to discrete event systems, Kluwer Academic, 1999.
A. Doucet, S. Godsill, and C. Andrieu, On sequential monte carlo sampling methods for bayesian filtering, Statistics and Computing 10 (2000), no. 3, 197–208.
V. Drobot, Formal languages and automata theory, Computer Science Press, 1989.
J. Fu, A. Ray, and C.M. Lagoa, Optimal control of regular languages with event disabling cost, Proceedings of American Control Conference, Denver, Colorado, June 2003, pp. 1691–1695.
J. Fu, A. Ray, and C.M. Lagoa, Unconstrained optimal control of regular languages, Automatica 40 (2004), no. 4, 639–648.
P.R. Halmos, Measure theory, 2nd ed., Springer-Verlag, 1974.
J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to automata theory, languages, and computation, 2nd ed., Addison-Wesley, 2001.
R. Kumar and V. Garg, Modeling and control of logical discrete event systems, Kluwer Academic, 1995.
J. C. Martin, Introduction to languages and the theory of computation, 2nd ed., McGraw-Hill, 1997.
A.W. Naylor and G.R. Sell, Linear operator theory in engineering and science, Springer-Verlag, 1982.
S. Phoha, E. Peluso, and R.L. Culver, A high fidelity ocean sampling mobile network (samon) simulator, IEEE Journal of Oceanic Engineering, Special Issue on Autonomous Ocean Sampling Networks 26 (2002), no. 4, 646–653.
R. J. Plemmons and A. Berman, Nonnegative matrices in the mathematical science, Academic Press, New York, 1979.
M. Pradhan and P. Dagum, Optimal monte carlo estimation of belief network inference, Twelfth Conference on Uncertainty in Artificial Intelligence (Portland, OR), 1996, pp. 446–453.
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.
A. Ray and S. Phoha, Signed real measure of regular languages for discrete-event automata, Int. J. Control 76 (2003), no. 18, 1800–1808.
W. Rudin, Real and complex analysis, 3rd ed., McGraw-Hill, New York, 1987.
E. Senata, Non-negative matrices, John Wiley, New York, 1973.
R. Sengupta and S. Lafortune, An optimal control theory for discrete event systems, SIAM J. Control and Optimization 36 (1998), no. 2, 488–541.
A. Surana and A. Ray, Signed real measure of regular languages, Demonstratio Mathematica 37 (2004), no. 2, 485–503.
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.
X. Wang, A. Ray, S. Phoha, and J. Liu, J-des: A graphical interactive package for analysis and synthesis of discrete event systems, Proceedings of American Control Conference (Denver, Colorado), June 2003, pp. 3405–3410.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Ray, A., Wang, X. (2005). Signed Real Measure of Regular Languages. In: Ray, A., Phoha, V.V., Phoha, S.P. (eds) Quantitative Measure for Discrete Event Supervisory Control. Springer, New York, NY. https://doi.org/10.1007/0-387-23903-0_1
Download citation
DOI: https://doi.org/10.1007/0-387-23903-0_1
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-02108-9
Online ISBN: 978-0-387-23903-3
eBook Packages: Computer ScienceComputer Science (R0)