Max-algebraic hybrid automata: Modelling and equivalences

Abstract: This article introduces the novel framework of max-algebraic hybrid automata as a hybrid modelling language in the max-plus algebra. We show that the modelling framework unifies and extends the switching max-plus linear systems framework and is analogous to the discrete hybrid automata framework in conventional algebra. In addition, we show that the framework serves as a bridge between automata-theoretic models in max-plus algebra and switching max-plus linear systems. In doing so, we formalise the relationship between max-plus automata and switching max-plus linear systems in a behavioural sense. This also serves as another step towards importing tools for analysis and optimal control from conventional time-driven hybrid systems to discrete-event systems in max-plus algebra.