Approximate equivalence of the hybrid automata with Taylor theory

DOI10.1155/2014/850789zbMath1442.68093OpenAlexW2084084504WikidataQ59052808 ScholiaQ59052808MaRDI QIDQ2336779

Hongyan Tan, Shihan Yang, Anping He, Jinzhao Wu

Publication date: 19 November 2019

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/850789

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The algorithmic analysis of hybrid systems
• What's decidable about hybrid automata?
• Taylor approximation for hybrid systems
• Algorithmic analysis of nonlinear hybrid systems
• On Reachability Under Uncertainty
• Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking
• Hybrid Systems: Computation and Control
• Foundations of Software Science and Computation Structures

This page was built for publication: Approximate equivalence of the hybrid automata with Taylor theory