On Controllable Languages in Supervisory Control of Discrete Event Systems

  • Stéphane Lafortune
  • Enke Chen
Part of the Progress in Systems and Control Theory book series (PSCT, volume 3)

Abstract

The concept of controllable language has been shown to be of prime importance in the theory initiated by Ramadge and Wonham for the supervisory control of discrete event systems. After reviewing the notion of supremal controllable sublanguage L of a given language L , we introduce and study the new notions of supremal closed and controllable sublanguage L cl and infimal closed and controllable superlanguage L of L. We discuss the duality between L and L and propose algorithms for the computation of L cl and L .

Keywords

Prefix 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    E. Chen and S. Lafortune. Dealing with blocking in supervisory control of discrete event systems. In Proc. 28th IEEE Conf. on Decision and Control, 1989.Google Scholar
  2. [2]
    H. Cho and S. I. Marcus. On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation. Math. Control Signals Systems, 2:47–69, 1989.CrossRefGoogle Scholar
  3. [3]
    R. Cieslak, C. Desclaux, A. Fawaz, and P. Varaiya. Supervisory control of discrete-event processes with partial observations. IEEE Trans. Automatic Control, 33(3):249–260, March 1988.CrossRefGoogle Scholar
  4. [4]
    S. Eilenberg. Automata, Languages and Machines, Vol. A. Academic Press, New York, 1974.Google Scholar
  5. [5]
    J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA, 1979.Google Scholar
  6. [6]
    S. Lafortune. Modeling and analysis of transaction execution in database systems. IEEE Trans. Automatic Control, 33(5):439–447, May 1988.CrossRefGoogle Scholar
  7. [7]
    S. Lafortune. On transaction execution in database systems. In C. I. Byrnes, C. F. Martin, and R. E. Saeks, editors, Analysis and Control of Nonlinear Systems, pages 331–336. North-Holland, 1988.Google Scholar
  8. [8]
    S. Lafortune and E. Chen. On the infimal closed and controllable superlanguage of a given language. Technical Report No. 1–88, College of Engineering Control Group, University of Michigan, November 1988.Google Scholar
  9. [9]
    F. Lin and W. M. Wonham. On the computation of supremal controllable sublanguages. In Proc. 23rd Allerton Conf., September 1985.Google Scholar
  10. [10]
    F. Lin and W. M. Wonham. On observability of discrete-event systems. Information Sciences, 44:173–198, 1988.CrossRefGoogle Scholar
  11. [11]
    P. J. Ramadge. A note on the fixpoint characterization of supremal controllable sublanguages. In Proc. 1987 Conf. Information Sciences and Systems, Johns Hopkins University, Baltimore, MD, March 1987.Google Scholar
  12. [12]
    P. J. Ramadge and W. M. Wonham. Supervisory control of a class of discrete event systems. SIAM J. Control and Optimization, 25(l):206–230, January 1987.CrossRefGoogle Scholar
  13. [13]
    A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math., 5:285–309, 1955.Google Scholar
  14. [14]
    W. M. Wonham and P. J. Ramadge. On the supremal controllable sublanguage of a given language. SIAM J. Control and Optimization, 25(3):637–659, May 1987.CrossRefGoogle Scholar
  15. [15]
    W. M. Wonham and P. J. Ramadge. Modular supervisory control of discrete-event systems. Math. Control Signals Systems, 1(1):13–1988.Google Scholar

Copyright information

© Birkhäuser Boston 1990

Authors and Affiliations

  • Stéphane Lafortune
  • Enke Chen

There are no affiliations available

Personalised recommendations