Abstract
The problem of synthesizing a nontrivial controllable and observable sublanguage of a given non-prefix-closed language is addressed. This problem arises in supervisory control of discrete-event systems, when the objective is to synthesize safe nonblocking supervisors for partially observed systems. The decentralized version of this problem is known to be unsolvable. We show that the centralized version of this problem is solvable by presenting a new algorithm that synthesizes a nontrivial controllable and observable sublanguage of the given non-prefix-closed language, if one exists. We also show that the union of all nonblocking solutions to the associated supervisory control problem can be expressed as the union of all regular nonblocking solutions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arnold A, Vincent A, Walukiewicz I (2003) Games for synthesis of controllers with partial observation. Theoret Comput Sci 1(303):7–34
Cassandras CG, Lafortune S (1999) Introduction to Discrete Event Systems. Massachusetts: Kluwer Academic Publishers
Chen E, Lafortune S (1990) On the infimal closed and controllable superlanguage of a given language. IEEE Transactions on Automatic Control 35(4):398–404
Cho H, Marcus SI (1989) On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation. Math Control, Signals Systems 2:47–69
Inan K (1994) Nondeterministic supervison under partial observation. In: G Cohen and J Quadrat (eds). 11th International Conference on Analysis and Optimization of Systems: Discrete Event Systems, Sophia-Antipolis, France, vol 199, pp 39–48
Lamouchi H, Thistle J (2000) Control of infinite behaviour of discrete event systems under partial observations. In Proc. of CDC 2000, IEEE Conference on Decision and Control, Sydney, Australia. vol 1, pp. 22–28
Lin F, Wonham WM (1988) On observability of discrete-event systems. Inform Sci 44(3):173–198
Ramadge PJ, Wonham WM (1987) Supervisory control of a class of discrete event processes. SIAM J Control and Optim 25(1):206–230
Rudie K, Willems JC (1995) The computational complexity of decentralized discrete-event control problems. IEEE Transactions on Automatic Control 40(7):1313–1318
Rudie K, Wonham WM (1990) The infimal prefix closed and observable superlanguage of a given language. Systems and Control Letters 15(5):361–371
Rudie K, Wonham WM (1992) Think globally, act locally: decentralized supervisory control. IEEE Trans Autom Control 37(11):1692–1708
Tripakis S (2001) Undecidable problems of decentralized observation and control. In Proc. of CDC 2001, IEEE Conference on Decision and Control, Orlando, Florida. vol 90, pp 4104–4109
Tsitsiklis JN (1989) On the control of discrete event dynamical systems. Math Control, Signals Systems 2(2):95–107
Wonham WM, Ramadge PJ (1987) On the supremal controllable sublanguage of a given language. SIAM J Control Optim 25(3):637–659
Yoo T, Lafortune S (2002) A general architecture for decentralized supervisory control of discrete-event systems. Discrete Event Dynamic Systems: Theory and Applications 12(3):335–377
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was done when the first author was at the University of Michigan as a Ph.D. student.
Rights and permissions
About this article
Cite this article
Yoo, TS., Lafortune, S. Solvability of Centralized Supervisory Control Under Partial Observation. Discrete Event Dyn Syst 16, 527–553 (2006). https://doi.org/10.1007/s10626-006-0023-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10626-006-0023-7