Supervisory Control

  • Tiziano Villa
  • Nina Yevtushenko
  • Robert K. Brayton
  • Alan Mishchenko
  • Alexandre Petrenko
  • Alberto Sangiovanni-Vincentelli
Chapter

Abstract

Supervisory control is an important area of discrete control theory that received a growing attention since the seminal work of Ramadge and Wonham (see, for example [119, 77, 78, 8, 25]). In this chapter we apply the techniques for language equation solving to supervisory control problems, taking into account that methods for language equation solving cannot be directly used in supervisory control, and vice versa. The reason is that from one side the topology addressed in supervisory control is a special case of the general topology addressed by language equation solving; from another side in supervisory control one is required to model also partial controllability and partial observability, which are formalized in a different way when solving language equations.

Keywords

Regular Language Supervisory Control Partial Controllability Large Solution Partial Observability 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Tiziano Villa
    • 1
  • Nina Yevtushenko
    • 2
  • Robert K. Brayton
    • 3
  • Alan Mishchenko
    • 4
  • Alexandre Petrenko
    • 5
  • Alberto Sangiovanni-Vincentelli
    • 4
  1. 1.Dipartimento D’InformaticaUniversità di VeronaVeronaItaly
  2. 2.Department of EECSTomsk State UniversityTomskRussia
  3. 3.Department of Electrical Engineering and Computer ScienceUniversity of CaliforniaBerkeleyUSA
  4. 4.Department of Electrical Engineering and Computer Science (EECS)University of California, BerkeleyBerkeleyUSA
  5. 5.Computer Research Institute of Montreal (CRIM)MontrealCanada

Personalised recommendations