@article{Luo:2014vv,
    Abstract = {Hybrid automaton is a formal model for precisely describing a hybridsystem in which the computational processes interact with the physicalones. The reachability analysis of the polynomial hybrid automaton isdecidable, which makes the <italic>Taylor</italic> approximation of a hybrid automatonapplicable and valuable. In this paper, we studied the simulation relationamong the hybrid automaton and its Taylor approximation, as well asthe approximate equivalence relation. We also proved that the Taylor approximation simulates its original hybrid automaton, and similar hybridautomata could be compared quantitatively, for example, the approximate equivalence we proposed in the paper.},
    Author = {Luo, Guiming and He, Anping and Wu, Jinzhao and Yang, Shihan and Tan, Hongyan},
    File = {Approximate Equivalence of the Hybrid Automata with Taylor Theory - 850789 - v.pdf},
    ISBN = {1110-757X},
    Journal = {Journal of Applied Mathematics},
    Pages = {850789},
    Publisher = {Hindawi Publishing Corporation},
    Title = {Approximate Equivalence of the Hybrid Automata with Taylor Theory},
    URL = {https://doi.org/10.1155/2014/850789},
    Volume = {2014},
    Year = {2014},
    bdsk-url-1 = {https://doi.org/10.1155/2014/850789},
    da = {2014/05/11},
    date-added = {2021-04-29 11:06:27 +0200},
    date-modified = {2021-04-29 11:06:27 +0200},
    ty = {JOUR},
    doi = {10.1155/2014/850789}
}

@article{Luo:2014vv, Abstract = {Hybrid automaton is a formal model for precisely describing a hybridsystem in which the computational processes interact with the physicalones. The reachability analysis of the polynomial hybrid automaton isdecidable, which makes the Taylor approximation of a hybrid automatonapplicable and valuable. In this paper, we studied the simulation relationamong the hybrid automaton and its Taylor approximation, as well asthe approximate equivalence relation. We also proved that the Taylor approximation simulates its original hybrid automaton, and similar hybridautomata could be compared quantitatively, for example, the approximate equivalence we proposed in the paper.}, Author = {Luo, Guiming and He, Anping and Wu, Jinzhao and Yang, Shihan and Tan, Hongyan}, File = {Approximate Equivalence of the Hybrid Automata with Taylor Theory - 850789 - v.pdf}, ISBN = {1110-757X}, Journal = {Journal of Applied Mathematics}, Pages = {850789}, Publisher = {Hindawi Publishing Corporation}, Title = {Approximate Equivalence of the Hybrid Automata with Taylor Theory}, URL = {https://doi.org/10.1155/2014/850789}, Volume = {2014}, Year = {2014}, bdsk-url-1 = {https://doi.org/10.1155/2014/850789}, da = {2014/05/11}, date-added = {2021-04-29 11:06:27 +0200}, date-modified = {2021-04-29 11:06:27 +0200}, ty = {JOUR}, doi = {10.1155/2014/850789} }