Skip to main content

Lazy Hybrid Automata

A hybrid automaton's discrete level of detail is in conflict with the implementability of its direct representation. Here I propose a lazy hybrid automata suitable for handling high levels of discrete detail, and sketch its practical impact on a simulation algorithm.

Read more…

Structured Transition Guards

The definitions of hybrid automata that I have come across define the transition guards as subsets of the continouous state space. Here I propose a more structured definition; one suitable for computation using differential-algebraic equation system solvers with root-finding capabilities, like IDA from [Hindmarsh2005].

Read more…