Viability theory
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Dynamical systems, measures, and fractals via domain theory
Information and Computation
Handbook of logic in computer science (vol. 3)
Power domains and iterated function systems
Information and Computation
Computable analysis: an introduction
Computable analysis: an introduction
Automatic Symbolic Verification of Embedded Systems
IEEE Transactions on Software Engineering
Beyond HYTECH: Hybrid Systems Analysis Using Interval Numerical Methods
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Towards a Geometric Theory of Hybrid Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Domain theory and differential calculus (functions of one variable)
Mathematical Structures in Computer Science
A hybrid denotational semantics for hybrid systems
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
| Hi-index | 0.00 |
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.