Abstract
This paper presents the formalization of the symbolic simulation and analysis technique for hybrid systems developed in [9, 7, 8]. The main advantage of this technique is the close relation between the hybrid-systems model Hybrid Automata [1, 8] and the execution model CLP(\(\mathcal{R}\)) [3]. Our rule-based description is naturally suited for hybrid systems allowing (a) to lift CLP(\(\mathcal{R}\)) definitions and results for the theory of hybrid systems, and therefore (b) to apply — in addition to forward/backward fixpoint computation and symbolic model-checking — CLP(\(\mathcal{R}\)) intelligent search and backtracking procedures [2] in their analysis, since the depth-first search strategy of CLP(\(\mathcal{R}\)) is incomplete on infinite trees. These techniques were implemented in part on top of the CLP(\(\mathcal{R}\)) prototype system [4]. We illustrate our method with a variant of the reactor temperature control system from [1]. More realistic examples can be found in [9, 7, 8, 6].
Preview
Unable to display preview. Download preview PDF.
References
R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The Algorithmic Analysis of Hybrid Systems. Theoretical Computer Science, 138:3–34, 1995.
B. de Backer and H. Beringer. Intelligent Backtracking for CLP Languages: An Application to CLP(0467-01). In V. Saraswat and K. Ueda, editors, ILPS'91, pages 405–419. MIT Press, 1991.
J. Jaffar and M.J. Maher. Constraint Logic Programming: A Survey. Journal of Logic Programming, 19/20:503–581, 1994.
J. Jaffar, S. Michaylov, P. Stuckey, and R. Yap. The CLP(\(\mathcal{R}\)) Language and System. ACM: TOPLAS, 14(3):339–395, 1992.
D. Srivastava. Subsumption and Indexing in Constraint Query Languages with Linear Arithmetic Constraints. Annals of Math. and Artificial Intelligence, 8:315–343, 1993.
L. Urbina. The Generalised Railroad Crossing: Its Analysis in CLP(0467-03). This volume.
L. Urbina. Analysis of Robotics Applications in CLP(0467-04). In A. Krall and U. Geske, editors, 11. Workshop Logische Programmierung, number 270 in GMD-Studien, pages 39–48. GMD, 1995.
L. Urbina. Analysis of Hybrid Systems in Constraint Logic Programming. PhD thesis, Department of Computer Science, University of Rostock, 1996.
L. Urbina and G. Riedewald. A Framework for Symbolic Simulation of Hybrid Systems. In A. Krall and U. Geske, editors, 11. Workshop Logische Programmierung, number 270 in GMD-Studien, pages 29–38. GMD, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Urbina, L. (1996). Analysis of Hybrid systems in CLP(\(\mathcal{R}\)). In: Freuder, E.C. (eds) Principles and Practice of Constraint Programming — CP96. CP 1996. Lecture Notes in Computer Science, vol 1118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61551-2_93
Download citation
DOI: https://doi.org/10.1007/3-540-61551-2_93
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61551-4
Online ISBN: 978-3-540-70620-5
eBook Packages: Springer Book Archive