Abstract
Approximating automata are finite-state representations of the sequential input-output behaviors of hybrid systems characterized by threshold events that trigger discrete changes in the continuous dynamic equations. Procedures proposed for constructing approximating automata require forward and backward mappings of sets of continuous state trajectories — mappings which are not available for arbitrary continuous dynamics. This paper develops the foundations for constructing approximating automata automatically for hybrid systems in which the continuous dynamics are defined by convex polytopes in the vector space of the derivatives of the continuous state trajectories. The computations are illustrated for a simple example which also demonstrates the use of approximating automata to solve verification problems that may be intractable using fixed-point computations for linear hybrid automata.
This research was supported in part by DARPA contract F33615-97-C-1012.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Alur, T.A. Henzinger, and P.-H. Ho. Automatic symbolic verification of embedded systems. IEEE Trans. on Software Engineering, 22(3):181–201, Mar 1996.
A. Chutinan and B.H. Krogh. Computing approximating automata for a class of hybrid systems. Mathematical Modeling of Systems: Special Issue on Discrete Event Models of Continuous Systems, submitted.
J.E.R. Cury, B.H. Krogh, and T. Niinomi. Synthesis of supervisory controllers for hybrid systems based on approximating automata. IEEE Trans. on Automatic Control, to appear in the Special Issue on Hybrid Systems, 1997. a preliminary version of this paper also appeared in Proc. 34th IEEE CDC, pp. 1461–1466.
P.W. Glynn. A gsmp formalism for discrete event systems. Proceedings of the IEEE, 77(1):14–23, Jan 1989.
B.H. Krogh. Condition/event signal interfaces for block diagram modeling and analysis of hybrid systems. In Proc. 1993 IEEE International Symposium on Intelligent Control, pages 180–185, Aug 1993.
R.P. Kurshan. Computer-Aided Verification of Coordinating Processes. Princeton University Press, Princeton, NJ, 1994.
K.L. McMillan. Neuro-Dynamic Programming. Klumer, 1993.
T. Niinomi and B.K. Krogh. Modeling and analsyis of swithced-mode hybrid systems driven by threshold events. In H. Khalil, J. Chow, and P.A. Ioannou, editors, Proc. of Workshop on Advances in Control Systems and its Applications, pages 155–172. Springer-Verlag, 1995.
T. Niinomi, B.K. Krogh, and J.E.R. Cury. Refinements of approximating automata for synthesis of supervisory controllers for hybrid systems. In R. Alur, T.A. Henzinger, and E.D. Sontag, editors, Hybrid Systems III, pages 475–484. Springer-Verlag, 1996.
J. Raisch and S.D. O’Young. Discrete approximation and supervisory control of continuous systems. IEEE Trans. on Automatic Control, page to appear, 1998.
P.J.G. Ramadge and W.M. Wonham. The control of discrete event systems. Proceedings of the IEEE, 77(1):81–98, Jan 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chutinan, A., Krogh, B.H. (1999). Computing Approximating Automata for a Class of Linear Hybrid Systems. In: Antsaklis, P., Lemmon, M., Kohn, W., Nerode, A., Sastry, S. (eds) Hybrid Systems V. HS 1997. Lecture Notes in Computer Science, vol 1567. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49163-5_2
Download citation
DOI: https://doi.org/10.1007/3-540-49163-5_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65643-2
Online ISBN: 978-3-540-49163-7
eBook Packages: Springer Book Archive