Abstract
This paper studies the control of a class of discrete event processes, i.e. processes that are discrete, asynchronous and possibly nondeter-ministic. The controlled process is described as the generator of a formal language, while the controller, or supervisor, is constructed from the grammar of a specified target language that incorporates the desired closed-loop system behavior. The existence problem for a supervisor is reduced to finding the largest controllable language contained in a given legal language. Two examples are provided.
Keywords
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.
This research was partially supported by NSERC (Canada), Grant No. A-7399.
Preview
Unable to display preview. Download preview PDF.
References
Aveyard, R., 1974. A boolean model for a class of discrete event systems. IEEE Trans. Sys. Man and Cyb. SMC-4, pp. 249–258.
Beauquier, J., and Nivat, M., 1980. Application of formal language theory to problems of security and synchronization. In R.V. Book (Ed.), Formal Language Theory — Perspective and Open Problems, Academic Press, New York; pp. 407–454.
Eilenberg, S., 1974. Automata, Languages, and Machines, Vol. A. Academic Press, New York.
Hailpern, B.T., and Owicki, S.S., 1983. Modular verification of computer communication protocols. IEEE Trans. Commun. COM-31, pp. 56–68.
Hopcroft, J.E., and Ullman, J.D., 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Pub. Co., Reading.
Milne, G., and Milner, R., 1979. Concurrent processes and their syntax. J. Assoc. Comp. Mach. 26, pp. 302–321.
Nijmeijer, H., 1983. Nonlinear Multivariable Control: A Differential Geometric Approach. Thesis, Rijksuniv. te Groningen.
Park, D., 1981. Concurrency and automata on infinite sequences. In Theoretical Computer Science, Lecture Notes in Computer Science 104, Springer-Verlag, New York; pp. 167–183.
Peterson, J.L., 1981. Petri Net Theory and the Modeling of Systems. Prentice-Hall, Inc., Englewood Cliffs.
Pnueli, A., 1979. The temporal semantics of concurrent programs. In Semantics of Concurrent Computation, Lecture Notes in Computer Science 70, Springer-Verlag, New York; pp. 1–20.
Ramadge, P.J., 1983. Control and Supervision of Discrete Event Processes. Ph.D. Thesis, Dept. of Electl. Engrg., University of Toronto.
Ramadge, P.J., and Wonham, W.M., 1982. Supervisory control of discrete event processes. In: Feedback Control of Linear and Nonlinear Systems, Lecture Notes in Control and Information Sciences No. 39. Springer-Verlag, Berlin; pp. 202–214.
Ramadge, P.J., and Wonham, W.M., 1982. Supervision of discrete event processes. Proc. 21st IEEE Conf. on Decision & Control, December; pp. 1228–1229.
Steenstrup, M., Arbib, M.A., and Manes, E.G., 1981. Port automata and the algebra of concurrent processes. Computer and Information Science Tech. Rpt. 81–25, University of Massachusetts (Amherst).
Wonham, W.M., 1979. Linear Multivariable Control: A Geometric Approach, Sec. ed., Springer-Verlag, New York.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag
About this paper
Cite this paper
Ramadge, P.J., Wonham, W.M. (1984). Supervisory control of a class of discrete event processes. In: Bensoussan, A., Lions, J.L. (eds) Analysis and Optimization of Systems. Lecture Notes in Control and Information Sciences, vol 63. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0006306
Download citation
DOI: https://doi.org/10.1007/BFb0006306
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13552-4
Online ISBN: 978-3-540-39010-7
eBook Packages: Springer Book Archive