Denotational Semantics of Hybrid Automata

  • Abbas Edalat
  • Dirk Pattinson
Conference paper

DOI: 10.1007/11690634_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3921)
Cite this paper as:
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

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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Abbas Edalat
    • 1
  • Dirk Pattinson
    • 2
  1. 1.Department of ComputingImperial College LondonUK
  2. 2.Department of Computer ScienceUniversity of LeicesterUK

Personalised recommendations