Supervisory Control with Partial Observations

Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 433)


In discrete-event systems it is often not realistic to assume that all events of such a system are observable. This is either because some events are typically not directly observable from their very nature (such as failure events, internal hidden events, etc.) or it is too costly to have sensors and observe every event that can occur in the system. Therefore, supervisory control with partial observations has been developed to cope with the additional difficulty of having unobservable events in discrete-event systems. The theory, including the concept of a deterministic observer automaton, necessary and sufficient conditions on a specification language to be achievable as the language of the closed-loop system, formulas and algorithms for computation of sublanguages satisfying these conditions, are presented and illustrated by several examples.




Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bouyer, P., D’Souza, D., Madhusudan, P., Petit, A.: Timed Control with Partial Observability. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 180–192. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  2. 2.
    Brandt, R.D., Garg, V., Kumar, R., Lin, F., Marcus, S.I., Wonham, W.M.: Formulas for calculating supremal controllable and normal sublanguages. Systems Control Letters 15(2), 111–117 (1990)MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Cassandras, C.G., Lafortune, S.: Introduction to Discrete Event Systems, 2nd edn. Springer (2008)Google Scholar
  4. 4.
    Cho, H., Marcus, S.I.: On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observations. Mathematics of Control, Signal and Systems 2, 47–69 (1989)MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Cho, H., Marcus, S.I.: Supremal and maximal sublanguages arising in supervisor synthesis problems with partial observations. Mathematical Systems Theory 22, 171–211 (1989)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Cieslak, R., Desclaux, C., Fawaz, A., Varaiya, P.: Supervisory control of a class of discrete event processes. IEEE Transactions on Automatic Control 33, 249–260 (1988)MATHCrossRefGoogle Scholar
  7. 7.
    Griffin, C.: Decidability and Optimality in Pushdown Control Systems: A New Approach to Discrete Event Control. PhD Thesis. Penn State University, USA (2007)Google Scholar
  8. 8.
    Hashtrudi Zad, S., Moosaeib, M., Wonham, W.M.: On computation of supremal controllable, normal sublanguages. Systems Control Letters 54(9), 871–876 (2005)MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    Komenda, J., van Schuppen, J.H.: Control of discrete-event systems with partial observations using coalgebra and coinduction. Discrete Event Dynamic Systems 15, 257–315 (2005)MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    Lin, F., Wonham, W.M.: On observability of discrete event systems. Information Sciences 44(3), 173–198 (1988)MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Rudie, K., Wonham, W.M.: The infimal prefix-closed and observable superlanguage of a given language. Systems Control Letters 15, 361–371 (1990)MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    Rudie, K., Willems, J.C.: The computational complexity of decentralized discrete-event control problems. IEEE Transactions on Automatic Control 40(7), 1313–1319 (1995)MathSciNetMATHCrossRefGoogle Scholar
  13. 13.
    Schutzenberger, M.P.: On the definition of a family of automata. Information and Control 4, 145–270 (1961)Google Scholar
  14. 14.
    Takai, S., Kodama, S.: M -controllable subpredicates arising in state feed back control of discrete event systems. International Journal of Control 67(4), 553–566 (1997)MathSciNetMATHCrossRefGoogle Scholar
  15. 15.
    Tsitsiklis, J.N.: On the control of discrete-event dynamical systems. Mathematics of Control, Signal and Systems 2, 95–107 (1989)MathSciNetMATHCrossRefGoogle Scholar
  16. 16.
    Takai, S., Ushio, T.: Effective computation of an L m(G)-closed, controllable, and observable sublanguage arising in supervisory control. In: Proc. of 6th Workshop on Discrete Event Systems, Zaragoza, Spain (2002)Google Scholar
  17. 17.
    Wonham, W.M.: Supervisory control of discrete-event systems. Lecture Notes University of Toronto (2011),

Copyright information

© Springer-Verlag London 2013

Authors and Affiliations

  1. 1.Institute of MathematicsAcademy of Sciences of the Czech RepublicBrnoCzech Republic

Personalised recommendations