A probabilistic language formalism for stochastic discrete-event systems

IEEE Transactions on Automatic Control

Volumn 44, Issue 2, 1999, Pages 280-293

  Garg, Vijay K ^a   Kumar, Ratnesh ^b   Marcus, Steven I ^c  

^a The University of Texas at Austin   (United States)

^b UNIVERSITY OF KENTUCKY   (United States)

^c UNIVERSITY OF MARYLAND   (United States)

Author keywords

Automata; Completion time; Discrete event systems; Languages; Regularity; Reliability; Stochastic systems

Indexed keywords

AUTOMATA THEORY; CONTROL SYSTEM ANALYSIS; DISCRETE TIME CONTROL SYSTEMS; MATHEMATICAL MODELS; PROBABILITY;

CONTRACTION MAPPING THEOREM; DISCRETE EVENT SYSTEMS; PROBABILISTIC LANGUAGES;

STOCHASTIC CONTROL SYSTEMS;

EID: 0033079294     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/9.746254     Document Type: Article

References (22)

1. J. Berstel and C. Reutenauer. Rational Series and Their Languages New York: Springer-Verlag, 1988.
2. C. G. Cassandras, Discrete Event Systems: Modeling and Performance Analysis. Boston, MA: Aksen, 1993.
3. B. A. Davey and H. A. Priestley, Introduction to Lattices and Order. Cambridge, U.K.: Cambridge Univ. Press, 1990.
4. E. Doberkat, Stochastic Automata: Stability, Nondeterminism and Prediction, Lecture Notes in Computer Science, vol. 113. New York: Springer-Verlag, 1981.
5. W. Feller, An Introduction to Probability Theory and Its Applications, vol. 1, 2nd ed. New York: Wiley, 1966.
6. V. K. Garg, "An algebraic approach to modeling probabilistic discrete event systems," in Proc. 1992 IEEE Conf. Decision and Control, Tucson, AZ, Dec. 1992, pp. 2343-2353.
7. _, "Probabilistic languages for modeling of DEDS," in Proc. Conf. Information Sciences and Systems, Princeton, NJ, Mar. 1992, pp. 198-203.
8. G. Hansel and D. Perrin, "Mesures de probabilites rationnelles," Mots, Hermes, 1990.
9. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation. Reading, MA: Addison-Wesley, 1979.
10. R. Kumar and V. K. Garg, "Extremal solutions of inequations over lattices with applications to supervisory control," Theoretical Computer Sci., vol. 148, pp. 67-92, Nov. 1995.
11. _, Modeling and Control of Logical Discrete Event Systems. Boston, MA: Kluwer, 1995.
12. E. T. Lee and L. A. Zadeh, "Note on fuzzy languages," Inform. Sci., pp. 421-434, 1969.
13. M. K. Molloy, "Performance analysis using stochastic Petri nets," IEEE Trans. Computers, vol. C-31, pp. 913-917, Sept. 1982.
14. H. Moon and W. Kwon, "Performance evaluation of a discrete event system via the regular expression of trajectories," in Proc. Int. Workshop Discrete Event Systems, Edinburgh, U.K., Aug. 1996, pp. 226-231.
15. H. Mortzavian, "Controlled stochastic languages," in Proc. Allerton Conf., Urbana, IL, 1993, pp. 938-947.
16. A. Paz, Introduction to Probabilistic Automata. New York: Academic, 1971.
17. M. O. Rabin, "Probabilistic automata," Inform. and Contr., vol. 6, pp. 230-245, 1963.
18. P. J. Ramadge and W. M. Wonham, "Supervisory control of a class of discrete event processes," SIAM J. Contr. Optim., vol. 25, no. 1, pp. 206-230, 1987.
19. W. Rudin, Principles of Mathematical Analysis. New York: McGraw-Hill, 1976.
20. A. Salomaa, "Formal languages and power series," in Handbook of Theoretical Computer Science, J. V. Leeuwen, Ed. Cambridge, MA: MIT Press, 1994.
21. R. Sengupta, "Optimal control of discrete event systems," Ph.D. dissertation, Dept. Electrical Engineering and Computer Science, Univ. Michigan, Ann Arbor, 1995.
22. E. Wong and B. Hajek, Stochastic Processes in Engineering Systems. New York: Springer-Verlag, 1985.