jehelset@gmail.com
Here the HA from Lazy Hybrid Automaton is extended with actions, in the form of an algebraic equation system. Actions are then seen in action as we define and illustrate a method of creating piewise affine abstractions through simulation.
Here we reformulate the piecewise affine flower system referred to in [Hedlund99] as a Lazy Hybrid Automaton and simulate it as such with hysj.
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.
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].