Abstract
We consider a generalized form of the conventional decentralized control architecture for discrete-event systems where the control actions of a set of supervisors can be “fused” using both union and intersection of enabled events. Namely, the supervisors agree a priori on choosing “fusion by union” for certain controllable events and “fusion by intersection” for certain other controllable events. We show that under this architecture, a larger class of languages can be achieved than before since a relaxed version of the notion of co-observability appears in the necessary and sufficient conditions for the existence of supervisors. The computational complexity of verifying these new conditions is studied. A method of partitioning the controllable events between “fusion by union” and “fusion by intersection” is presented. The algebraic properties of co-observability in the context of this architecture are presented. We show that appropriate combinations of fusion rules with corresponding decoupled local decision rules guarantee the safety of the closed-loop behavior with respect to a given specification that is not co-observable. We characterize an “optimal” combination of fusion rules among those combinations guaranteeing the safety of the closed-loop behavior. In addition, a simple supervisor synthesis technique generating the infimal prefix-closed controllable and co-observable superlanguage is presented.
Similar content being viewed by others
References
Barrett, G. 1999. Modeling, analysis and control of centralized and decentralized logical discrete-event systems. PhD thesis, The University of Michigan.
Cassandras, C. G., and Lafortune, S. 1999. Introduction to Discrete Event Systems. Kluwer Academic Publishers.
Cho, H., and Marcus, S. I. 1989a. On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation. Math. Control Signals Systems 2: 47-69.
Cieslak, R., Desclaux, C., Fawaz, A. and Varaiya, P. 1988. Supervisory control of discrete event processes with partial observation. IEEE Trans. on Automat. Contr. 33(3): 249-260.
Hadj-Alouane, N. B., Lafortune, S., and Lin, F. 1996. Centralized and distributed algorithm for on-line synthesis of maximal control policies under partial observation. Discrete Event Dynamic Systems: Theory and Applications 6(41): 379-427.
Heymann, M., and Lin, F. 1994. On-line control of partially observed discrete event systems. Discrete Event Dynamic Systems: Theory and Applications 4(3): 221-236.
Hopcroft, J. E. 1979. Introduction to automata theory, languages, and computation. Addison-Wesley.
Jiang, S., and Kumar, R. 2000. Decentralized control of discrete event systems with specializations to local control and concurrent systems. IEEE Transactions on Systems, Man and Cybernetics, Part B 30(5): 653-660.
Kozak, P., and Wonham, W. M. 1995. Fully decentralized solutions of supervisory control problems. IEEE Trans. on Automat. Contr. 40(12): 2094-2097.
Kumar, R., and Shayman, M. A. March 1997. Centralized and decentralized supervisory control of non-deterministic systems under partial observation. SIAM J. Control Optim. 35(2): 363-383.
Kumar, R., and Shayman, M. A. 1998. Formulae relating controllability, observability, and co-observability. Automatica 34(2): 211-215.
Lamouchi, H., and Thistle, J. 2000. Control of infinite behavior of discrete event systems under partial observations. In Proc. of CDC 2000, IEEE Conference on Decision and Control 22-28.
Lin, F., and Wonham, W. M. 1988. Decentralized supervisory control of discrete event systems. Information Sciences 44: 199-224.
Lin, F. and Wonham, W. M. 1988. On observability of discrete-event systems. Information Sciences 44(3): 173-198.
Prosser, J. H., Kam, M., and Kwatny, H. G. June 1997. Decision fusion and supervisor synthesis in decentralized discrete-event systems. In Proc. 1997 Ameri. Contr. Conf. 2251-2255.
Prosser, J. 1996. Supervisor Synthesis for Partially Observed Discrete-Event Systems. Ph.D. thesis, Drexel University.
Ramadge, P. J., and Wonham W. M. 1989. The control of discrete event systems. Proc. of the IEEE 77(1): 81-98.
Ricker, S. L. 1999. Knowledge and Communication in Decentralized Discrete-Event Control. Ph.D. thesis, Queen's University.
Rudie, K., and Willems, J. C. 1995. The computational complexity of decentralized discrete-event control problems. IEEE Trans. on Automat. Contr. 40(7): 1313-1318.
Rudie, K., and Willems, W. 1993. IMA preprint series 1105: The computational complexity of decentralized discrete-event control problems. Institute for Mathematics and its Application, www.ima.umn.edu/preprints/MARCH1993/1105.ps.
Rudie, K., and Wonham, W. M. November 1992. Think globally, act locally: Decentralized supervisory control. IEEE Trans. on Automat. Contr. 37(11): 1692-1708.
Takai, S. 1998. On the languages generated under fully decentralized supervision. IEEE Trans. on Automat. Contr. 43(9): 1253-1256.
Takai, S., and Kodama, S. 1994. Decentralized state feedback control of discrete event systems. Systems and Control Letters 22(5): 369-375.
Tripakis, S. 2001. Undecidable problems of decentralized observation and control. In Proc. of CDC 2001, IEEE Conference on Decision and Control.
Tsitsiklis, J. N. 1989. On the control of discrete event dynamical systems. Math. Control Signals Systems 2(2): 95-107.
Willner, Y., and Heymann, M. 1991. Supervisory control of concurrent discrete-event systems. International Journal of Control 54(5): 1143-1169.
Yoo, T.-S. 2002. Monitoring and Control of Centralized and Decentralized Partially-Observed Discrete-Event Systems. Ph.D. thesis, The University of Michigan.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Yoo, TS., Lafortune, S. A General Architecture for Decentralized Supervisory Control of Discrete-Event Systems. Discrete Event Dynamic Systems 12, 335–377 (2002). https://doi.org/10.1023/A:1015625600613
Issue Date:
DOI: https://doi.org/10.1023/A:1015625600613