Modelling of Engineering Phenomena by Finite Automata
This chapter addresses the modelling of technical systems by finite automata, both deterministic and nondeterministic. It will focus on various ways of describing the interaction between the system to be controlled and the controller. This ranges from an input/output point of view, which is mostly employed in “classical” systems theory, to the standard mechanism used in supervisory control, namely the partitioning of the overall event set into controllable and noncontrollable events. The former point of view leads to well-known concepts as Mealy and Moore automata, the latter to so-called generators, i.e., finite automata with partial transition functions. This chapter will also (briefly) touch on the issue of approximating finite automata, i.e., the question of how systems with an intrinsically infinite state space can be approximated by finite state machines such that control obtained for the approximation is meaningful for the underlying infinite state system.
Unable to display preview. Download preview PDF.
- 2.Antsaklis, P.J., Nerode, A.: IEEE Transactions on Automatic Control–Special Issue on Hybrid Control Systems 43 (1998)Google Scholar
- 5.Evans, R., Savkin, A.V.: Systems and Control Letters–Special Issue on Hybrid Control Systems 38 (1999)Google Scholar
- 8.Lunze, J., Lamnabhi-Lagarrigue, F. (eds.): The HYCON Handbook of Hybrid Systems Control: Theory, Tools, Applications. Cambridge University Press (2009)Google Scholar
- 13.Morse, A.S., Pantelides, C.C., Sastry, S.S., Schumacher, J.M.: Automatica–Special issue on Hybrid Control Systems 35 (1999)Google Scholar
- 18.Tabuada, P.: Verification and Control of Hybrid Systems: A Symbolic Approach. Springer-Verlag, New York Inc. (2009)Google Scholar
- 21.Wonham, W.M.: Notes on control of discrete event systems. Department of Electrical & Computer Engineering. University of Toronto, Canada (2001)Google Scholar