Control of Discrete-Event Systems with Partial Observations Using Coalgebra and Coinduction
- 88 Downloads
Control of discrete-event systems with partial observations is treated by concepts and results of coalgebra and coinduction. Coalgebra is part of abstract algebra and enables a generalization of the computer science concept of bisimulation. It can be applied to automata theory and then provides a powerful algebraic tool to treat problems of supervisory control. A framework for control of discrete-event systems with partial observations is formulated in terms of coalgebra. The contributions to control theory are besides the framework, algorithms for supremal normal and supremal normal and controllable sublanguages of the plant.
Keywordssupervisory control coalgebra bisimulation coinduction partial observations
Unable to display preview. Download preview PDF.
- Aczel, P. Non-Well-Founded Sets. CSLI Lecture Notes, Number 14, Stanford University, 1988.Google Scholar
- Aczel, P., and Mendler, N. 1989. A final coalgebra theorem. In D. H. Pitt, D. E. Ryeheard, P. Dybjer, A. M. Pitts and A. Poigne (eds.), Proc. Category Theory and Computer Science, Lecture Notes in Computer Science, Volume 389, pp. 357–365.Google Scholar
- Bergeron, A. 1993. A unified approach to control problems in discrete event processes. Inform. Théor. Appl. 27(6): 555–573.Google Scholar
- Cassandras, S. G., and Lafortune, S. 1999. Introduction to Discrete Event Systems. Dordrecht: Kluwer Academic Publishers.Google Scholar
- Cho, H., and Marcus, S. I. 1989a. On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observations. Math. Control Signal Syst. 2: 47–69.Google Scholar
- Cho, H., and Marcus, S. I. 1989b. Supremal and maximal sublanguages arising in supervisor synthesis problems with partial observations. Math. Syst. Theory 22: 171–211.Google Scholar
- Eilenberg, S. 1974. Automata, Languages, and Machines. New York: Academic Press.Google Scholar
- Eilenberg, S., and Moore, J. C. 1965. Adjoint functors and triples. Ill. J. Math. 9: 381–398.Google Scholar
- Grossman, R., and Larson, R. G. 1992. The realization map of input–output maps using bialgebras. Forum Math. 4: 109–121.Google Scholar
- Gumm, H. P. 2003. State based systems are coalgebras. Cubo—Matemática Educacional 5(2): 239–262.Google Scholar
- Hopcroft, J. E., and Ullman, J. D. 1979. Introduction to Automata Theory, Languages and Computation. Reading, MA: Addison-Wesley.Google Scholar
- Jacobson, N. 1980. Basic Algebra, Volume 2. New York: W. H. Freeman and Company.Google Scholar
- Komenda, J. 2002a. Computation of supremal sublanguages of supervisory control using coalgebra. In Proceedings WODES’02, Workshop on Discrete-Event Systems, Zaragoza, October 2–4, pp. 26–33.Google Scholar
- Komenda, J. 2002b. Coalgebra and supervisory control of discrete-event systems with partial observations. In Proceedings of MTNS 2002, Notre Dame (IN), August.Google Scholar
- Komenda, J., and van Schuppen, J. H. 2003. Decentralized supervisory control with coalgebra. In Proceedings European Control Conference, ECC’03, Cambridge, September 1–4, 2003, only CD-ROM. Also appeared as Research Report CWI, MAS-E0310, ISSN 1386-3703, Amsterdam.Google Scholar
- Komenda, J., and van Schuppen, J. H. 2004. Supremal normal sublanguages of large distributed discrete-event systems. In Proceedings WODES’04, Workshop on Discrete-Event Systems, Reims, September 22–24.Google Scholar
- Milner, R. 1989b. Communication and Concurrency. Prentice Hall International Series in Computer Science. New York: Prentice Hall International.Google Scholar
- Park, D.M.R. Concurrency and Automata on Infinite Sequences, volume 104 of LNCS. Springer, 1980.Google Scholar
- Rutten, J. J. M. M. 1998. Automata and Coinduction (An Exercise in Coalgebra). Research Report CWI, SEN-R9803, Amsterdam, May. Available also at http://www.cwi.nl/~janr.
- Rutten, J. J. M. M. 1999. Coalgebra, Concurrency, and Control. Research Report CWI, SEN-R9921, Amsterdam, November. Available also at http://www.cwi.nl/~janr.
- Sipser, M. 1997. Introduction to the Theory of Computation. Boston: PWS Publishing Company.Google Scholar
- Takai, S., and Ushio, T. 2002. Effective computation of an Lm(G)-closed, controllable, and observable sublanguage arising in supervisory control. In Proceedings WODES’02, Workshop on Discrete-Event Systems, Zaragoza, October 2–4, pp. 34–39.Google Scholar
- Tarski, A. 1955. A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math. 5: 285–309.Google Scholar
- Tsitsiklis, J. N. 1989. On the control of discrete-event dynamical systems. Math. Control Signals Syst. 95–107.Google Scholar
- Wonham, W. M. 1976. Towards an abstract internal model principle. IEEE Trans. Syst. Man Cybern. 6(11): 735–740.Google Scholar
- Yoo, T. S., Lafortune, S., and Lin, F. 2001. A uniform approach for computing supremal sublanguages arising in supervisory control theory. Preprint, Dept. of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor.Google Scholar