Approximate Equivalence of the Hybrid Automata with Taylor Theory

Abstract EN

Hybrid automaton is a formal model for precisely describing a hybrid system in which the computational processes interact with the physical ones.

The reachability analysis of the polynomial hybrid automaton is decidable, which makes the Taylor approximation of a hybrid automaton applicable and valuable.

In this paper, we studied the simulation relation among the hybrid automaton and its Taylor approximation, as well as the approximate equivalence relation.

We also proved that the Taylor approximation simulates its original hybrid automaton, and similar hybrid automata could be compared quantitatively, for example, the approximate equivalence we proposed in the paper.