Abstract
We consider a class of hybrid dynamical systems and obtain conditions under which the behavior of these systems can be reduced to a finite state automaton. Specifically, we consider timed automata with more general enabling regions coupling the continuous and discrete dynamics than those previously considered. We provide a necessary condition for the existence of a finite state reduction, together with examples showing that this condition is not sufficient. We then give two sufficient conditions that provide a large class of systems with general enabling regions which admit finite reductions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alur, R., et al.1992. Minimization of timed transition systems. Lecture Notes in Computer Science 630, R. J. Cleaveland, ed., Springer-Verlag, 340-354.
Alur, R., Courcoubetis, C., Henzinger, T. A., and Ho, P.-H. 1993. Hybrid automata: an algorithmic approach to the specification and verification of hybrid systems. Hybrid Systems I, Grossman et al., ed., Springer-Verlag, 209-229.
Alur, R., et al. 1994. The algorithmic analysis of hybrid systems. Lecture Notes in Control and Information Sciences 199, G. Cohen and J.-P. Quadrat, Springer-Verlag, 331-351.
Alur, R., and Dill, D. L. 1990. Automata for modeling real-time systems. Proceedings of the 17th International Colloquium: Automata, Languages and Programming, pp. 322-335.
Branicky, M. S., Borkar, V. S., and Mitter, S. K. 1994. A unified framework for hybrid control. Proc. 33rd IEEE Conference on Decision and Control, pp. 4228–4234.
Brockett, R. 1994. Language driven hybrid systems. Proc. 33rd IEEE Conference on Decision and Control, pp. 4210-4214.
Deshpande, A., and Varaiya, P. 1995. Information structures for control and verification of hybrid systems. Proc. American Control Conference, pp. 2642-2647.
Henzinger, T. A. 1995. Hybrid automata with finite bisimulations. Lecture Notes in Computer Science 944, Z. Fülöp and F. Gécseg, eds., Springer-Verlag, 324-335.
Henzinger, T. A. 1996. The theory of hybrid automata. Proc. 11th Annual Symp. on Logic in Computer Science, IEEE Computer Society Press, pp. 278-292.
Kanellakis, P. C., and Smolka, S. A. 1990. CSS expressions, finite-state processes, and three problems of equivalence, Information and Computation 86: 43-68.
Kohn, W., and Nerode, A. 1993. Models for hybrid systems: automata, topologies, controllability, observability. Hybrid Systems, R. Grossman et al., eds., Lecture Notes in Computer Science 736, Springer-Verlag, 297-316.
McManis, J., and Varaiya, P. 1994. Suspension automata: a decidable class of hybrid automata. Proc. 6th Workshop on Computer Aided Verification.
Paige, R., and Tarjan, R. E. 1987. Three partition-refinement algorithms. SIAM J. Computing 16-6: 973-989.
Puri, A., and Varaiya, P. 1994. Decidability of hybrid systems with rectangular differential equations. Proc. 6th Workshop on Computer Aided Verification.
Ramadge, P. J. 1990. On the periodicity of symbolic observations of piecewise smooth discrete-Time systems. IEEE Tran. Automatic Control 35: 807-813.
Stiver, J. A., Antsaklis, P. J., and Lemmon, M. D. 1994. Digital control from a hybrid perspective. Proc. 33rd IEEE Conference on Decision and Control, pp. 4241-4246.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gennaro, S.D., Horn, C., Kulkarni, S.R. et al. Reduction of Timed Hybrid Systems. Discrete Event Dynamic Systems 8, 343–351 (1998). https://doi.org/10.1023/A:1008385431572
Issue Date:
DOI: https://doi.org/10.1023/A:1008385431572