Abstract
The evolution of physical quantities such as position, temperature, humidity, etc, is usually described by differential equations with solutions evolving on \({\mathbb R}^n\) or appropriate subsets. The infinite cardinality of \({\mathbb R}^n\) prevents a direct application of the verification methods described in Chapter 5. However, verification algorithms are still applicable whenever suitable finite-state abstractions of these infinite-state systems can be constructed. In recent years, several methods have been proposed for the construction of these abstractions based on a very interesting blend of different mathematical techniques. We present several of these methods starting with timed automata to illustrate the general principles of the abstraction process. Most of the abstraction techniques described in this chapter require linear differential equations. For this reason, we discuss as a special topic how to transform a class of nonlinear differential equations into linear di_erential equations in larger state spaces.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer-Verlag US
About this chapter
Cite this chapter
Tabuada, P. (2009). Exact symbolic models for verification. In: Verification and Control of Hybrid Systems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-0224-5_7
Download citation
DOI: https://doi.org/10.1007/978-1-4419-0224-5_7
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-0223-8
Online ISBN: 978-1-4419-0224-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)