Open Access
2014 Approximate Equivalence of the Hybrid Automata with Taylor Theory
Anping He, Jinzhao Wu, Shihan Yang, Hongyan Tan
J. Appl. Math. 2014(SI11): 1-5 (2014). DOI: 10.1155/2014/850789


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.


Download Citation

Anping He. Jinzhao Wu. Shihan Yang. Hongyan Tan. "Approximate Equivalence of the Hybrid Automata with Taylor Theory." J. Appl. Math. 2014 (SI11) 1 - 5, 2014.


Published: 2014
First available in Project Euclid: 1 October 2014

zbMATH: 07131922
MathSciNet: MR3212517
Digital Object Identifier: 10.1155/2014/850789

Rights: Copyright © 2014 Hindawi

Vol.2014 • No. SI11 • 2014
Back to Top