Abstract
We introduce a denotational semantics for non-linear hybrid automata, and relate it to the operational semantics given in terms of hybrid trajectories. The semantics is defined as least fixpoint of an operator on the continuous domain of functions of time that take values in the lattice of compact subsets of n-dimensional Euclidean space. The semantic function assigns to every point in time the set of states the automaton can visit at that time, starting from one of its initial states. Our main results are the correctness and computational adequacy of the denotational semantics with respect to the operational semantics and the fact that the denotational semantics is computable.
This work has been partially supported by DFG (Germany) and the European Union.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Abramsky, S., Jung, A.: Domain Theory. In: Abramsky, S., Gabbay, D., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 3, Clarendon Press (1994)
Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T., Ho, P.-H., Nicollin, X., Olivero, A., Sifakis, J., Yovine, S.: The algorithmic analysis of hybrid systems. Theoret. Comp. Sci 138(1), 3–34 (1995)
Alur, R., Henzinger, T., Ho, P.-H.: Automatic symbolic verification of embedded systems. IEEE Transactions on Software Engineering 22(3), 181–201 (1996)
Aubin, J.-P.: Viability Theory. Birkhäuser (1991)
Edalat, A.: Dynamical systems, measures and fractals via domain theory. Information and Computation 120(1), 32–48 (1995)
Edalat, A.: Power domains and iterated function systems. Information and Computation 124, 182–197 (1996)
Edalat, A., Krznarić, M., Lieutier, A.: Domain-theoretic solution of differential equations (scalar fields). In: Proceedings of MFPS XIX. Elect. Notes in Theoret. Comput. Sci, vol. 83 (2004)
Edalat, A., Lieutier, A.: Domain theory and differential calculus (functions of one variable. Math. Struct. Comp. Sci. 14 (2004)
Edalat, A., Pattinson, D.: A domain theoretic account of picard’s theorem. In: DÃaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 494–505. Springer, Heidelberg (2004)
Edalat, A., Pattinson, D.: Domain theoretic solutions of initial value problems for unbounded vector fields. In: Escardó, M. (ed.) Proc. MFPS XXI. Electr. Notes in Theoret. Comp. Sci ( to appear, 2005)
Gierz, G., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M., Scott, D.: Continuous Lattices and Domains. Cambridge University Press, Cambridge (2003)
Henzinger, T.: The theory of hybrid automata. In: Inan, M., Kurshan, R. (eds.) CADE 1984. NATO ASI Series F: Computer and Systems Sciences, vol. 170, pp. 265–292. Springer, Heidelberg (2000)
Henzinger, T., Ho, P.-H., Wong-Toi, H.: HYTECH: A model checker for hybrid systems. International Journal on Software Tools for Technology Transfer 1(1–2), 110–122 (1997)
Henzinger, T., Ho, P.-H., Wong-Toi, H.: Algorithmic analysis of nonlinear hybrid systems. IEEE Transactions on Automatic Control 43, 540–554 (1998)
Henzinger, T., Horowitz, B., Majumdar, R., Wong-Toi, H.: Beyond HYTECH: Hybrid systems analysis using interval numerical methods. In: Lynch, N.A., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol. 1790, pp. 130–144. Springer, Heidelberg (2000)
Hutchinson, J.E.: Fractals and self-similarity. Indiana University Mathematics Journal 30, 713–747 (1981)
Lygeros, J., Godbole, D., Sastry, S.: Verified hybrid controllers for automated vehicles. IEEE Transactions on Automatic Control 43(4), 522–539 (1998)
Müller, O., Stauner, T.: Modelling and verification using linear hybrid automata – a case study. Mathematical and Computer Modelling of Dynamical Systems 6(1), 71–89 (2000)
Simic, S., Johansson, K., Sastry, S., Lygeros, J.: Towards a geometric theory of hybrid systems. In: Lynch, N.A., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol. 1790, pp. 421–436. Springer, Heidelberg (2000)
Tomlin, C., Pappas, G., Sastry, S.: Conflict resolution for air traffic management: A study in muti-agent hybrid systems. IEEE Transactions on Automatic Control 43(4), 509–521 (1998)
Weihrauch, K.: Computable Analysis. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Edalat, A., Pattinson, D. (2006). Denotational Semantics of Hybrid Automata. In: Aceto, L., Ingólfsdóttir, A. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2006. Lecture Notes in Computer Science, vol 3921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11690634_16
Download citation
DOI: https://doi.org/10.1007/11690634_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33045-5
Online ISBN: 978-3-540-33046-2
eBook Packages: Computer ScienceComputer Science (R0)