The Infimal Closed Controllable Superlanguage and Its Application in Supervisory Control

IEEE Transactions on Automatic Control

Volumn 35, Issue 4, 1990, Pages 398-405

  Lafortune, Stéphane ^a   Chen, Enke ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY--FORMAL LANGUAGES;

COMPLETELY SATISFICING SUPERVISORS; DISCRETE-EVENT SYSTEMS; INFIMAL CLOSED CONTROLLABLE SUPERLANGUAGE; NONBLOCKING SUPERVISORS; SUPERVISORY CONTROL THEORY;

CONTROL SYSTEMS, DISCRETE TIME;

EID: 0025416044     PISSN: 00189286     EISSN: 15582523     Source Type: Journal    
DOI: 10.1109/9.52291     Document Type: Article

References (19)

1. P. A. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Reading, MA: Addison-Wesley, 1987.
2. E. Chen and S. Lafortune, “Dealing with blocking in supervisory control of discrete event systems,” in Proc. 28th IEEE Conf. Decision Contr., Dec. 1989, pp. 117-122.
3. H. Cho and S. I. Marcus, “On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation,” Math. Contr. Signals Syst., vol. 2, pp. 47-69, 1989.
4. R. Cieslak, C. Desclaux, A. Fawaz, and P. Varaiya, “Supervisory control of discrete-event processes with partial observations,” IEEE Trans. Automat. Contr., vol. 33, pp. 249-260, Mar. 1988.
5. S. Eilenberg, Automata, Languages and Machines, vol. A. New York: Academic, 1974.
6. C. A. R. Hoare, Communicating Sequential Processes (International Series in Computer Science). Englewood Cliffs, NJ: Prentice-Hall, 1985.
7. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation. Reading, MA: Addison-Wesley, 1979.
8. K. Inan and P. Varaiya, “Finitely recursive process models for discrete event systems,” IEEE Trans. Automat. Contr., vol. 33, pp. 626-639, July 1988.
9. S. Lafortune, “Modeling and analysis of transaction execution in database systems,” IEEE Trans. Automat. Contr. vol. 33, pp. 439-447, May 1988.
10. F. Lin and W. M. Wonham, “On the computation of supremal controllable sublanguages,” in Proc. 23rd Allerton Conf., Sept. 1985.
11. F. Lin and W. M. Wonham, “On observability of discrete-event systems,” Inform. Sci., vol. 44, pp. 173-198, 1988.
12. J. L. Peterson, Petri Net Theory and the Modelling of Systems. Englewood Cliffs, NJ: Prentice-Hall, 1981.
13. P. J. Ramadge, “A note on the fixpoint characterization of supremal controllable sublanguages,” in Proc. 1987 Conf. Inform. Sci. Syst., Johns Hopkins University, Baltimore, MD, Mar. 1987.
14. P. J. Ramadge and W. M. Wonham, “Supervisory control of a class of discrete event systems,” SIAM J. Contr. and Optimiz., vol. 25, pp. 206-230, Jan. 1987.
15. K. Rudie, “Software for the control of discrete event systems,” Master's thesis, Dept. Elec. Eng., Univ. Toronto, Feb. 1988.
16. A. Tarski, “A lattice-theoretical fixpoint theorem and its applications,” Pac. J. Math., vol. 5, pp. 285-309, 1955.
17. W. M. Wonham, “A control theory for discrete event systems,” in Advanced Computing Concepts and Techniques in Control Engineering (Nato ASI Series, vol. F47), M. J. Denham and A. J. Laub, Eds. New York: Springer-Verlag, 1988, pp. 129-169.
18. W. M. Wonham and P. J. Ramadge, “On the supremal controllable sublanguage of a given language,” SIAM J. Contr. and Optimiz., vol. 25, pp. 637-659, May 1987.
19. W. M. Wonham and P. J. Ramadge, “Modular supervisory control of discrete-event systems,” Math. Contr. Signals Syst., vol. 1, no. 1, pp. 13-30, 1988.