Approximate Equivalence of the Hybrid Automata with Taylor Theory
Joint Authors
Yang, Shihan
Tan, Hongyan
Wu, Jinzhao
He, Anping
Source
Journal of Applied Mathematics
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-5, 5 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-05-11
Country of Publication
Egypt
No. of Pages
5
Main Subjects
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.
American Psychological Association (APA)
He, Anping& Wu, Jinzhao& Yang, Shihan& Tan, Hongyan. 2014. Approximate Equivalence of the Hybrid Automata with Taylor Theory. Journal of Applied Mathematics،Vol. 2014, no. 2014, pp.1-5.
https://search.emarefa.net/detail/BIM-503256
Modern Language Association (MLA)
He, Anping…[et al.]. Approximate Equivalence of the Hybrid Automata with Taylor Theory. Journal of Applied Mathematics No. 2014 (2014), pp.1-5.
https://search.emarefa.net/detail/BIM-503256
American Medical Association (AMA)
He, Anping& Wu, Jinzhao& Yang, Shihan& Tan, Hongyan. Approximate Equivalence of the Hybrid Automata with Taylor Theory. Journal of Applied Mathematics. 2014. Vol. 2014, no. 2014, pp.1-5.
https://search.emarefa.net/detail/BIM-503256
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-503256